/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix007_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:02:06,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:02:06,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:02:06,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:02:06,250 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:02:06,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:02:06,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:02:06,252 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:02:06,253 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:02:06,254 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:02:06,255 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:02:06,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:02:06,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:02:06,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:02:06,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:02:06,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:02:06,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:02:06,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:02:06,259 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:02:06,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:02:06,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:02:06,270 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:02:06,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:02:06,271 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:02:06,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:02:06,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:02:06,273 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:02:06,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:02:06,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:02:06,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:02:06,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:02:06,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:02:06,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:02:06,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:02:06,276 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:02:06,276 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:02:06,277 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:02:06,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:02:06,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:02:06,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:02:06,278 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:02:06,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-06-11 06:02:06,309 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:02:06,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:02:06,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:02:06,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:02:06,312 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:02:06,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:02:06,312 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:02:06,312 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:02:06,312 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:02:06,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:02:06,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:02:06,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:02:06,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:02:06,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:02:06,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:02:06,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:02:06,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:02:06,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:02:06,314 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:02:06,314 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:02:06,314 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 06:02:06,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:02:06,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:02:06,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:02:06,572 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:02:06,573 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:02:06,573 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_tso.opt.i [2021-06-11 06:02:06,613 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6850fe9ca/f326ceb35a614c91a73ec907207cc634/FLAG902efb39e [2021-06-11 06:02:07,107 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:02:07,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_tso.opt.i [2021-06-11 06:02:07,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6850fe9ca/f326ceb35a614c91a73ec907207cc634/FLAG902efb39e [2021-06-11 06:02:07,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6850fe9ca/f326ceb35a614c91a73ec907207cc634 [2021-06-11 06:02:07,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:02:07,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:02:07,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:02:07,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:02:07,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:02:07,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1618596 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07, skipping insertion in model container [2021-06-11 06:02:07,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:02:07,197 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:02:07,337 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/mix007_tso.opt.i[948,961] [2021-06-11 06:02:07,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:02:07,477 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:02:07,491 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/mix007_tso.opt.i[948,961] [2021-06-11 06:02:07,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:02:07,580 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:02:07,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07 WrapperNode [2021-06-11 06:02:07,581 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:02:07,583 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:02:07,583 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:02:07,583 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:02:07,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:02:07,634 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:02:07,634 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:02:07,634 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:02:07,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (1/1) ... [2021-06-11 06:02:07,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:02:07,664 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:02:07,664 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:02:07,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:02:07,665 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (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-06-11 06:02:07,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:02:07,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:02:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:02:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:02:07,771 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:02:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:02:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:02:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:02:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 06:02:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 06:02:07,772 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 06:02:07,772 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 06:02:07,773 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:02:07,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:02:07,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:02:07,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:02:07,774 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:02:09,353 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:02:09,353 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:02:09,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:02:09 BoogieIcfgContainer [2021-06-11 06:02:09,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:02:09,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:02:09,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:02:09,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:02:09,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:02:07" (1/3) ... [2021-06-11 06:02:09,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd84ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:02:09, skipping insertion in model container [2021-06-11 06:02:09,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:02:07" (2/3) ... [2021-06-11 06:02:09,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd84ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:02:09, skipping insertion in model container [2021-06-11 06:02:09,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:02:09" (3/3) ... [2021-06-11 06:02:09,359 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_tso.opt.i [2021-06-11 06:02:09,363 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:02:09,366 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:02:09,366 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:02:09,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,395 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,395 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,397 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,398 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,399 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,400 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,401 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,402 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,403 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,404 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,405 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,406 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,407 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,408 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,409 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,410 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,411 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,412 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,413 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,414 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,415 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,416 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,417 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,418 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,418 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,421 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,422 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,429 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,430 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,431 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,432 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:02:09,436 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:02:09,449 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 06:02:09,471 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:02:09,471 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:02:09,471 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:02:09,471 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:02:09,471 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:02:09,471 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:02:09,471 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:02:09,471 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:02:09,482 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-06-11 06:02:09,524 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-06-11 06:02:09,524 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:02:09,534 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-06-11 06:02:09,534 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-06-11 06:02:09,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-06-11 06:02:09,539 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:09,548 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-06-11 06:02:09,550 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-06-11 06:02:09,551 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-06-11 06:02:09,595 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-06-11 06:02:09,595 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:02:09,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2021-06-11 06:02:09,599 INFO L151 LiptonReduction]: Number of co-enabled transitions 2502 [2021-06-11 06:02:09,637 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:09,646 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:09,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:09,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:09,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:09,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:09,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:09,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:09,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:09,898 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:02:09,899 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:02:09,917 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:09,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,025 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,025 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,035 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,080 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,216 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:10,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:10,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:10,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,245 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,256 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,315 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,413 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:10,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:10,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:10,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,451 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:10,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:10,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:10,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,521 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,546 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,610 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:10,617 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:10,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:10,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,753 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:02:10,754 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:10,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:10,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,000 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,159 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:11,512 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:02:11,849 WARN L205 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 06:02:11,961 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 06:02:11,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,975 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:11,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:02:11,982 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:11,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,984 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:02:11,984 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:02:11,986 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:11,988 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 06:02:11,988 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:11,989 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 06:02:11,990 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 06:02:11,990 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:02:12,013 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,015 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 06:02:12,016 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 06:02:12,016 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:02:12,019 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,030 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 06:02:12,070 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:12,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:12,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:12,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,120 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,316 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:12,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:12,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:12,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,351 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,387 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,520 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,534 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:02:12,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,632 INFO L147 QuantifierPusher]: treesize reduction 43, result has 2.3 percent of original size 1 [2021-06-11 06:02:12,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:12,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,894 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:12,895 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:12,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:12,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:13,004 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,007 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:13,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,017 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:13,018 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:02:13,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:13,019 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:13,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,027 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:13,028 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 06:02:13,029 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 06:02:13,030 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:13,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 06:02:13,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 06:02:13,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,077 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:13,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,278 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:13,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:13,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:13,356 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:13,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,772 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:13,773 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:13,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:13,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:14,078 WARN L205 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-06-11 06:02:14,248 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-11 06:02:14,587 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2021-06-11 06:02:14,750 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2021-06-11 06:02:14,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:14,768 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:02:14,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:14,770 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:14,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:14,785 INFO L163 LiptonReduction]: Checked pairs total: 7336 [2021-06-11 06:02:14,786 INFO L165 LiptonReduction]: Total number of compositions: 100 [2021-06-11 06:02:14,787 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5249 [2021-06-11 06:02:14,795 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-06-11 06:02:14,795 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:02:14,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:14,796 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:14,796 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:14,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:14,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1744728645, now seen corresponding path program 1 times [2021-06-11 06:02:14,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:14,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397885704] [2021-06-11 06:02:14,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:14,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:14,966 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:02:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:14,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397885704] [2021-06-11 06:02:14,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:14,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:02:14,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861393188] [2021-06-11 06:02:14,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:02:14,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:14,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:02:14,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:02:14,990 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 217 [2021-06-11 06:02:14,994 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:14,994 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:14,994 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 217 [2021-06-11 06:02:14,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:15,044 INFO L129 PetriNetUnfolder]: 13/73 cut-off events. [2021-06-11 06:02:15,044 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:02:15,045 INFO L84 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 73 events. 13/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 249 event pairs, 5 based on Foata normal form. 16/81 useless extension candidates. Maximal degree in co-relation 105. Up to 25 conditions per place. [2021-06-11 06:02:15,046 INFO L132 encePairwiseOnDemand]: 212/217 looper letters, 6 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2021-06-11 06:02:15,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 90 flow [2021-06-11 06:02:15,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:02:15,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:02:15,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2021-06-11 06:02:15,060 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8632872503840245 [2021-06-11 06:02:15,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2021-06-11 06:02:15,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2021-06-11 06:02:15,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:15,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2021-06-11 06:02:15,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,076 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,077 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 562 transitions. [2021-06-11 06:02:15,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 90 flow [2021-06-11 06:02:15,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 86 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 06:02:15,080 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 70 flow [2021-06-11 06:02:15,082 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2021-06-11 06:02:15,082 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2021-06-11 06:02:15,082 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:15,082 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 70 flow [2021-06-11 06:02:15,083 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2021-06-11 06:02:15,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2021-06-11 06:02:15,087 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-06-11 06:02:15,087 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:02:15,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 29 events. 0/29 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 48 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:02:15,088 INFO L151 LiptonReduction]: Number of co-enabled transitions 422 [2021-06-11 06:02:15,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:15,149 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:15,272 INFO L163 LiptonReduction]: Checked pairs total: 978 [2021-06-11 06:02:15,272 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:02:15,272 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 190 [2021-06-11 06:02:15,273 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-06-11 06:02:15,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,273 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:15,274 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:15,274 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:02:15,274 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:15,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:15,274 INFO L82 PathProgramCache]: Analyzing trace with hash 485638152, now seen corresponding path program 1 times [2021-06-11 06:02:15,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:15,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351467731] [2021-06-11 06:02:15,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:15,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:15,388 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 06:02:15,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 06:02:15,398 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:02:15,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:02:15,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:15,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351467731] [2021-06-11 06:02:15,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:15,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:02:15,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937465198] [2021-06-11 06:02:15,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:02:15,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:15,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:02:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:02:15,406 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 219 [2021-06-11 06:02:15,407 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,407 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:15,407 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 219 [2021-06-11 06:02:15,407 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:15,541 INFO L129 PetriNetUnfolder]: 420/817 cut-off events. [2021-06-11 06:02:15,541 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:02:15,543 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 817 events. 420/817 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 4830 event pairs, 88 based on Foata normal form. 0/750 useless extension candidates. Maximal degree in co-relation 1475. Up to 311 conditions per place. [2021-06-11 06:02:15,545 INFO L132 encePairwiseOnDemand]: 209/219 looper letters, 8 selfloop transitions, 8 changer transitions 16/50 dead transitions. [2021-06-11 06:02:15,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 176 flow [2021-06-11 06:02:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:02:15,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:02:15,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 848 transitions. [2021-06-11 06:02:15,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7744292237442922 [2021-06-11 06:02:15,547 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 848 transitions. [2021-06-11 06:02:15,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 848 transitions. [2021-06-11 06:02:15,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:15,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 848 transitions. [2021-06-11 06:02:15,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.6) internal successors, (848), 5 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,551 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,551 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 848 transitions. [2021-06-11 06:02:15,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 176 flow [2021-06-11 06:02:15,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:02:15,552 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 138 flow [2021-06-11 06:02:15,553 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2021-06-11 06:02:15,553 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 1 predicate places. [2021-06-11 06:02:15,553 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:15,553 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 138 flow [2021-06-11 06:02:15,554 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 138 flow [2021-06-11 06:02:15,554 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 138 flow [2021-06-11 06:02:15,614 INFO L129 PetriNetUnfolder]: 218/512 cut-off events. [2021-06-11 06:02:15,615 INFO L130 PetriNetUnfolder]: For 85/92 co-relation queries the response was YES. [2021-06-11 06:02:15,616 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 512 events. 218/512 cut-off events. For 85/92 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3125 event pairs, 104 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1184. Up to 311 conditions per place. [2021-06-11 06:02:15,619 INFO L151 LiptonReduction]: Number of co-enabled transitions 452 [2021-06-11 06:02:15,625 INFO L163 LiptonReduction]: Checked pairs total: 242 [2021-06-11 06:02:15,625 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:15,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 72 [2021-06-11 06:02:15,626 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 138 flow [2021-06-11 06:02:15,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:15,626 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:15,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:02:15,627 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:15,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:15,627 INFO L82 PathProgramCache]: Analyzing trace with hash 485638521, now seen corresponding path program 1 times [2021-06-11 06:02:15,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:15,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417456979] [2021-06-11 06:02:15,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:15,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:15,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:15,676 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 06:02:15,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 06:02:15,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:15,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417456979] [2021-06-11 06:02:15,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:15,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:02:15,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176639660] [2021-06-11 06:02:15,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:02:15,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:15,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:02:15,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:02:15,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 219 [2021-06-11 06:02:15,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:15,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 219 [2021-06-11 06:02:15,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:15,751 INFO L129 PetriNetUnfolder]: 149/361 cut-off events. [2021-06-11 06:02:15,751 INFO L130 PetriNetUnfolder]: For 136/392 co-relation queries the response was YES. [2021-06-11 06:02:15,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 361 events. 149/361 cut-off events. For 136/392 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1954 event pairs, 41 based on Foata normal form. 19/369 useless extension candidates. Maximal degree in co-relation 1106. Up to 220 conditions per place. [2021-06-11 06:02:15,754 INFO L132 encePairwiseOnDemand]: 211/219 looper letters, 15 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2021-06-11 06:02:15,754 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 226 flow [2021-06-11 06:02:15,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:02:15,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:02:15,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 706 transitions. [2021-06-11 06:02:15,755 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8059360730593608 [2021-06-11 06:02:15,755 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 706 transitions. [2021-06-11 06:02:15,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 706 transitions. [2021-06-11 06:02:15,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:15,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 706 transitions. [2021-06-11 06:02:15,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,758 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,758 INFO L185 Difference]: Start difference. First operand has 42 places, 34 transitions, 138 flow. Second operand 4 states and 706 transitions. [2021-06-11 06:02:15,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 226 flow [2021-06-11 06:02:15,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 41 transitions, 182 flow, removed 10 selfloop flow, removed 4 redundant places. [2021-06-11 06:02:15,761 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 166 flow [2021-06-11 06:02:15,762 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-06-11 06:02:15,762 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 0 predicate places. [2021-06-11 06:02:15,762 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:15,762 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 166 flow [2021-06-11 06:02:15,762 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 166 flow [2021-06-11 06:02:15,762 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 166 flow [2021-06-11 06:02:15,791 INFO L129 PetriNetUnfolder]: 149/357 cut-off events. [2021-06-11 06:02:15,791 INFO L130 PetriNetUnfolder]: For 130/142 co-relation queries the response was YES. [2021-06-11 06:02:15,792 INFO L84 FinitePrefix]: Finished finitePrefix Result has 843 conditions, 357 events. 149/357 cut-off events. For 130/142 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1967 event pairs, 65 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 831. Up to 220 conditions per place. [2021-06-11 06:02:15,795 INFO L151 LiptonReduction]: Number of co-enabled transitions 514 [2021-06-11 06:02:15,800 INFO L163 LiptonReduction]: Checked pairs total: 343 [2021-06-11 06:02:15,800 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:15,801 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-06-11 06:02:15,801 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 166 flow [2021-06-11 06:02:15,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,802 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:15,802 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:15,802 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:02:15,802 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:15,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1048897537, now seen corresponding path program 1 times [2021-06-11 06:02:15,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:15,802 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249531452] [2021-06-11 06:02:15,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:15,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:15,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:15,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249531452] [2021-06-11 06:02:15,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:15,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:02:15,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180037435] [2021-06-11 06:02:15,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:02:15,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:15,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:02:15,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:02:15,830 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 219 [2021-06-11 06:02:15,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,831 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:15,831 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 219 [2021-06-11 06:02:15,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:15,862 INFO L129 PetriNetUnfolder]: 125/310 cut-off events. [2021-06-11 06:02:15,863 INFO L130 PetriNetUnfolder]: For 230/267 co-relation queries the response was YES. [2021-06-11 06:02:15,863 INFO L84 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 310 events. 125/310 cut-off events. For 230/267 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1608 event pairs, 41 based on Foata normal form. 6/307 useless extension candidates. Maximal degree in co-relation 755. Up to 188 conditions per place. [2021-06-11 06:02:15,865 INFO L132 encePairwiseOnDemand]: 216/219 looper letters, 1 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2021-06-11 06:02:15,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 38 transitions, 176 flow [2021-06-11 06:02:15,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:02:15,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:02:15,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 574 transitions. [2021-06-11 06:02:15,866 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8736681887366818 [2021-06-11 06:02:15,866 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 574 transitions. [2021-06-11 06:02:15,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 574 transitions. [2021-06-11 06:02:15,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:15,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 574 transitions. [2021-06-11 06:02:15,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.33333333333334) internal successors, (574), 3 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,869 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,869 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 166 flow. Second operand 3 states and 574 transitions. [2021-06-11 06:02:15,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 38 transitions, 176 flow [2021-06-11 06:02:15,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 38 transitions, 173 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 06:02:15,871 INFO L241 Difference]: Finished difference. Result has 46 places, 38 transitions, 177 flow [2021-06-11 06:02:15,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=177, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2021-06-11 06:02:15,871 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2021-06-11 06:02:15,871 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:15,871 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 177 flow [2021-06-11 06:02:15,871 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 177 flow [2021-06-11 06:02:15,872 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 177 flow [2021-06-11 06:02:15,895 INFO L129 PetriNetUnfolder]: 125/300 cut-off events. [2021-06-11 06:02:15,895 INFO L130 PetriNetUnfolder]: For 147/153 co-relation queries the response was YES. [2021-06-11 06:02:15,896 INFO L84 FinitePrefix]: Finished finitePrefix Result has 782 conditions, 300 events. 125/300 cut-off events. For 147/153 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1535 event pairs, 51 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 768. Up to 188 conditions per place. [2021-06-11 06:02:15,898 INFO L151 LiptonReduction]: Number of co-enabled transitions 512 [2021-06-11 06:02:15,958 INFO L163 LiptonReduction]: Checked pairs total: 340 [2021-06-11 06:02:15,958 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:15,958 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 87 [2021-06-11 06:02:15,959 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 177 flow [2021-06-11 06:02:15,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:15,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:15,959 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:15,959 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:02:15,960 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:15,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:15,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1763685442, now seen corresponding path program 1 times [2021-06-11 06:02:15,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:15,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294049884] [2021-06-11 06:02:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:16,018 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 06:02:16,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:02:16,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:16,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:16,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:16,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:16,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:16,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294049884] [2021-06-11 06:02:16,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:16,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:02:16,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262747272] [2021-06-11 06:02:16,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:02:16,025 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:16,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:02:16,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:02:16,025 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 219 [2021-06-11 06:02:16,026 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:16,026 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:16,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 219 [2021-06-11 06:02:16,026 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:16,194 INFO L129 PetriNetUnfolder]: 1049/2056 cut-off events. [2021-06-11 06:02:16,194 INFO L130 PetriNetUnfolder]: For 343/367 co-relation queries the response was YES. [2021-06-11 06:02:16,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4455 conditions, 2056 events. 1049/2056 cut-off events. For 343/367 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 15878 event pairs, 344 based on Foata normal form. 134/1784 useless extension candidates. Maximal degree in co-relation 4439. Up to 926 conditions per place. [2021-06-11 06:02:16,210 INFO L132 encePairwiseOnDemand]: 211/219 looper letters, 10 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2021-06-11 06:02:16,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 249 flow [2021-06-11 06:02:16,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:02:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:02:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 904 transitions. [2021-06-11 06:02:16,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8255707762557077 [2021-06-11 06:02:16,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 904 transitions. [2021-06-11 06:02:16,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 904 transitions. [2021-06-11 06:02:16,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:16,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 904 transitions. [2021-06-11 06:02:16,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:16,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:16,216 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:16,216 INFO L185 Difference]: Start difference. First operand has 46 places, 38 transitions, 177 flow. Second operand 5 states and 904 transitions. [2021-06-11 06:02:16,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 249 flow [2021-06-11 06:02:16,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:02:16,220 INFO L241 Difference]: Finished difference. Result has 51 places, 48 transitions, 253 flow [2021-06-11 06:02:16,220 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2021-06-11 06:02:16,220 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2021-06-11 06:02:16,220 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:16,220 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 48 transitions, 253 flow [2021-06-11 06:02:16,221 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 48 transitions, 253 flow [2021-06-11 06:02:16,221 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 48 transitions, 253 flow [2021-06-11 06:02:16,383 INFO L129 PetriNetUnfolder]: 1037/2037 cut-off events. [2021-06-11 06:02:16,383 INFO L130 PetriNetUnfolder]: For 1605/2093 co-relation queries the response was YES. [2021-06-11 06:02:16,392 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5850 conditions, 2037 events. 1037/2037 cut-off events. For 1605/2093 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 15815 event pairs, 362 based on Foata normal form. 18/1795 useless extension candidates. Maximal degree in co-relation 5833. Up to 1383 conditions per place. [2021-06-11 06:02:16,408 INFO L151 LiptonReduction]: Number of co-enabled transitions 814 [2021-06-11 06:02:16,506 INFO L163 LiptonReduction]: Checked pairs total: 378 [2021-06-11 06:02:16,506 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:16,506 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 286 [2021-06-11 06:02:16,508 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 253 flow [2021-06-11 06:02:16,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 176.75) internal successors, (707), 4 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:16,509 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:16,509 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:16,509 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:02:16,509 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:16,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:16,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1677231371, now seen corresponding path program 1 times [2021-06-11 06:02:16,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:16,510 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838543107] [2021-06-11 06:02:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:16,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:16,671 INFO L142 QuantifierPusher]: treesize reduction 6, result has 68.4 percent of original size [2021-06-11 06:02:16,672 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:02:16,678 INFO L142 QuantifierPusher]: treesize reduction 6, result has 72.7 percent of original size [2021-06-11 06:02:16,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 06:02:16,692 INFO L142 QuantifierPusher]: treesize reduction 29, result has 68.1 percent of original size [2021-06-11 06:02:16,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 62 [2021-06-11 06:02:16,719 INFO L142 QuantifierPusher]: treesize reduction 8, result has 63.6 percent of original size [2021-06-11 06:02:16,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:16,730 INFO L142 QuantifierPusher]: treesize reduction 15, result has 50.0 percent of original size [2021-06-11 06:02:16,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 06:02:16,743 INFO L142 QuantifierPusher]: treesize reduction 8, result has 63.6 percent of original size [2021-06-11 06:02:16,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:02:16,755 INFO L142 QuantifierPusher]: treesize reduction 8, result has 57.9 percent of original size [2021-06-11 06:02:16,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 06:02:16,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:16,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838543107] [2021-06-11 06:02:16,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:16,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 06:02:16,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491241881] [2021-06-11 06:02:16,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 06:02:16,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:16,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 06:02:16,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-11 06:02:16,770 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 219 [2021-06-11 06:02:16,771 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 253 flow. Second operand has 9 states, 9 states have (on average 141.88888888888889) internal successors, (1277), 9 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:16,771 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:16,771 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 219 [2021-06-11 06:02:16,771 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:17,975 INFO L129 PetriNetUnfolder]: 4992/8238 cut-off events. [2021-06-11 06:02:17,975 INFO L130 PetriNetUnfolder]: For 10791/12318 co-relation queries the response was YES. [2021-06-11 06:02:18,002 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29397 conditions, 8238 events. 4992/8238 cut-off events. For 10791/12318 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 62307 event pairs, 546 based on Foata normal form. 433/8247 useless extension candidates. Maximal degree in co-relation 29378. Up to 4040 conditions per place. [2021-06-11 06:02:18,028 INFO L132 encePairwiseOnDemand]: 206/219 looper letters, 45 selfloop transitions, 96 changer transitions 27/190 dead transitions. [2021-06-11 06:02:18,028 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 190 transitions, 1377 flow [2021-06-11 06:02:18,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-06-11 06:02:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2021-06-11 06:02:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2369 transitions. [2021-06-11 06:02:18,032 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6760844748858448 [2021-06-11 06:02:18,032 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2369 transitions. [2021-06-11 06:02:18,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2369 transitions. [2021-06-11 06:02:18,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:18,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2369 transitions. [2021-06-11 06:02:18,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 148.0625) internal successors, (2369), 16 states have internal predecessors, (2369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:18,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 219.0) internal successors, (3723), 17 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:18,040 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 219.0) internal successors, (3723), 17 states have internal predecessors, (3723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:18,040 INFO L185 Difference]: Start difference. First operand has 51 places, 48 transitions, 253 flow. Second operand 16 states and 2369 transitions. [2021-06-11 06:02:18,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 190 transitions, 1377 flow [2021-06-11 06:02:18,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 190 transitions, 1377 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 06:02:18,124 INFO L241 Difference]: Finished difference. Result has 76 places, 143 transitions, 1189 flow [2021-06-11 06:02:18,124 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1189, PETRI_PLACES=76, PETRI_TRANSITIONS=143} [2021-06-11 06:02:18,124 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2021-06-11 06:02:18,124 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:18,125 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 143 transitions, 1189 flow [2021-06-11 06:02:18,125 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 143 transitions, 1189 flow [2021-06-11 06:02:18,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 143 transitions, 1189 flow [2021-06-11 06:02:18,609 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][24], [P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, 67#P0EXITtrue, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), 9#P1EXITtrue, Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 180#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 28#L804true, Black: 159#(= ~__unbuffered_p3_EAX~0 0), 162#true, Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 52#L887true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:18,609 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:18,609 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:18,609 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:18,609 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:18,610 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][24], [P1Thread1of1ForFork1InUse, P3Thread1of1ForFork3InUse, 67#P0EXITtrue, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), 9#P1EXITtrue, Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 180#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 162#true, Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 120#L2true, 56#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:18,610 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:18,610 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:18,610 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:18,610 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:18,616 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][24], [P1Thread1of1ForFork1InUse, 67#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), 9#P1EXITtrue, Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 180#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 162#true, Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 52#L887true, 56#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:18,617 INFO L384 tUnfolder$Statistics]: this new event has 25 ancestors and is cut-off event [2021-06-11 06:02:18,617 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 06:02:18,617 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 06:02:18,617 INFO L387 tUnfolder$Statistics]: existing Event has 25 ancestors and is cut-off event [2021-06-11 06:02:18,619 INFO L129 PetriNetUnfolder]: 3010/5569 cut-off events. [2021-06-11 06:02:18,619 INFO L130 PetriNetUnfolder]: For 15996/19253 co-relation queries the response was YES. [2021-06-11 06:02:18,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24412 conditions, 5569 events. 3010/5569 cut-off events. For 15996/19253 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 46952 event pairs, 465 based on Foata normal form. 91/5229 useless extension candidates. Maximal degree in co-relation 24383. Up to 2900 conditions per place. [2021-06-11 06:02:18,694 INFO L151 LiptonReduction]: Number of co-enabled transitions 2000 [2021-06-11 06:02:18,954 INFO L163 LiptonReduction]: Checked pairs total: 642 [2021-06-11 06:02:18,954 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:18,954 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 830 [2021-06-11 06:02:18,954 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 143 transitions, 1189 flow [2021-06-11 06:02:18,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 141.88888888888889) internal successors, (1277), 9 states have internal predecessors, (1277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:18,955 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:18,955 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:18,955 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:02:18,955 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:18,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:18,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1431084097, now seen corresponding path program 2 times [2021-06-11 06:02:18,955 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:18,956 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060383571] [2021-06-11 06:02:18,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:19,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:19,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:19,009 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 06:02:19,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:02:19,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:19,012 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:19,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:19,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:19,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060383571] [2021-06-11 06:02:19,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:19,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:02:19,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901757171] [2021-06-11 06:02:19,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:02:19,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:19,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:02:19,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:02:19,016 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 219 [2021-06-11 06:02:19,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 143 transitions, 1189 flow. Second operand has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:19,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:19,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 219 [2021-06-11 06:02:19,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:19,569 INFO L129 PetriNetUnfolder]: 2544/4924 cut-off events. [2021-06-11 06:02:19,569 INFO L130 PetriNetUnfolder]: For 17982/23465 co-relation queries the response was YES. [2021-06-11 06:02:19,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 24240 conditions, 4924 events. 2544/4924 cut-off events. For 17982/23465 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 42126 event pairs, 182 based on Foata normal form. 785/5402 useless extension candidates. Maximal degree in co-relation 24209. Up to 2343 conditions per place. [2021-06-11 06:02:19,605 INFO L132 encePairwiseOnDemand]: 211/219 looper letters, 10 selfloop transitions, 84 changer transitions 0/160 dead transitions. [2021-06-11 06:02:19,606 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 160 transitions, 1538 flow [2021-06-11 06:02:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:02:19,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:02:19,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1266 transitions. [2021-06-11 06:02:19,608 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8258317025440313 [2021-06-11 06:02:19,608 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1266 transitions. [2021-06-11 06:02:19,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1266 transitions. [2021-06-11 06:02:19,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:19,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1266 transitions. [2021-06-11 06:02:19,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:19,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:19,612 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:19,612 INFO L185 Difference]: Start difference. First operand has 76 places, 143 transitions, 1189 flow. Second operand 7 states and 1266 transitions. [2021-06-11 06:02:19,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 160 transitions, 1538 flow [2021-06-11 06:02:19,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 160 transitions, 1497 flow, removed 14 selfloop flow, removed 1 redundant places. [2021-06-11 06:02:19,747 INFO L241 Difference]: Finished difference. Result has 84 places, 156 transitions, 1547 flow [2021-06-11 06:02:19,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1547, PETRI_PLACES=84, PETRI_TRANSITIONS=156} [2021-06-11 06:02:19,747 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2021-06-11 06:02:19,747 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:19,747 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 156 transitions, 1547 flow [2021-06-11 06:02:19,747 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 156 transitions, 1547 flow [2021-06-11 06:02:19,748 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 156 transitions, 1547 flow [2021-06-11 06:02:20,232 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][113], [P1Thread1of1ForFork1InUse, 67#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), 9#P1EXITtrue, Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 172#true, 108#P3EXITtrue, 56#P2EXITtrue, 120#L2true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:20,233 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:20,233 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:20,233 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:20,233 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:20,240 INFO L129 PetriNetUnfolder]: 2586/5045 cut-off events. [2021-06-11 06:02:20,241 INFO L130 PetriNetUnfolder]: For 28864/32731 co-relation queries the response was YES. [2021-06-11 06:02:20,265 INFO L84 FinitePrefix]: Finished finitePrefix Result has 26531 conditions, 5045 events. 2586/5045 cut-off events. For 28864/32731 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 43980 event pairs, 259 based on Foata normal form. 155/4874 useless extension candidates. Maximal degree in co-relation 26498. Up to 2342 conditions per place. [2021-06-11 06:02:20,309 INFO L151 LiptonReduction]: Number of co-enabled transitions 2286 [2021-06-11 06:02:20,547 INFO L163 LiptonReduction]: Checked pairs total: 696 [2021-06-11 06:02:20,547 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:20,547 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 800 [2021-06-11 06:02:20,547 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 156 transitions, 1547 flow [2021-06-11 06:02:20,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.8) internal successors, (884), 5 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:20,548 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:20,548 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:20,548 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:02:20,548 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:20,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1854789320, now seen corresponding path program 1 times [2021-06-11 06:02:20,548 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:20,549 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611390254] [2021-06-11 06:02:20,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:20,604 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:20,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:20,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:20,605 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:20,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:20,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:20,610 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 06:02:20,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 06:02:20,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:20,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611390254] [2021-06-11 06:02:20,620 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:20,620 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:02:20,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397890646] [2021-06-11 06:02:20,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:02:20,621 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:20,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:02:20,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:02:20,622 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 219 [2021-06-11 06:02:20,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 156 transitions, 1547 flow. Second operand has 5 states, 5 states have (on average 173.6) internal successors, (868), 5 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:20,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:20,623 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 219 [2021-06-11 06:02:20,623 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:21,492 INFO L129 PetriNetUnfolder]: 4221/8224 cut-off events. [2021-06-11 06:02:21,492 INFO L130 PetriNetUnfolder]: For 49941/64090 co-relation queries the response was YES. [2021-06-11 06:02:21,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45179 conditions, 8224 events. 4221/8224 cut-off events. For 49941/64090 co-relation queries the response was YES. Maximal size of possible extension queue 926. Compared 77001 event pairs, 235 based on Foata normal form. 573/8302 useless extension candidates. Maximal degree in co-relation 45144. Up to 3839 conditions per place. [2021-06-11 06:02:21,545 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 56 selfloop transitions, 11 changer transitions 27/199 dead transitions. [2021-06-11 06:02:21,545 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 199 transitions, 2032 flow [2021-06-11 06:02:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:02:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:02:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 885 transitions. [2021-06-11 06:02:21,547 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8082191780821918 [2021-06-11 06:02:21,547 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 885 transitions. [2021-06-11 06:02:21,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 885 transitions. [2021-06-11 06:02:21,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:21,548 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 885 transitions. [2021-06-11 06:02:21,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:21,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:21,550 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:21,551 INFO L185 Difference]: Start difference. First operand has 84 places, 156 transitions, 1547 flow. Second operand 5 states and 885 transitions. [2021-06-11 06:02:21,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 199 transitions, 2032 flow [2021-06-11 06:02:22,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 199 transitions, 1927 flow, removed 21 selfloop flow, removed 2 redundant places. [2021-06-11 06:02:22,900 INFO L241 Difference]: Finished difference. Result has 89 places, 155 transitions, 1453 flow [2021-06-11 06:02:22,900 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=1442, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1453, PETRI_PLACES=89, PETRI_TRANSITIONS=155} [2021-06-11 06:02:22,901 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 45 predicate places. [2021-06-11 06:02:22,901 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:22,901 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 155 transitions, 1453 flow [2021-06-11 06:02:22,901 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 155 transitions, 1453 flow [2021-06-11 06:02:22,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 155 transitions, 1453 flow [2021-06-11 06:02:23,605 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][114], [P1Thread1of1ForFork1InUse, 67#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), 9#P1EXITtrue, Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 225#(= ~y~0 1), 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 56#P2EXITtrue, 120#L2true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:23,605 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,605 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,605 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,605 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,605 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][114], [P1Thread1of1ForFork1InUse, 67#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), 9#P1EXITtrue, Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 223#true, Black: 159#(= ~__unbuffered_p3_EAX~0 0), 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 56#P2EXITtrue, 120#L2true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:23,605 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,605 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,605 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,605 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,606 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][114], [P1Thread1of1ForFork1InUse, 67#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), 9#P1EXITtrue, Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 172#true, 108#P3EXITtrue, 56#P2EXITtrue, 120#L2true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:23,606 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,606 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,606 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,606 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,609 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][114], [P1Thread1of1ForFork1InUse, 67#P0EXITtrue, P3Thread1of1ForFork3InUse, 133#true, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), 9#P1EXITtrue, Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 225#(= ~y~0 1), 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 56#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:23,609 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,609 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,609 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,609 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,611 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][114], [P1Thread1of1ForFork1InUse, 67#P0EXITtrue, P3Thread1of1ForFork3InUse, 133#true, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), 9#P1EXITtrue, Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 223#true, Black: 159#(= ~__unbuffered_p3_EAX~0 0), 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 56#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:23,612 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,612 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,612 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,612 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,612 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][114], [P1Thread1of1ForFork1InUse, 67#P0EXITtrue, P3Thread1of1ForFork3InUse, 133#true, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), 9#P1EXITtrue, Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 159#(= ~__unbuffered_p3_EAX~0 0), 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 56#P2EXITtrue, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:23,612 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,612 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,612 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,612 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 06:02:23,622 INFO L129 PetriNetUnfolder]: 4168/8154 cut-off events. [2021-06-11 06:02:23,622 INFO L130 PetriNetUnfolder]: For 39738/43983 co-relation queries the response was YES. [2021-06-11 06:02:23,654 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41644 conditions, 8154 events. 4168/8154 cut-off events. For 39738/43983 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 77096 event pairs, 601 based on Foata normal form. 186/7819 useless extension candidates. Maximal degree in co-relation 41608. Up to 3809 conditions per place. [2021-06-11 06:02:23,708 INFO L151 LiptonReduction]: Number of co-enabled transitions 2460 [2021-06-11 06:02:24,673 INFO L163 LiptonReduction]: Checked pairs total: 817 [2021-06-11 06:02:24,673 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:24,673 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1772 [2021-06-11 06:02:24,674 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 155 transitions, 1453 flow [2021-06-11 06:02:24,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 173.6) internal successors, (868), 5 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:24,674 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:24,674 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:24,674 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 06:02:24,675 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1467516532, now seen corresponding path program 2 times [2021-06-11 06:02:24,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:24,675 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318644627] [2021-06-11 06:02:24,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:24,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:24,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:24,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:24,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:24,748 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 06:02:24,749 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:02:24,753 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:24,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:24,757 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:24,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:24,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:24,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318644627] [2021-06-11 06:02:24,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:24,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:02:24,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099303025] [2021-06-11 06:02:24,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:02:24,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:24,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:02:24,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:02:24,760 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 219 [2021-06-11 06:02:24,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 155 transitions, 1453 flow. Second operand has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:24,761 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:24,761 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 219 [2021-06-11 06:02:24,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:25,781 INFO L129 PetriNetUnfolder]: 3930/7798 cut-off events. [2021-06-11 06:02:25,781 INFO L130 PetriNetUnfolder]: For 48083/58262 co-relation queries the response was YES. [2021-06-11 06:02:25,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44077 conditions, 7798 events. 3930/7798 cut-off events. For 48083/58262 co-relation queries the response was YES. Maximal size of possible extension queue 903. Compared 73697 event pairs, 144 based on Foata normal form. 1450/8805 useless extension candidates. Maximal degree in co-relation 44039. Up to 3470 conditions per place. [2021-06-11 06:02:25,827 INFO L132 encePairwiseOnDemand]: 211/219 looper letters, 6 selfloop transitions, 98 changer transitions 6/173 dead transitions. [2021-06-11 06:02:25,827 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 173 transitions, 1911 flow [2021-06-11 06:02:25,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 06:02:25,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 06:02:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1628 transitions. [2021-06-11 06:02:25,830 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8259766615930999 [2021-06-11 06:02:25,831 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1628 transitions. [2021-06-11 06:02:25,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1628 transitions. [2021-06-11 06:02:25,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:25,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1628 transitions. [2021-06-11 06:02:25,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 180.88888888888889) internal successors, (1628), 9 states have internal predecessors, (1628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:25,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:25,836 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:25,836 INFO L185 Difference]: Start difference. First operand has 89 places, 155 transitions, 1453 flow. Second operand 9 states and 1628 transitions. [2021-06-11 06:02:25,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 173 transitions, 1911 flow [2021-06-11 06:02:26,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 173 transitions, 1869 flow, removed 21 selfloop flow, removed 0 redundant places. [2021-06-11 06:02:26,978 INFO L241 Difference]: Finished difference. Result has 100 places, 167 transitions, 1843 flow [2021-06-11 06:02:26,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1843, PETRI_PLACES=100, PETRI_TRANSITIONS=167} [2021-06-11 06:02:26,978 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2021-06-11 06:02:26,978 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:26,978 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 167 transitions, 1843 flow [2021-06-11 06:02:26,979 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 167 transitions, 1843 flow [2021-06-11 06:02:26,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 167 transitions, 1843 flow [2021-06-11 06:02:27,764 INFO L129 PetriNetUnfolder]: 3736/7539 cut-off events. [2021-06-11 06:02:27,764 INFO L130 PetriNetUnfolder]: For 53976/60035 co-relation queries the response was YES. [2021-06-11 06:02:27,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42081 conditions, 7539 events. 3736/7539 cut-off events. For 53976/60035 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 73136 event pairs, 242 based on Foata normal form. 189/7258 useless extension candidates. Maximal degree in co-relation 42040. Up to 3216 conditions per place. [2021-06-11 06:02:27,882 INFO L151 LiptonReduction]: Number of co-enabled transitions 2660 [2021-06-11 06:02:28,012 INFO L163 LiptonReduction]: Checked pairs total: 865 [2021-06-11 06:02:28,012 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:28,012 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1034 [2021-06-11 06:02:28,029 INFO L480 AbstractCegarLoop]: Abstraction has has 100 places, 167 transitions, 1843 flow [2021-06-11 06:02:28,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 176.83333333333334) internal successors, (1061), 6 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:28,030 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:28,030 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:28,030 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 06:02:28,030 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash -645443363, now seen corresponding path program 1 times [2021-06-11 06:02:28,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:28,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525939665] [2021-06-11 06:02:28,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:28,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:28,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:28,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:28,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:28,167 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 06:02:28,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 06:02:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:28,177 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525939665] [2021-06-11 06:02:28,177 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:28,177 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:02:28,177 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484108067] [2021-06-11 06:02:28,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:02:28,177 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:28,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:02:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:02:28,178 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 219 [2021-06-11 06:02:28,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 167 transitions, 1843 flow. Second operand has 4 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:28,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:28,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 219 [2021-06-11 06:02:28,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:29,939 INFO L129 PetriNetUnfolder]: 6190/12296 cut-off events. [2021-06-11 06:02:29,939 INFO L130 PetriNetUnfolder]: For 86426/97752 co-relation queries the response was YES. [2021-06-11 06:02:30,010 INFO L84 FinitePrefix]: Finished finitePrefix Result has 72146 conditions, 12296 events. 6190/12296 cut-off events. For 86426/97752 co-relation queries the response was YES. Maximal size of possible extension queue 1371. Compared 123744 event pairs, 106 based on Foata normal form. 631/12272 useless extension candidates. Maximal degree in co-relation 72103. Up to 5348 conditions per place. [2021-06-11 06:02:30,072 INFO L132 encePairwiseOnDemand]: 209/219 looper letters, 52 selfloop transitions, 54 changer transitions 0/224 dead transitions. [2021-06-11 06:02:30,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 224 transitions, 2531 flow [2021-06-11 06:02:30,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:02:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:02:30,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 877 transitions. [2021-06-11 06:02:30,092 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8009132420091324 [2021-06-11 06:02:30,092 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 877 transitions. [2021-06-11 06:02:30,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 877 transitions. [2021-06-11 06:02:30,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:30,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 877 transitions. [2021-06-11 06:02:30,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.4) internal successors, (877), 5 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:30,095 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:30,096 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:30,096 INFO L185 Difference]: Start difference. First operand has 100 places, 167 transitions, 1843 flow. Second operand 5 states and 877 transitions. [2021-06-11 06:02:30,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 224 transitions, 2531 flow [2021-06-11 06:02:34,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 224 transitions, 2356 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-06-11 06:02:34,505 INFO L241 Difference]: Finished difference. Result has 103 places, 201 transitions, 2197 flow [2021-06-11 06:02:34,505 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2197, PETRI_PLACES=103, PETRI_TRANSITIONS=201} [2021-06-11 06:02:34,506 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 59 predicate places. [2021-06-11 06:02:34,506 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:34,506 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 201 transitions, 2197 flow [2021-06-11 06:02:34,506 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 201 transitions, 2197 flow [2021-06-11 06:02:34,507 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 201 transitions, 2197 flow [2021-06-11 06:02:35,396 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][121], [Black: 252#(= ~a~0 1), P1Thread1of1ForFork1InUse, Black: 253#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), P3Thread1of1ForFork3InUse, 67#P0EXITtrue, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), 9#P1EXITtrue, Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 149#true, Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 223#true, Black: 159#(= ~__unbuffered_p3_EAX~0 0), 34#L785true, Black: 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), 234#true, Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 55#L876-1true, Black: 245#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 238#(not (= 4 ~__unbuffered_cnt~0)), Black: 239#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), P0Thread1of1ForFork0InUse, 255#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:35,396 INFO L384 tUnfolder$Statistics]: this new event has 20 ancestors and is not cut-off event [2021-06-11 06:02:35,396 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 06:02:35,397 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 06:02:35,397 INFO L387 tUnfolder$Statistics]: existing Event has 20 ancestors and is not cut-off event [2021-06-11 06:02:35,661 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][100], [Black: 252#(= ~a~0 1), P1Thread1of1ForFork1InUse, Black: 253#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), P3Thread1of1ForFork3InUse, 67#P0EXITtrue, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), 9#P1EXITtrue, Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 149#true, Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 223#true, Black: 159#(= ~__unbuffered_p3_EAX~0 0), 34#L785true, Black: 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 239#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 245#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 238#(not (= 4 ~__unbuffered_cnt~0)), 120#L2true, P0Thread1of1ForFork0InUse, 255#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:35,662 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 06:02:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 06:02:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 06:02:35,662 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 06:02:35,663 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][121], [Black: 252#(= ~a~0 1), P1Thread1of1ForFork1InUse, Black: 253#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), P3Thread1of1ForFork3InUse, 67#P0EXITtrue, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), 9#P1EXITtrue, Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), 17#L788true, Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 223#true, Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), 234#true, Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 55#L876-1true, Black: 245#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 238#(not (= 4 ~__unbuffered_cnt~0)), Black: 239#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), P0Thread1of1ForFork0InUse, 255#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:35,663 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is not cut-off event [2021-06-11 06:02:35,663 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 06:02:35,663 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 06:02:35,663 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is not cut-off event [2021-06-11 06:02:35,771 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1212] L852-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#res.base_15| 0) (= v_~__unbuffered_cnt~0_143 (+ v_~__unbuffered_cnt~0_144 1)) (= |v_P3Thread1of1ForFork3_#res.offset_15| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_144} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_143, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_15|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][100], [Black: 252#(= ~a~0 1), P1Thread1of1ForFork1InUse, Black: 253#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), P3Thread1of1ForFork3InUse, 67#P0EXITtrue, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), 9#P1EXITtrue, Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), 17#L788true, Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), 149#true, Black: 151#(<= ~__unbuffered_p2_EAX~0 0), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 223#true, Black: 159#(= ~__unbuffered_p3_EAX~0 0), Black: 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 108#P3EXITtrue, 172#true, 239#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 245#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 238#(not (= 4 ~__unbuffered_cnt~0)), 120#L2true, P0Thread1of1ForFork0InUse, 255#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:35,771 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is not cut-off event [2021-06-11 06:02:35,771 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 06:02:35,771 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 06:02:35,771 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is not cut-off event [2021-06-11 06:02:35,853 INFO L129 PetriNetUnfolder]: 6275/12700 cut-off events. [2021-06-11 06:02:35,853 INFO L130 PetriNetUnfolder]: For 75126/82662 co-relation queries the response was YES. [2021-06-11 06:02:35,916 INFO L84 FinitePrefix]: Finished finitePrefix Result has 69843 conditions, 12700 events. 6275/12700 cut-off events. For 75126/82662 co-relation queries the response was YES. Maximal size of possible extension queue 1493. Compared 131466 event pairs, 277 based on Foata normal form. 313/12276 useless extension candidates. Maximal degree in co-relation 69799. Up to 5424 conditions per place. [2021-06-11 06:02:36,015 INFO L151 LiptonReduction]: Number of co-enabled transitions 3958 [2021-06-11 06:02:39,003 INFO L163 LiptonReduction]: Checked pairs total: 868 [2021-06-11 06:02:39,003 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:39,004 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4498 [2021-06-11 06:02:39,004 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 201 transitions, 2197 flow [2021-06-11 06:02:39,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:39,004 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:39,004 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:39,004 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 06:02:39,004 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1674748642, now seen corresponding path program 1 times [2021-06-11 06:02:39,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:39,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139983937] [2021-06-11 06:02:39,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:39,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:39,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:39,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:39,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:39,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:39,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:39,176 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 06:02:39,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:02:39,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:39,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:39,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:39,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:39,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:39,186 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139983937] [2021-06-11 06:02:39,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:39,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 06:02:39,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382771948] [2021-06-11 06:02:39,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 06:02:39,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:39,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 06:02:39,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 06:02:39,188 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 219 [2021-06-11 06:02:39,189 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 201 transitions, 2197 flow. Second operand has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:39,189 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:39,189 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 219 [2021-06-11 06:02:39,189 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:41,025 INFO L129 PetriNetUnfolder]: 5915/11961 cut-off events. [2021-06-11 06:02:41,025 INFO L130 PetriNetUnfolder]: For 85996/99130 co-relation queries the response was YES. [2021-06-11 06:02:41,082 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73170 conditions, 11961 events. 5915/11961 cut-off events. For 85996/99130 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 122605 event pairs, 91 based on Foata normal form. 2248/13550 useless extension candidates. Maximal degree in co-relation 73124. Up to 4988 conditions per place. [2021-06-11 06:02:41,103 INFO L132 encePairwiseOnDemand]: 211/219 looper letters, 2 selfloop transitions, 101 changer transitions 19/211 dead transitions. [2021-06-11 06:02:41,103 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 211 transitions, 2573 flow [2021-06-11 06:02:41,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 06:02:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 06:02:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1982 transitions. [2021-06-11 06:02:41,108 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8227480282274803 [2021-06-11 06:02:41,108 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1982 transitions. [2021-06-11 06:02:41,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1982 transitions. [2021-06-11 06:02:41,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:41,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1982 transitions. [2021-06-11 06:02:41,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 180.1818181818182) internal successors, (1982), 11 states have internal predecessors, (1982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:41,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:41,114 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 219.0) internal successors, (2628), 12 states have internal predecessors, (2628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:41,114 INFO L185 Difference]: Start difference. First operand has 103 places, 201 transitions, 2197 flow. Second operand 11 states and 1982 transitions. [2021-06-11 06:02:41,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 211 transitions, 2573 flow [2021-06-11 06:02:44,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 211 transitions, 2541 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 06:02:44,969 INFO L241 Difference]: Finished difference. Result has 114 places, 192 transitions, 2264 flow [2021-06-11 06:02:44,969 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=2165, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2264, PETRI_PLACES=114, PETRI_TRANSITIONS=192} [2021-06-11 06:02:44,969 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places. [2021-06-11 06:02:44,969 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:44,969 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 192 transitions, 2264 flow [2021-06-11 06:02:44,969 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 192 transitions, 2264 flow [2021-06-11 06:02:44,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 113 places, 192 transitions, 2264 flow [2021-06-11 06:02:46,130 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1195] L758-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_109 (+ v_~__unbuffered_cnt~0_110 1)) (= |v_P0Thread1of1ForFork0_#res.base_13| 0) (= 0 |v_P0Thread1of1ForFork0_#res.offset_13|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_13|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0][110], [P1Thread1of1ForFork1InUse, Black: 253#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), P3Thread1of1ForFork3InUse, Black: 255#(and (= ~a~0 1) (or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0)))), 67#P0EXITtrue, 260#true, Black: 192#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), 9#P1EXITtrue, Black: 177#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)), Black: 178#(or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))), Black: 194#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (or (not (= 4 ~__unbuffered_cnt~0)) (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)))), Black: 179#(or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), Black: 182#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1))) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 186#(and (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 188#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (<= ~__unbuffered_cnt~0 0)) (or (and (= ~z~0 ~__unbuffered_p3_EAX~0) (= ~z$w_buff0~0 1) (or (= ~__unbuffered_p3_EAX~0 0) (= ~z$w_buff0_used~0 0))) (and (<= ~z$w_buff1_used~0 0) (<= ~__unbuffered_cnt~0 0) (< 0 (+ ~z$w_buff1_used~0 1))))), Black: 190#(and (or (= ~__unbuffered_p2_EBX~0 1) (not (= ~__unbuffered_p3_EAX~0 1)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)) (<= ~z$w_buff1_used~0 0) (= ~z~0 0) (= ~z$w_buff0~0 0) (<= ~__unbuffered_cnt~0 0) (= ~z$w_buff0_used~0 0) (< 0 (+ ~z$w_buff1_used~0 1))), Black: 140#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 274#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 149#true, Black: 265#(not (= 4 ~__unbuffered_cnt~0)), Black: 266#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 213#(not (= 4 ~__unbuffered_cnt~0)), Black: 152#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 214#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 216#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 225#(= ~y~0 1), Black: 227#(or (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~__unbuffered_p2_EAX~0)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~y~0))), Black: 229#(and (= ~y~0 1) (= ~__unbuffered_p2_EAX~0 1)), Black: 164#(not (= 4 ~__unbuffered_cnt~0)), Black: 165#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), 234#true, Black: 167#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 172#true, 108#P3EXITtrue, 55#L876-1true, Black: 245#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0)), 56#P2EXITtrue, Black: 238#(not (= 4 ~__unbuffered_cnt~0)), Black: 239#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), 252#(= ~a~0 1), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2021-06-11 06:02:46,130 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 06:02:46,130 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 06:02:46,130 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 06:02:46,130 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 06:02:46,164 INFO L129 PetriNetUnfolder]: 5983/12190 cut-off events. [2021-06-11 06:02:46,165 INFO L130 PetriNetUnfolder]: For 92124/100098 co-relation queries the response was YES. [2021-06-11 06:02:46,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73428 conditions, 12190 events. 5983/12190 cut-off events. For 92124/100098 co-relation queries the response was YES. Maximal size of possible extension queue 1481. Compared 126782 event pairs, 256 based on Foata normal form. 379/11888 useless extension candidates. Maximal degree in co-relation 73381. Up to 5118 conditions per place. [2021-06-11 06:02:46,349 INFO L151 LiptonReduction]: Number of co-enabled transitions 3870 [2021-06-11 06:02:47,143 INFO L163 LiptonReduction]: Checked pairs total: 840 [2021-06-11 06:02:47,144 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:47,144 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2175 [2021-06-11 06:02:47,144 INFO L480 AbstractCegarLoop]: Abstraction has has 113 places, 192 transitions, 2264 flow [2021-06-11 06:02:47,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 176.85714285714286) internal successors, (1238), 7 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:47,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:47,145 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:47,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 06:02:47,145 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:47,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:47,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1028660813, now seen corresponding path program 1 times [2021-06-11 06:02:47,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:47,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702345125] [2021-06-11 06:02:47,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:47,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:47,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:47,182 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:47,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:47,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:47,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:47,187 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-06-11 06:02:47,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 06:02:47,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-06-11 06:02:47,197 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702345125] [2021-06-11 06:02:47,197 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:47,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:02:47,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481205382] [2021-06-11 06:02:47,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:02:47,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:47,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:02:47,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:02:47,198 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 219 [2021-06-11 06:02:47,199 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 192 transitions, 2264 flow. Second operand has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:47,199 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:47,199 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 219 [2021-06-11 06:02:47,199 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:49,183 INFO L129 PetriNetUnfolder]: 7633/15429 cut-off events. [2021-06-11 06:02:49,184 INFO L130 PetriNetUnfolder]: For 123146/139469 co-relation queries the response was YES. [2021-06-11 06:02:49,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98656 conditions, 15429 events. 7633/15429 cut-off events. For 123146/139469 co-relation queries the response was YES. Maximal size of possible extension queue 1944. Compared 163912 event pairs, 124 based on Foata normal form. 1098/15712 useless extension candidates. Maximal degree in co-relation 98607. Up to 6905 conditions per place. [2021-06-11 06:02:49,303 INFO L132 encePairwiseOnDemand]: 209/219 looper letters, 37 selfloop transitions, 22 changer transitions 55/231 dead transitions. [2021-06-11 06:02:49,303 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 231 transitions, 2842 flow [2021-06-11 06:02:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:02:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:02:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1050 transitions. [2021-06-11 06:02:49,315 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7990867579908676 [2021-06-11 06:02:49,315 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1050 transitions. [2021-06-11 06:02:49,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1050 transitions. [2021-06-11 06:02:49,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:49,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1050 transitions. [2021-06-11 06:02:49,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.0) internal successors, (1050), 6 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:49,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:49,324 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:49,324 INFO L185 Difference]: Start difference. First operand has 113 places, 192 transitions, 2264 flow. Second operand 6 states and 1050 transitions. [2021-06-11 06:02:49,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 231 transitions, 2842 flow [2021-06-11 06:02:56,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 231 transitions, 2587 flow, removed 29 selfloop flow, removed 10 redundant places. [2021-06-11 06:02:56,988 INFO L241 Difference]: Finished difference. Result has 109 places, 164 transitions, 1710 flow [2021-06-11 06:02:56,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=2009, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1710, PETRI_PLACES=109, PETRI_TRANSITIONS=164} [2021-06-11 06:02:56,988 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 65 predicate places. [2021-06-11 06:02:56,988 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:02:56,988 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 164 transitions, 1710 flow [2021-06-11 06:02:56,988 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 164 transitions, 1710 flow [2021-06-11 06:02:56,989 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 164 transitions, 1710 flow [2021-06-11 06:02:57,643 INFO L129 PetriNetUnfolder]: 3549/7384 cut-off events. [2021-06-11 06:02:57,643 INFO L130 PetriNetUnfolder]: For 53406/61473 co-relation queries the response was YES. [2021-06-11 06:02:57,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41600 conditions, 7384 events. 3549/7384 cut-off events. For 53406/61473 co-relation queries the response was YES. Maximal size of possible extension queue 1043. Compared 73932 event pairs, 260 based on Foata normal form. 178/7012 useless extension candidates. Maximal degree in co-relation 41560. Up to 3250 conditions per place. [2021-06-11 06:02:57,749 INFO L151 LiptonReduction]: Number of co-enabled transitions 2878 [2021-06-11 06:02:57,982 INFO L163 LiptonReduction]: Checked pairs total: 545 [2021-06-11 06:02:57,982 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:02:57,982 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 994 [2021-06-11 06:02:57,982 INFO L480 AbstractCegarLoop]: Abstraction has has 108 places, 164 transitions, 1710 flow [2021-06-11 06:02:57,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:57,983 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:02:57,983 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:02:57,983 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 06:02:57,983 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:02:57,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:02:57,983 INFO L82 PathProgramCache]: Analyzing trace with hash -451393615, now seen corresponding path program 2 times [2021-06-11 06:02:57,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:02:57,983 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298868999] [2021-06-11 06:02:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:02:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:02:58,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:58,013 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:02:58,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:58,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:58,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:02:58,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:02:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:02:58,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298868999] [2021-06-11 06:02:58,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:02:58,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:02:58,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823547981] [2021-06-11 06:02:58,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:02:58,019 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:02:58,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:02:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:02:58,020 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 219 [2021-06-11 06:02:58,020 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 164 transitions, 1710 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:58,020 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:02:58,020 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 219 [2021-06-11 06:02:58,020 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:02:59,146 INFO L129 PetriNetUnfolder]: 5127/10975 cut-off events. [2021-06-11 06:02:59,146 INFO L130 PetriNetUnfolder]: For 67842/72509 co-relation queries the response was YES. [2021-06-11 06:02:59,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62528 conditions, 10975 events. 5127/10975 cut-off events. For 67842/72509 co-relation queries the response was YES. Maximal size of possible extension queue 1444. Compared 117287 event pairs, 258 based on Foata normal form. 175/10441 useless extension candidates. Maximal degree in co-relation 62486. Up to 4906 conditions per place. [2021-06-11 06:02:59,214 INFO L132 encePairwiseOnDemand]: 216/219 looper letters, 3 selfloop transitions, 1 changer transitions 83/166 dead transitions. [2021-06-11 06:02:59,214 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 166 transitions, 1747 flow [2021-06-11 06:02:59,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:02:59,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:02:59,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2021-06-11 06:02:59,216 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424657534246576 [2021-06-11 06:02:59,216 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2021-06-11 06:02:59,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2021-06-11 06:02:59,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:02:59,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2021-06-11 06:02:59,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:59,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:59,218 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:02:59,218 INFO L185 Difference]: Start difference. First operand has 108 places, 164 transitions, 1710 flow. Second operand 4 states and 738 transitions. [2021-06-11 06:02:59,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 166 transitions, 1747 flow [2021-06-11 06:03:02,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 166 transitions, 1629 flow, removed 14 selfloop flow, removed 8 redundant places. [2021-06-11 06:03:02,886 INFO L241 Difference]: Finished difference. Result has 105 places, 83 transitions, 778 flow [2021-06-11 06:03:02,886 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=778, PETRI_PLACES=105, PETRI_TRANSITIONS=83} [2021-06-11 06:03:02,887 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2021-06-11 06:03:02,887 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:02,887 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 83 transitions, 778 flow [2021-06-11 06:03:02,900 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 83 transitions, 778 flow [2021-06-11 06:03:02,901 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 93 places, 83 transitions, 778 flow [2021-06-11 06:03:02,968 INFO L129 PetriNetUnfolder]: 343/909 cut-off events. [2021-06-11 06:03:02,968 INFO L130 PetriNetUnfolder]: For 4739/4942 co-relation queries the response was YES. [2021-06-11 06:03:02,971 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5056 conditions, 909 events. 343/909 cut-off events. For 4739/4942 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 7084 event pairs, 13 based on Foata normal form. 24/900 useless extension candidates. Maximal degree in co-relation 5021. Up to 365 conditions per place. [2021-06-11 06:03:02,976 INFO L151 LiptonReduction]: Number of co-enabled transitions 510 [2021-06-11 06:03:02,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:02,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:03,017 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:03,018 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:03,037 INFO L163 LiptonReduction]: Checked pairs total: 84 [2021-06-11 06:03:03,037 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:03:03,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 150 [2021-06-11 06:03:03,038 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 81 transitions, 774 flow [2021-06-11 06:03:03,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:03,038 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:03,038 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:03,038 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 06:03:03,038 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:03,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:03,039 INFO L82 PathProgramCache]: Analyzing trace with hash -52999613, now seen corresponding path program 3 times [2021-06-11 06:03:03,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:03,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470287139] [2021-06-11 06:03:03,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:03:03,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:03,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:03:03,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:03,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 06:03:03,118 INFO L142 QuantifierPusher]: treesize reduction 160, result has 48.7 percent of original size [2021-06-11 06:03:03,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 152 [2021-06-11 06:03:03,190 INFO L142 QuantifierPusher]: treesize reduction 23, result has 75.3 percent of original size [2021-06-11 06:03:03,192 INFO L147 QuantifierPusher]: treesize reduction 9, result has 87.1 percent of original size 61 [2021-06-11 06:03:03,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:03,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:03:03,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:03:03,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470287139] [2021-06-11 06:03:03,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:03:03,229 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:03:03,229 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351657375] [2021-06-11 06:03:03,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 06:03:03,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:03:03,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 06:03:03,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 06:03:03,230 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 221 [2021-06-11 06:03:03,231 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 81 transitions, 774 flow. Second operand has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:03,231 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:03:03,231 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 221 [2021-06-11 06:03:03,231 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:03:03,435 INFO L129 PetriNetUnfolder]: 302/790 cut-off events. [2021-06-11 06:03:03,435 INFO L130 PetriNetUnfolder]: For 4583/4778 co-relation queries the response was YES. [2021-06-11 06:03:03,438 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4563 conditions, 790 events. 302/790 cut-off events. For 4583/4778 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5822 event pairs, 13 based on Foata normal form. 22/778 useless extension candidates. Maximal degree in co-relation 4526. Up to 338 conditions per place. [2021-06-11 06:03:03,439 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 3 selfloop transitions, 7 changer transitions 42/87 dead transitions. [2021-06-11 06:03:03,439 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 87 transitions, 863 flow [2021-06-11 06:03:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 06:03:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 06:03:03,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1299 transitions. [2021-06-11 06:03:03,443 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7347285067873304 [2021-06-11 06:03:03,443 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1299 transitions. [2021-06-11 06:03:03,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1299 transitions. [2021-06-11 06:03:03,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:03:03,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1299 transitions. [2021-06-11 06:03:03,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 162.375) internal successors, (1299), 8 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:03,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:03,447 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:03,448 INFO L185 Difference]: Start difference. First operand has 91 places, 81 transitions, 774 flow. Second operand 8 states and 1299 transitions. [2021-06-11 06:03:03,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 87 transitions, 863 flow [2021-06-11 06:03:03,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 757 flow, removed 19 selfloop flow, removed 18 redundant places. [2021-06-11 06:03:03,486 INFO L241 Difference]: Finished difference. Result has 83 places, 45 transitions, 318 flow [2021-06-11 06:03:03,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=318, PETRI_PLACES=83, PETRI_TRANSITIONS=45} [2021-06-11 06:03:03,486 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 39 predicate places. [2021-06-11 06:03:03,486 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:03:03,487 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 45 transitions, 318 flow [2021-06-11 06:03:03,487 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 45 transitions, 318 flow [2021-06-11 06:03:03,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 45 transitions, 318 flow [2021-06-11 06:03:03,497 INFO L129 PetriNetUnfolder]: 38/102 cut-off events. [2021-06-11 06:03:03,498 INFO L130 PetriNetUnfolder]: For 182/189 co-relation queries the response was YES. [2021-06-11 06:03:03,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 431 conditions, 102 events. 38/102 cut-off events. For 182/189 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 291 event pairs, 0 based on Foata normal form. 3/102 useless extension candidates. Maximal degree in co-relation 407. Up to 39 conditions per place. [2021-06-11 06:03:03,499 INFO L151 LiptonReduction]: Number of co-enabled transitions 70 [2021-06-11 06:03:03,942 WARN L205 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 164 [2021-06-11 06:03:04,068 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2021-06-11 06:03:05,081 WARN L205 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 333 DAG size of output: 231 [2021-06-11 06:03:05,380 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 203 [2021-06-11 06:03:05,398 INFO L142 QuantifierPusher]: treesize reduction 84, result has 90.8 percent of original size [2021-06-11 06:03:05,401 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 06:03:05,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:03:05,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,425 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 06:03:05,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:05,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,437 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 06:03:05,438 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:05,442 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,443 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 06:03:05,445 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,447 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 06:03:05,447 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 06:03:05,447 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,448 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,449 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 06:03:05,449 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,450 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,450 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 06:03:05,450 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,451 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,453 INFO L147 QuantifierPusher]: treesize reduction 155, result has 49.8 percent of original size 154 [2021-06-11 06:03:05,453 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:03:05,455 INFO L142 QuantifierPusher]: treesize reduction 155, result has 62.6 percent of original size [2021-06-11 06:03:05,456 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 4, 3, 2, 1] term [2021-06-11 06:03:05,456 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,457 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,458 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 06:03:05,458 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,459 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,459 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 06:03:05,459 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,460 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,462 INFO L147 QuantifierPusher]: treesize reduction 431, result has 27.6 percent of original size 164 [2021-06-11 06:03:05,463 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:05,463 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,464 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,465 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:05,465 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,465 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,466 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 06:03:05,466 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:03:05,467 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:03:05,475 INFO L147 QuantifierPusher]: treesize reduction 1707, result has 15.1 percent of original size 304 [2021-06-11 06:03:05,480 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 06:03:05,481 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 06:03:05,481 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1995 [2021-06-11 06:03:05,481 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 44 transitions, 314 flow [2021-06-11 06:03:05,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 162.0) internal successors, (1134), 7 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:03:05,481 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:03:05,481 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:03:05,482 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 06:03:05,482 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:03:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:03:05,482 INFO L82 PathProgramCache]: Analyzing trace with hash -966793222, now seen corresponding path program 1 times [2021-06-11 06:03:05,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:03:05,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665190044] [2021-06-11 06:03:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:03:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:03:05,539 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:03:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:03:05,573 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:03:05,610 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:03:05,610 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:03:05,610 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 06:03:05,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:03:05 BasicIcfg [2021-06-11 06:03:05,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:03:05,709 INFO L168 Benchmark]: Toolchain (without parser) took 58568.44 ms. Allocated memory was 381.7 MB in the beginning and 5.1 GB in the end (delta: 4.7 GB). Free memory was 344.3 MB in the beginning and 2.3 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.8 GB. Max. memory is 16.0 GB. [2021-06-11 06:03:05,709 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 381.7 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:03:05,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 440.07 ms. Allocated memory is still 381.7 MB. Free memory was 344.1 MB in the beginning and 339.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:05,709 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.16 ms. Allocated memory is still 381.7 MB. Free memory was 338.1 MB in the beginning and 334.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:05,709 INFO L168 Benchmark]: Boogie Preprocessor took 30.04 ms. Allocated memory is still 381.7 MB. Free memory was 334.9 MB in the beginning and 332.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:05,709 INFO L168 Benchmark]: RCFGBuilder took 1690.29 ms. Allocated memory is still 381.7 MB. Free memory was 332.9 MB in the beginning and 213.9 MB in the end (delta: 119.0 MB). Peak memory consumption was 135.8 MB. Max. memory is 16.0 GB. [2021-06-11 06:03:05,709 INFO L168 Benchmark]: TraceAbstraction took 56352.60 ms. Allocated memory was 381.7 MB in the beginning and 5.1 GB in the end (delta: 4.7 GB). Free memory was 213.9 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 16.0 GB. [2021-06-11 06:03:05,713 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.10 ms. Allocated memory is still 381.7 MB. Free memory is still 362.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 440.07 ms. Allocated memory is still 381.7 MB. Free memory was 344.1 MB in the beginning and 339.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 50.16 ms. Allocated memory is still 381.7 MB. Free memory was 338.1 MB in the beginning and 334.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.04 ms. Allocated memory is still 381.7 MB. Free memory was 334.9 MB in the beginning and 332.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1690.29 ms. Allocated memory is still 381.7 MB. Free memory was 332.9 MB in the beginning and 213.9 MB in the end (delta: 119.0 MB). Peak memory consumption was 135.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 56352.60 ms. Allocated memory was 381.7 MB in the beginning and 5.1 GB in the end (delta: 4.7 GB). Free memory was 213.9 MB in the beginning and 2.3 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5235.4ms, 124 PlacesBefore, 44 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2502 CoEnabledTransitionPairs, 8 FixpointIterations, 42 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 7336 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3196, positive: 2989, positive conditional: 0, positive unconditional: 2989, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1664, positive: 1614, positive conditional: 0, positive unconditional: 1614, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1664, positive: 1614, positive conditional: 0, positive unconditional: 1614, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1664, positive: 1586, positive conditional: 0, positive unconditional: 1586, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 494, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 432, negative conditional: 0, negative unconditional: 432, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3196, positive: 1375, positive conditional: 0, positive unconditional: 1375, negative: 157, negative conditional: 0, negative unconditional: 157, unknown: 1664, unknown conditional: 0, unknown unconditional: 1664] , Statistics on independence cache: Total cache size (in pairs): 2919, Positive cache size: 2869, Positive conditional cache size: 0, Positive unconditional cache size: 2869, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 189.4ms, 40 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 28 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 978 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 363, positive: 311, positive conditional: 0, positive unconditional: 311, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 56, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 56, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 68, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 363, positive: 263, positive conditional: 0, positive unconditional: 263, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 56, unknown conditional: 0, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 3016, Positive cache size: 2958, Positive conditional cache size: 0, Positive unconditional cache size: 2958, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 71.6ms, 45 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 452 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 242 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 3019, Positive cache size: 2961, Positive conditional cache size: 0, Positive unconditional cache size: 2961, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 38.5ms, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 514 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 343 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 139, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 139, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 3025, Positive cache size: 2967, Positive conditional cache size: 0, Positive unconditional cache size: 2967, Negative cache size: 58, Negative conditional cache size: 0, Negative unconditional cache size: 58 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.9ms, 46 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 340 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 120, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 54, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 120, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 3027, Positive cache size: 2967, Positive conditional cache size: 0, Positive unconditional cache size: 2967, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 285.7ms, 51 PlacesBefore, 51 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 814 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 378 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 114, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 114, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3027, Positive cache size: 2967, Positive conditional cache size: 0, Positive unconditional cache size: 2967, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 829.0ms, 76 PlacesBefore, 76 PlacesAfterwards, 143 TransitionsBefore, 143 TransitionsAfterwards, 2000 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 642 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 96, positive: 90, positive conditional: 0, positive unconditional: 90, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3027, Positive cache size: 2967, Positive conditional cache size: 0, Positive unconditional cache size: 2967, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 799.6ms, 84 PlacesBefore, 84 PlacesAfterwards, 156 TransitionsBefore, 156 TransitionsAfterwards, 2286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 696 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 252, positive: 246, positive conditional: 0, positive unconditional: 246, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 252, positive: 245, positive conditional: 0, positive unconditional: 245, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 3028, Positive cache size: 2968, Positive conditional cache size: 0, Positive unconditional cache size: 2968, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1772.3ms, 89 PlacesBefore, 89 PlacesAfterwards, 155 TransitionsBefore, 155 TransitionsAfterwards, 2460 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 817 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 268, positive: 261, positive conditional: 0, positive unconditional: 261, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 268, positive: 261, positive conditional: 0, positive unconditional: 261, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3028, Positive cache size: 2968, Positive conditional cache size: 0, Positive unconditional cache size: 2968, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1033.3ms, 100 PlacesBefore, 100 PlacesAfterwards, 167 TransitionsBefore, 167 TransitionsAfterwards, 2660 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 865 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 259, positive: 252, positive conditional: 0, positive unconditional: 252, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 259, positive: 252, positive conditional: 0, positive unconditional: 252, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3028, Positive cache size: 2968, Positive conditional cache size: 0, Positive unconditional cache size: 2968, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4497.5ms, 103 PlacesBefore, 103 PlacesAfterwards, 201 TransitionsBefore, 201 TransitionsAfterwards, 3958 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 868 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 357, positive: 350, positive conditional: 0, positive unconditional: 350, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 357, positive: 350, positive conditional: 0, positive unconditional: 350, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3028, Positive cache size: 2968, Positive conditional cache size: 0, Positive unconditional cache size: 2968, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2174.3ms, 114 PlacesBefore, 113 PlacesAfterwards, 192 TransitionsBefore, 192 TransitionsAfterwards, 3870 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 840 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 343, positive: 336, positive conditional: 0, positive unconditional: 336, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 343, positive: 336, positive conditional: 0, positive unconditional: 336, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3028, Positive cache size: 2968, Positive conditional cache size: 0, Positive unconditional cache size: 2968, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 993.3ms, 109 PlacesBefore, 108 PlacesAfterwards, 164 TransitionsBefore, 164 TransitionsAfterwards, 2878 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 545 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 285, positive: 280, positive conditional: 0, positive unconditional: 280, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 285, positive: 280, positive conditional: 0, positive unconditional: 280, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3028, Positive cache size: 2968, Positive conditional cache size: 0, Positive unconditional cache size: 2968, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 136.7ms, 105 PlacesBefore, 91 PlacesAfterwards, 83 TransitionsBefore, 81 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 84 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 84, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 84, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3167, Positive cache size: 3107, Positive conditional cache size: 0, Positive unconditional cache size: 3107, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1993.8ms, 83 PlacesBefore, 67 PlacesAfterwards, 45 TransitionsBefore, 44 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3231, Positive cache size: 3171, Positive conditional cache size: 0, Positive unconditional cache size: 3171, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L869] 0 pthread_t t205; [L870] FCALL, FORK 0 pthread_create(&t205, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 pthread_t t206; [L872] FCALL, FORK 0 pthread_create(&t206, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t207; [L874] FCALL, FORK 0 pthread_create(&t207, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t208; [L876] FCALL, FORK 0 pthread_create(&t208, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = z$w_buff0 [L816] 4 z$w_buff0 = 1 [L817] 4 z$w_buff1_used = z$w_buff0_used [L818] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L820] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L821] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L822] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L823] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L824] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L825] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 4 z$flush_delayed = weak$$choice2 [L831] 4 z$mem_tmp = z [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1 [L832] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L832] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L833] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L833] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L834] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L834] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L835] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L835] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L837] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L838] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 __unbuffered_p3_EAX = z [L840] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L840] 4 z = z$flush_delayed ? z$mem_tmp : z [L841] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L844] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 a = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L769] 2 x = 1 [L772] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 z$flush_delayed = weak$$choice2 [L793] 3 z$mem_tmp = z [L794] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L794] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L795] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L795] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L795] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L796] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L796] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L796] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L797] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L797] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L798] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L799] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L799] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = z [L802] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L802] 3 z = z$flush_delayed ? z$mem_tmp : z [L803] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L847] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L847] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L848] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L848] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L849] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L850] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L851] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L882] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L882] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L883] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L883] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L884] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L884] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L885] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L885] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L886] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L886] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 56144.6ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 34169.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5321.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 125 SDtfs, 130 SDslu, 98 SDs, 0 SdLazy, 456 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 471.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 632.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=2264occurred in iteration=11, InterpolantAutomatonStates: 91, 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: 38.9ms SsaConstructionTime, 495.6ms SatisfiabilityAnalysisTime, 949.6ms InterpolantComputationTime, 288 NumberOfCodeBlocks, 288 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 250 ConstructedInterpolants, 0 QuantifiedInterpolants, 1867 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...