/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-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:49:01,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:49:01,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:49:01,513 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:49:01,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:49:01,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:49:01,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:49:01,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:49:01,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:49:01,526 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:49:01,526 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:49:01,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:49:01,527 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:49:01,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:49:01,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:49:01,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:49:01,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:49:01,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:49:01,535 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:49:01,538 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:49:01,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:49:01,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:49:01,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:49:01,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:49:01,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:49:01,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:49:01,547 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:49:01,548 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:49:01,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:49:01,549 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:49:01,549 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:49:01,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:49:01,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:49:01,551 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:49:01,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:49:01,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:49:01,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:49:01,552 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:49:01,552 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:49:01,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:49:01,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:49:01,556 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-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 15:49:01,583 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:49:01,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:49:01,585 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:49:01,585 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:49:01,586 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:49:01,586 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:49:01,586 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:49:01,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:49:01,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:49:01,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:49:01,587 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:49:01,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:49:01,587 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:49:01,587 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:49:01,587 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:49:01,587 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:49:01,587 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:49:01,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:49:01,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:49:01,588 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:49:01,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:49:01,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:49:01,588 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:49:01,588 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:49:01,588 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:49:01,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:49:01,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:49:01,589 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:49:01,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:49:01,589 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:49:01,589 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 15:49:01,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:49:01,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:49:01,845 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:49:01,845 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:49:01,846 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:49:01,847 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2021-06-11 15:49:01,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677115bc1/467d22a8494b417198ab2c86cbc8f93e/FLAG46ddeee59 [2021-06-11 15:49:02,217 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:49:02,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2021-06-11 15:49:02,226 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677115bc1/467d22a8494b417198ab2c86cbc8f93e/FLAG46ddeee59 [2021-06-11 15:49:02,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/677115bc1/467d22a8494b417198ab2c86cbc8f93e [2021-06-11 15:49:02,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:49:02,611 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:49:02,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:49:02,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:49:02,619 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:49:02,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:49:02" (1/1) ... [2021-06-11 15:49:02,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7af0311b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:02, skipping insertion in model container [2021-06-11 15:49:02,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:49:02" (1/1) ... [2021-06-11 15:49:02,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:49:02,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:49:02,756 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/mix046_rmo.opt.i[948,961] [2021-06-11 15:49:02,916 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:49:02,921 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:49:02,928 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/mix046_rmo.opt.i[948,961] [2021-06-11 15:49:02,953 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:49:03,017 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:49:03,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03 WrapperNode [2021-06-11 15:49:03,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:49:03,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:49:03,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:49:03,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:49:03,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:49:03,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:49:03,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:49:03,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:49:03,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,097 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,108 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,110 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (1/1) ... [2021-06-11 15:49:03,126 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:49:03,127 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:49:03,127 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:49:03,127 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:49:03,128 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (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 15:49:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:49:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:49:03,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:49:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:49:03,210 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:49:03,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:49:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:49:03,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:49:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:49:03,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:49:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 15:49:03,211 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 15:49:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:49:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:49:03,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:49:03,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:49:03,213 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 15:49:04,520 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:49:04,520 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:49:04,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:49:04 BoogieIcfgContainer [2021-06-11 15:49:04,521 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:49:04,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:49:04,522 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:49:04,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:49:04,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:49:02" (1/3) ... [2021-06-11 15:49:04,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2346f284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:49:04, skipping insertion in model container [2021-06-11 15:49:04,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:49:03" (2/3) ... [2021-06-11 15:49:04,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2346f284 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:49:04, skipping insertion in model container [2021-06-11 15:49:04,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:49:04" (3/3) ... [2021-06-11 15:49:04,526 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_rmo.opt.i [2021-06-11 15:49:04,530 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:49:04,533 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:49:04,534 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:49:04,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,559 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,560 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,561 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,567 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,567 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,567 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,569 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,569 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,569 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,572 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,573 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:49:04,574 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:49:04,585 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 15:49:04,597 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:49:04,597 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:49:04,598 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:49:04,598 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:49:04,598 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:49:04,598 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:49:04,598 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:49:04,598 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:49:04,605 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-06-11 15:49:04,630 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-06-11 15:49:04,630 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:04,633 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 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-11 15:49:04,633 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-06-11 15:49:04,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-06-11 15:49:04,637 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:04,646 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-06-11 15:49:04,648 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-06-11 15:49:04,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-06-11 15:49:04,663 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-06-11 15:49:04,663 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:04,663 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 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-06-11 15:49:04,665 INFO L151 LiptonReduction]: Number of co-enabled transitions 2598 [2021-06-11 15:49:04,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:04,765 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:04,778 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:04,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:04,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:04,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,819 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:04,831 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:04,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:04,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,858 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:04,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:04,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:04,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,066 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,071 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:05,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:05,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:05,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,266 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:49:05,266 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:05,285 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,289 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,499 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:05,500 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:05,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:05,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,514 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,608 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,632 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,658 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:05,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:05,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:05,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,764 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,764 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:05,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:05,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:05,916 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:05,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:05,985 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:49:05,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,053 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,054 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,106 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,229 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,314 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,333 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,380 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,380 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,448 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,483 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,484 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,593 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:06,633 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:06,832 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:49:07,192 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 15:49:07,305 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 15:49:07,313 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,315 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:07,317 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,320 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:49:07,320 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:07,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,322 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:49:07,322 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:07,327 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,329 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 15:49:07,329 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:07,330 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 15:49:07,331 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 15:49:07,331 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:07,332 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,334 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 15:49:07,334 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 15:49:07,334 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:07,335 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,339 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 15:49:07,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,396 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:07,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,575 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:07,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:07,578 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:07,654 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,656 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:07,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:07,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,708 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:07,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,771 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:07,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:07,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:07,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,803 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:07,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,846 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:49:07,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:07,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,117 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,159 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,215 INFO L142 QuantifierPusher]: treesize reduction 84, result has 91.3 percent of original size [2021-06-11 15:49:08,218 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,226 INFO L147 QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1 [2021-06-11 15:49:08,227 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,228 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,231 INFO L142 QuantifierPusher]: treesize reduction 38, result has 71.0 percent of original size [2021-06-11 15:49:08,233 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:49:08,239 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,241 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,243 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:49:08,245 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:49:08,249 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,250 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,251 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:49:08,252 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,253 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:49:08,255 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,256 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 15:49:08,257 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:49:08,257 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,259 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,266 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 15:49:08,266 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,270 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,270 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 15:49:08,270 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,271 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,275 INFO L147 QuantifierPusher]: treesize reduction 185, result has 40.1 percent of original size 124 [2021-06-11 15:49:08,275 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,277 INFO L142 QuantifierPusher]: treesize reduction 185, result has 55.3 percent of original size [2021-06-11 15:49:08,279 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 4, 3, 2, 1] term [2021-06-11 15:49:08,279 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,281 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,282 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 4, 4, 2, 2, 1] term [2021-06-11 15:49:08,282 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,285 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,285 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2021-06-11 15:49:08,285 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,288 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,291 INFO L147 QuantifierPusher]: treesize reduction 404, result has 24.5 percent of original size 131 [2021-06-11 15:49:08,292 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:49:08,292 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,295 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,295 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:49:08,295 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,297 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,299 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 4, 4, 3, 4, 3, 4, 2, 2, 1] term [2021-06-11 15:49:08,299 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:49:08,300 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,311 INFO L147 QuantifierPusher]: treesize reduction 1520, result has 17.0 percent of original size 311 [2021-06-11 15:49:08,377 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,382 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:08,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:08,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,498 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,505 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,505 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:49:08,506 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:08,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,507 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:49:08,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:49:08,509 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:49:08,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:49:08,587 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:08,852 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,854 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:08,856 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:08,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:08,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:09,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:09,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:09,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:09,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:09,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:09,523 WARN L205 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-11 15:49:09,696 WARN L205 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-11 15:49:10,031 WARN L205 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-11 15:49:10,178 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-11 15:49:10,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:10,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:49:10,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:10,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:10,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:10,213 INFO L163 LiptonReduction]: Checked pairs total: 7147 [2021-06-11 15:49:10,213 INFO L165 LiptonReduction]: Total number of compositions: 101 [2021-06-11 15:49:10,215 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5579 [2021-06-11 15:49:10,222 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-06-11 15:49:10,222 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:10,222 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:10,222 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:10,222 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 15:49:10,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 950004456, now seen corresponding path program 1 times [2021-06-11 15:49:10,230 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:10,230 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620152517] [2021-06-11 15:49:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:10,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:10,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:10,370 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 15:49:10,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620152517] [2021-06-11 15:49:10,371 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:10,371 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:49:10,371 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980408650] [2021-06-11 15:49:10,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:49:10,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:10,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:49:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:49:10,384 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 218 [2021-06-11 15:49:10,386 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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 15:49:10,386 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:10,386 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 218 [2021-06-11 15:49:10,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:10,420 INFO L129 PetriNetUnfolder]: 16/75 cut-off events. [2021-06-11 15:49:10,420 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:10,421 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 75 events. 16/75 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 251 event pairs, 2 based on Foata normal form. 12/84 useless extension candidates. Maximal degree in co-relation 112. Up to 27 conditions per place. [2021-06-11 15:49:10,422 INFO L132 encePairwiseOnDemand]: 213/218 looper letters, 7 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2021-06-11 15:49:10,422 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 32 transitions, 94 flow [2021-06-11 15:49:10,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:49:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:49:10,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions. [2021-06-11 15:49:10,431 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8700305810397554 [2021-06-11 15:49:10,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 569 transitions. [2021-06-11 15:49:10,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions. [2021-06-11 15:49:10,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:10,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions. [2021-06-11 15:49:10,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 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 15:49:10,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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 15:49:10,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 218.0) internal successors, (872), 4 states have internal predecessors, (872), 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 15:49:10,442 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 76 flow. Second operand 3 states and 569 transitions. [2021-06-11 15:49:10,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 32 transitions, 94 flow [2021-06-11 15:49:10,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 15:49:10,445 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 70 flow [2021-06-11 15:49:10,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, 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 15:49:10,447 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -4 predicate places. [2021-06-11 15:49:10,447 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:10,447 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 29 transitions, 70 flow [2021-06-11 15:49:10,447 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 29 transitions, 70 flow [2021-06-11 15:49:10,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 70 flow [2021-06-11 15:49:10,451 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-06-11 15:49:10,451 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:10,451 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 41 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 15:49:10,451 INFO L151 LiptonReduction]: Number of co-enabled transitions 422 [2021-06-11 15:49:11,136 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 233 DAG size of output: 192 [2021-06-11 15:49:11,398 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-06-11 15:49:12,614 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 317 DAG size of output: 273 [2021-06-11 15:49:13,181 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-06-11 15:49:13,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:13,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:14,698 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 249 DAG size of output: 208 [2021-06-11 15:49:15,169 WARN L205 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-06-11 15:49:17,608 WARN L205 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 339 DAG size of output: 293 [2021-06-11 15:49:18,634 WARN L205 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 289 [2021-06-11 15:49:19,026 INFO L163 LiptonReduction]: Checked pairs total: 978 [2021-06-11 15:49:19,026 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:49:19,027 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8580 [2021-06-11 15:49:19,027 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2021-06-11 15:49:19,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 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 15:49:19,028 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:19,028 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:19,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:49:19,028 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 15:49:19,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:19,028 INFO L82 PathProgramCache]: Analyzing trace with hash 2045488426, now seen corresponding path program 1 times [2021-06-11 15:49:19,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:19,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264385364] [2021-06-11 15:49:19,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:19,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,093 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:19,097 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-11 15:49:19,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:49:19,111 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 15:49:19,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264385364] [2021-06-11 15:49:19,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:19,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:49:19,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426503129] [2021-06-11 15:49:19,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:49:19,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:19,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:49:19,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:49:19,114 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 220 [2021-06-11 15:49:19,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:19,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:19,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 220 [2021-06-11 15:49:19,115 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:19,150 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2021-06-11 15:49:19,150 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:19,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 30 events. 1/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 50 event pairs, 0 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 40. Up to 3 conditions per place. [2021-06-11 15:49:19,150 INFO L132 encePairwiseOnDemand]: 216/220 looper letters, 1 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2021-06-11 15:49:19,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 84 flow [2021-06-11 15:49:19,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:49:19,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:49:19,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 902 transitions. [2021-06-11 15:49:19,153 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.82 [2021-06-11 15:49:19,153 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 902 transitions. [2021-06-11 15:49:19,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 902 transitions. [2021-06-11 15:49:19,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:19,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 902 transitions. [2021-06-11 15:49:19,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 180.4) internal successors, (902), 5 states have internal predecessors, (902), 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 15:49:19,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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 15:49:19,158 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 220.0) internal successors, (1320), 6 states have internal predecessors, (1320), 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 15:49:19,158 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 902 transitions. [2021-06-11 15:49:19,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 84 flow [2021-06-11 15:49:19,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:49:19,159 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 68 flow [2021-06-11 15:49:19,159 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2021-06-11 15:49:19,160 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2021-06-11 15:49:19,160 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:19,160 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 26 transitions, 68 flow [2021-06-11 15:49:19,160 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 26 transitions, 68 flow [2021-06-11 15:49:19,160 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 26 transitions, 68 flow [2021-06-11 15:49:19,164 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-06-11 15:49:19,164 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:49:19,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 26 events. 0/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 15:49:19,164 INFO L151 LiptonReduction]: Number of co-enabled transitions 328 [2021-06-11 15:49:19,314 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:19,362 INFO L163 LiptonReduction]: Checked pairs total: 713 [2021-06-11 15:49:19,363 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 15:49:19,363 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 203 [2021-06-11 15:49:19,363 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2021-06-11 15:49:19,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:19,364 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:19,364 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:19,364 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 15:49:19,364 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 15:49:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:19,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1014290338, now seen corresponding path program 1 times [2021-06-11 15:49:19,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:19,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868333519] [2021-06-11 15:49:19,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:19,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:19,408 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 15:49:19,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868333519] [2021-06-11 15:49:19,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:19,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:49:19,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073191458] [2021-06-11 15:49:19,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:49:19,408 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:19,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:49:19,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:49:19,410 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 221 [2021-06-11 15:49:19,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:19,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:19,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 221 [2021-06-11 15:49:19,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:19,422 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-06-11 15:49:19,422 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 15:49:19,422 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 37 events. 3/37 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 73 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 55. Up to 10 conditions per place. [2021-06-11 15:49:19,423 INFO L132 encePairwiseOnDemand]: 217/221 looper letters, 3 selfloop transitions, 3 changer transitions 0/27 dead transitions. [2021-06-11 15:49:19,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 82 flow [2021-06-11 15:49:19,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:49:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:49:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2021-06-11 15:49:19,425 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8793363499245852 [2021-06-11 15:49:19,425 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 583 transitions. [2021-06-11 15:49:19,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions. [2021-06-11 15:49:19,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:19,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions. [2021-06-11 15:49:19,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:19,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 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 15:49:19,428 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 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 15:49:19,428 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 3 states and 583 transitions. [2021-06-11 15:49:19,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 82 flow [2021-06-11 15:49:19,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:49:19,429 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 81 flow [2021-06-11 15:49:19,429 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-06-11 15:49:19,429 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2021-06-11 15:49:19,429 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:19,429 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 81 flow [2021-06-11 15:49:19,429 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 81 flow [2021-06-11 15:49:19,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 81 flow [2021-06-11 15:49:19,434 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-06-11 15:49:19,434 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 15:49:19,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 33 events. 3/33 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-06-11 15:49:19,434 INFO L151 LiptonReduction]: Number of co-enabled transitions 342 [2021-06-11 15:49:19,436 INFO L163 LiptonReduction]: Checked pairs total: 292 [2021-06-11 15:49:19,436 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:19,436 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 15:49:19,437 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 81 flow [2021-06-11 15:49:19,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:19,437 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:19,437 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:19,437 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:49:19,437 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 15:49:19,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash -976556952, now seen corresponding path program 1 times [2021-06-11 15:49:19,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:19,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362711399] [2021-06-11 15:49:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:19,504 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:19,509 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:19,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:19,524 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 15:49:19,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362711399] [2021-06-11 15:49:19,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:19,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:49:19,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563800464] [2021-06-11 15:49:19,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:49:19,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:49:19,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:49:19,526 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 221 [2021-06-11 15:49:19,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 81 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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 15:49:19,527 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:19,527 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 221 [2021-06-11 15:49:19,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:19,587 INFO L129 PetriNetUnfolder]: 47/127 cut-off events. [2021-06-11 15:49:19,588 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2021-06-11 15:49:19,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 127 events. 47/127 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 510 event pairs, 27 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 255. Up to 77 conditions per place. [2021-06-11 15:49:19,589 INFO L132 encePairwiseOnDemand]: 216/221 looper letters, 8 selfloop transitions, 5 changer transitions 0/33 dead transitions. [2021-06-11 15:49:19,589 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 33 transitions, 120 flow [2021-06-11 15:49:19,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:49:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:49:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 690 transitions. [2021-06-11 15:49:19,591 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7805429864253394 [2021-06-11 15:49:19,591 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 690 transitions. [2021-06-11 15:49:19,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 690 transitions. [2021-06-11 15:49:19,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:19,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 690 transitions. [2021-06-11 15:49:19,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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 15:49:19,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 15:49:19,594 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 15:49:19,594 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 81 flow. Second operand 4 states and 690 transitions. [2021-06-11 15:49:19,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 33 transitions, 120 flow [2021-06-11 15:49:19,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 117 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:49:19,595 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 111 flow [2021-06-11 15:49:19,595 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-06-11 15:49:19,596 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2021-06-11 15:49:19,596 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:19,596 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 111 flow [2021-06-11 15:49:19,596 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 111 flow [2021-06-11 15:49:19,596 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 111 flow [2021-06-11 15:49:19,601 INFO L129 PetriNetUnfolder]: 7/47 cut-off events. [2021-06-11 15:49:19,601 INFO L130 PetriNetUnfolder]: For 24/27 co-relation queries the response was YES. [2021-06-11 15:49:19,601 INFO L84 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 47 events. 7/47 cut-off events. For 24/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 126 event pairs, 3 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 93. Up to 15 conditions per place. [2021-06-11 15:49:19,601 INFO L151 LiptonReduction]: Number of co-enabled transitions 400 [2021-06-11 15:49:19,626 INFO L163 LiptonReduction]: Checked pairs total: 268 [2021-06-11 15:49:19,627 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:19,627 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-06-11 15:49:19,627 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 111 flow [2021-06-11 15:49:19,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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 15:49:19,628 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:19,628 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:19,628 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 15:49:19,628 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 15:49:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:19,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1946532588, now seen corresponding path program 1 times [2021-06-11 15:49:19,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:19,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150876011] [2021-06-11 15:49:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:19,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:49:19,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:19,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:49:19,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:19,685 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 15:49:19,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150876011] [2021-06-11 15:49:19,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:19,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:49:19,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787940112] [2021-06-11 15:49:19,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:49:19,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:19,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:49:19,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:49:19,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 221 [2021-06-11 15:49:19,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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 15:49:19,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:19,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 221 [2021-06-11 15:49:19,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:19,735 INFO L129 PetriNetUnfolder]: 44/129 cut-off events. [2021-06-11 15:49:19,735 INFO L130 PetriNetUnfolder]: For 79/81 co-relation queries the response was YES. [2021-06-11 15:49:19,736 INFO L84 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 129 events. 44/129 cut-off events. For 79/81 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 553 event pairs, 13 based on Foata normal form. 6/126 useless extension candidates. Maximal degree in co-relation 309. Up to 59 conditions per place. [2021-06-11 15:49:19,737 INFO L132 encePairwiseOnDemand]: 216/221 looper letters, 9 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2021-06-11 15:49:19,737 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 154 flow [2021-06-11 15:49:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:49:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:49:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 720 transitions. [2021-06-11 15:49:19,739 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8144796380090498 [2021-06-11 15:49:19,739 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 720 transitions. [2021-06-11 15:49:19,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 720 transitions. [2021-06-11 15:49:19,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:19,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 720 transitions. [2021-06-11 15:49:19,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 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 15:49:19,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 15:49:19,742 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 15:49:19,742 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 111 flow. Second operand 4 states and 720 transitions. [2021-06-11 15:49:19,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 154 flow [2021-06-11 15:49:19,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:49:19,744 INFO L241 Difference]: Finished difference. Result has 46 places, 33 transitions, 140 flow [2021-06-11 15:49:19,744 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2021-06-11 15:49:19,744 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 2 predicate places. [2021-06-11 15:49:19,744 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:19,744 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 33 transitions, 140 flow [2021-06-11 15:49:19,744 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 33 transitions, 140 flow [2021-06-11 15:49:19,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 33 transitions, 140 flow [2021-06-11 15:49:19,750 INFO L129 PetriNetUnfolder]: 12/59 cut-off events. [2021-06-11 15:49:19,750 INFO L130 PetriNetUnfolder]: For 70/76 co-relation queries the response was YES. [2021-06-11 15:49:19,751 INFO L84 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 59 events. 12/59 cut-off events. For 70/76 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 174 event pairs, 5 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 140. Up to 19 conditions per place. [2021-06-11 15:49:19,751 INFO L151 LiptonReduction]: Number of co-enabled transitions 428 [2021-06-11 15:49:19,793 INFO L163 LiptonReduction]: Checked pairs total: 271 [2021-06-11 15:49:19,793 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:19,793 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-06-11 15:49:19,793 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 140 flow [2021-06-11 15:49:19,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 178.0) internal successors, (890), 5 states have internal predecessors, (890), 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 15:49:19,794 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:19,794 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:19,794 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 15:49:19,794 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 15:49:19,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:19,794 INFO L82 PathProgramCache]: Analyzing trace with hash 234720935, now seen corresponding path program 1 times [2021-06-11 15:49:19,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:19,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077893079] [2021-06-11 15:49:19,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:19,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:19,874 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:19,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,875 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:19,883 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-11 15:49:19,887 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:49:19,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:19,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:19,915 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 15:49:19,916 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077893079] [2021-06-11 15:49:19,916 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:19,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:49:19,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640233554] [2021-06-11 15:49:19,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:49:19,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:19,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:49:19,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:49:19,917 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 221 [2021-06-11 15:49:19,919 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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 15:49:19,919 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:19,919 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 221 [2021-06-11 15:49:19,919 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:19,996 INFO L129 PetriNetUnfolder]: 54/147 cut-off events. [2021-06-11 15:49:19,996 INFO L130 PetriNetUnfolder]: For 193/195 co-relation queries the response was YES. [2021-06-11 15:49:19,997 INFO L84 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 147 events. 54/147 cut-off events. For 193/195 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 660 event pairs, 12 based on Foata normal form. 4/143 useless extension candidates. Maximal degree in co-relation 454. Up to 76 conditions per place. [2021-06-11 15:49:19,998 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 13 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2021-06-11 15:49:19,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 223 flow [2021-06-11 15:49:19,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:49:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:49:20,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 852 transitions. [2021-06-11 15:49:20,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7710407239819005 [2021-06-11 15:49:20,000 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 852 transitions. [2021-06-11 15:49:20,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 852 transitions. [2021-06-11 15:49:20,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:20,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 852 transitions. [2021-06-11 15:49:20,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 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 15:49:20,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 15:49:20,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 15:49:20,004 INFO L185 Difference]: Start difference. First operand has 46 places, 33 transitions, 140 flow. Second operand 5 states and 852 transitions. [2021-06-11 15:49:20,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 223 flow [2021-06-11 15:49:20,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 208 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 15:49:20,009 INFO L241 Difference]: Finished difference. Result has 50 places, 38 transitions, 187 flow [2021-06-11 15:49:20,009 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2021-06-11 15:49:20,009 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2021-06-11 15:49:20,009 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:20,009 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 38 transitions, 187 flow [2021-06-11 15:49:20,009 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 38 transitions, 187 flow [2021-06-11 15:49:20,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 187 flow [2021-06-11 15:49:20,024 INFO L129 PetriNetUnfolder]: 25/93 cut-off events. [2021-06-11 15:49:20,024 INFO L130 PetriNetUnfolder]: For 124/128 co-relation queries the response was YES. [2021-06-11 15:49:20,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 93 events. 25/93 cut-off events. For 124/128 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 373 event pairs, 8 based on Foata normal form. 2/86 useless extension candidates. Maximal degree in co-relation 257. Up to 34 conditions per place. [2021-06-11 15:49:20,026 INFO L151 LiptonReduction]: Number of co-enabled transitions 498 [2021-06-11 15:49:20,032 INFO L163 LiptonReduction]: Checked pairs total: 317 [2021-06-11 15:49:20,032 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:20,032 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 23 [2021-06-11 15:49:20,033 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 187 flow [2021-06-11 15:49:20,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.0) internal successors, (1008), 6 states have internal predecessors, (1008), 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 15:49:20,033 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:20,033 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:20,033 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 15:49:20,033 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 15:49:20,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:20,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1534153901, now seen corresponding path program 2 times [2021-06-11 15:49:20,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:20,034 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362764058] [2021-06-11 15:49:20,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:20,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:20,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,100 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:49:20,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:49:20,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:49:20,122 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,123 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:49:20,132 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 15:49:20,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362764058] [2021-06-11 15:49:20,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:20,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:49:20,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687286975] [2021-06-11 15:49:20,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:49:20,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:20,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:49:20,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:49:20,134 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 221 [2021-06-11 15:49:20,134 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 187 flow. Second operand has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 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 15:49:20,134 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:20,135 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 221 [2021-06-11 15:49:20,135 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:20,253 INFO L129 PetriNetUnfolder]: 58/169 cut-off events. [2021-06-11 15:49:20,254 INFO L130 PetriNetUnfolder]: For 258/268 co-relation queries the response was YES. [2021-06-11 15:49:20,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 593 conditions, 169 events. 58/169 cut-off events. For 258/268 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 843 event pairs, 1 based on Foata normal form. 7/169 useless extension candidates. Maximal degree in co-relation 574. Up to 75 conditions per place. [2021-06-11 15:49:20,256 INFO L132 encePairwiseOnDemand]: 215/221 looper letters, 15 selfloop transitions, 12 changer transitions 0/47 dead transitions. [2021-06-11 15:49:20,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 289 flow [2021-06-11 15:49:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 15:49:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 15:49:20,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1010 transitions. [2021-06-11 15:49:20,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7616892911010558 [2021-06-11 15:49:20,258 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1010 transitions. [2021-06-11 15:49:20,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1010 transitions. [2021-06-11 15:49:20,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:20,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1010 transitions. [2021-06-11 15:49:20,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.33333333333334) internal successors, (1010), 6 states have internal predecessors, (1010), 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 15:49:20,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 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 15:49:20,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 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 15:49:20,262 INFO L185 Difference]: Start difference. First operand has 50 places, 38 transitions, 187 flow. Second operand 6 states and 1010 transitions. [2021-06-11 15:49:20,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 289 flow [2021-06-11 15:49:20,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 280 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 15:49:20,264 INFO L241 Difference]: Finished difference. Result has 56 places, 42 transitions, 246 flow [2021-06-11 15:49:20,265 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=246, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2021-06-11 15:49:20,265 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 12 predicate places. [2021-06-11 15:49:20,265 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:20,265 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 42 transitions, 246 flow [2021-06-11 15:49:20,265 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 42 transitions, 246 flow [2021-06-11 15:49:20,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 42 transitions, 246 flow [2021-06-11 15:49:20,276 INFO L129 PetriNetUnfolder]: 25/97 cut-off events. [2021-06-11 15:49:20,276 INFO L130 PetriNetUnfolder]: For 212/217 co-relation queries the response was YES. [2021-06-11 15:49:20,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 97 events. 25/97 cut-off events. For 212/217 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 381 event pairs, 8 based on Foata normal form. 3/92 useless extension candidates. Maximal degree in co-relation 300. Up to 35 conditions per place. [2021-06-11 15:49:20,277 INFO L151 LiptonReduction]: Number of co-enabled transitions 556 [2021-06-11 15:49:20,282 INFO L163 LiptonReduction]: Checked pairs total: 384 [2021-06-11 15:49:20,282 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:20,282 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-06-11 15:49:20,282 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 246 flow [2021-06-11 15:49:20,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 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 15:49:20,284 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:20,284 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:20,284 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 15:49:20,284 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 15:49:20,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:20,284 INFO L82 PathProgramCache]: Analyzing trace with hash -871716805, now seen corresponding path program 3 times [2021-06-11 15:49:20,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:20,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360591304] [2021-06-11 15:49:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:20,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,357 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:49:20,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:49:20,379 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 15:49:20,406 INFO L142 QuantifierPusher]: treesize reduction 10, result has 87.7 percent of original size [2021-06-11 15:49:20,407 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 71 [2021-06-11 15:49:20,438 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 15:49:20,459 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 15:49:20,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360591304] [2021-06-11 15:49:20,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:20,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:49:20,459 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114129096] [2021-06-11 15:49:20,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:49:20,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:20,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:49:20,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:49:20,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 221 [2021-06-11 15:49:20,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 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 15:49:20,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:20,462 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 221 [2021-06-11 15:49:20,462 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:20,568 INFO L129 PetriNetUnfolder]: 55/159 cut-off events. [2021-06-11 15:49:20,568 INFO L130 PetriNetUnfolder]: For 425/437 co-relation queries the response was YES. [2021-06-11 15:49:20,569 INFO L84 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 159 events. 55/159 cut-off events. For 425/437 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 734 event pairs, 7 based on Foata normal form. 9/160 useless extension candidates. Maximal degree in co-relation 614. Up to 58 conditions per place. [2021-06-11 15:49:20,571 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 11 selfloop transitions, 14 changer transitions 0/45 dead transitions. [2021-06-11 15:49:20,571 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 314 flow [2021-06-11 15:49:20,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:49:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:49:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 842 transitions. [2021-06-11 15:49:20,573 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7619909502262443 [2021-06-11 15:49:20,573 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 842 transitions. [2021-06-11 15:49:20,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 842 transitions. [2021-06-11 15:49:20,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:20,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 842 transitions. [2021-06-11 15:49:20,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 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 15:49:20,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 15:49:20,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 15:49:20,577 INFO L185 Difference]: Start difference. First operand has 56 places, 42 transitions, 246 flow. Second operand 5 states and 842 transitions. [2021-06-11 15:49:20,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 314 flow [2021-06-11 15:49:20,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 45 transitions, 294 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-06-11 15:49:20,580 INFO L241 Difference]: Finished difference. Result has 58 places, 42 transitions, 266 flow [2021-06-11 15:49:20,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2021-06-11 15:49:20,580 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 14 predicate places. [2021-06-11 15:49:20,580 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:20,581 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 42 transitions, 266 flow [2021-06-11 15:49:20,581 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 42 transitions, 266 flow [2021-06-11 15:49:20,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 42 transitions, 266 flow [2021-06-11 15:49:20,590 INFO L129 PetriNetUnfolder]: 26/94 cut-off events. [2021-06-11 15:49:20,590 INFO L130 PetriNetUnfolder]: For 321/325 co-relation queries the response was YES. [2021-06-11 15:49:20,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 94 events. 26/94 cut-off events. For 321/325 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 366 event pairs, 8 based on Foata normal form. 2/87 useless extension candidates. Maximal degree in co-relation 321. Up to 35 conditions per place. [2021-06-11 15:49:20,591 INFO L151 LiptonReduction]: Number of co-enabled transitions 554 [2021-06-11 15:49:20,595 INFO L163 LiptonReduction]: Checked pairs total: 377 [2021-06-11 15:49:20,595 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:20,595 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 15:49:20,596 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 266 flow [2021-06-11 15:49:20,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 165.85714285714286) internal successors, (1161), 7 states have internal predecessors, (1161), 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 15:49:20,596 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:20,596 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:20,597 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 15:49:20,597 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 15:49:20,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:20,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1272409045, now seen corresponding path program 1 times [2021-06-11 15:49:20,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:20,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211421331] [2021-06-11 15:49:20,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:20,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:20,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:20,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:20,681 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 15:49:20,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211421331] [2021-06-11 15:49:20,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:20,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:49:20,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107317507] [2021-06-11 15:49:20,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:49:20,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:20,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:49:20,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:49:20,685 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:49:20,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 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 15:49:20,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:20,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:49:20,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:20,767 INFO L129 PetriNetUnfolder]: 318/637 cut-off events. [2021-06-11 15:49:20,767 INFO L130 PetriNetUnfolder]: For 1263/1393 co-relation queries the response was YES. [2021-06-11 15:49:20,769 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1902 conditions, 637 events. 318/637 cut-off events. For 1263/1393 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 4182 event pairs, 126 based on Foata normal form. 76/625 useless extension candidates. Maximal degree in co-relation 1880. Up to 339 conditions per place. [2021-06-11 15:49:20,772 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 11 selfloop transitions, 10 changer transitions 0/55 dead transitions. [2021-06-11 15:49:20,772 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 55 transitions, 334 flow [2021-06-11 15:49:20,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:49:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:49:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 922 transitions. [2021-06-11 15:49:20,774 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8343891402714932 [2021-06-11 15:49:20,774 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 922 transitions. [2021-06-11 15:49:20,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 922 transitions. [2021-06-11 15:49:20,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:20,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 922 transitions. [2021-06-11 15:49:20,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.4) internal successors, (922), 5 states have internal predecessors, (922), 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 15:49:20,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 15:49:20,777 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 15:49:20,777 INFO L185 Difference]: Start difference. First operand has 58 places, 42 transitions, 266 flow. Second operand 5 states and 922 transitions. [2021-06-11 15:49:20,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 55 transitions, 334 flow [2021-06-11 15:49:20,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 55 transitions, 302 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-06-11 15:49:20,782 INFO L241 Difference]: Finished difference. Result has 61 places, 51 transitions, 313 flow [2021-06-11 15:49:20,782 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2021-06-11 15:49:20,782 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2021-06-11 15:49:20,782 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:20,782 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 51 transitions, 313 flow [2021-06-11 15:49:20,782 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 51 transitions, 313 flow [2021-06-11 15:49:20,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 51 transitions, 313 flow [2021-06-11 15:49:20,824 INFO L129 PetriNetUnfolder]: 287/549 cut-off events. [2021-06-11 15:49:20,824 INFO L130 PetriNetUnfolder]: For 970/1089 co-relation queries the response was YES. [2021-06-11 15:49:20,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1831 conditions, 549 events. 287/549 cut-off events. For 970/1089 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 3392 event pairs, 125 based on Foata normal form. 3/469 useless extension candidates. Maximal degree in co-relation 1808. Up to 338 conditions per place. [2021-06-11 15:49:20,830 INFO L151 LiptonReduction]: Number of co-enabled transitions 844 [2021-06-11 15:49:20,839 INFO L163 LiptonReduction]: Checked pairs total: 454 [2021-06-11 15:49:20,839 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:20,840 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-06-11 15:49:20,841 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 313 flow [2021-06-11 15:49:20,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 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 15:49:20,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:20,841 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:20,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 15:49:20,842 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 15:49:20,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1366572563, now seen corresponding path program 1 times [2021-06-11 15:49:20,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:20,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555277884] [2021-06-11 15:49:20,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:20,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,918 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:20,921 INFO L142 QuantifierPusher]: treesize reduction 4, result has 85.2 percent of original size [2021-06-11 15:49:20,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-11 15:49:20,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:49:20,940 INFO L142 QuantifierPusher]: treesize reduction 8, result has 50.0 percent of original size [2021-06-11 15:49:20,940 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 15:49:20,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:20,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:49:20,954 INFO L142 QuantifierPusher]: treesize reduction 12, result has 7.7 percent of original size [2021-06-11 15:49:20,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:20,955 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 15:49:20,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555277884] [2021-06-11 15:49:20,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:20,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:49:20,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209292606] [2021-06-11 15:49:20,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:49:20,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:20,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:49:20,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:49:20,956 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 221 [2021-06-11 15:49:20,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 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 15:49:20,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:20,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 221 [2021-06-11 15:49:20,957 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:21,197 INFO L129 PetriNetUnfolder]: 943/1559 cut-off events. [2021-06-11 15:49:21,197 INFO L130 PetriNetUnfolder]: For 4683/4804 co-relation queries the response was YES. [2021-06-11 15:49:21,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6719 conditions, 1559 events. 943/1559 cut-off events. For 4683/4804 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 9535 event pairs, 125 based on Foata normal form. 132/1634 useless extension candidates. Maximal degree in co-relation 6694. Up to 1098 conditions per place. [2021-06-11 15:49:21,209 INFO L132 encePairwiseOnDemand]: 211/221 looper letters, 46 selfloop transitions, 54 changer transitions 4/122 dead transitions. [2021-06-11 15:49:21,209 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 122 transitions, 1027 flow [2021-06-11 15:49:21,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:49:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:49:21,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1488 transitions. [2021-06-11 15:49:21,212 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7481146304675717 [2021-06-11 15:49:21,212 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1488 transitions. [2021-06-11 15:49:21,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1488 transitions. [2021-06-11 15:49:21,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:21,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1488 transitions. [2021-06-11 15:49:21,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 165.33333333333334) internal successors, (1488), 9 states have internal predecessors, (1488), 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 15:49:21,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 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 15:49:21,218 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 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 15:49:21,218 INFO L185 Difference]: Start difference. First operand has 61 places, 51 transitions, 313 flow. Second operand 9 states and 1488 transitions. [2021-06-11 15:49:21,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 122 transitions, 1027 flow [2021-06-11 15:49:21,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 122 transitions, 1015 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:49:21,225 INFO L241 Difference]: Finished difference. Result has 73 places, 96 transitions, 850 flow [2021-06-11 15:49:21,225 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=850, PETRI_PLACES=73, PETRI_TRANSITIONS=96} [2021-06-11 15:49:21,225 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 29 predicate places. [2021-06-11 15:49:21,225 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:21,226 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 96 transitions, 850 flow [2021-06-11 15:49:21,226 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 96 transitions, 850 flow [2021-06-11 15:49:21,226 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 96 transitions, 850 flow [2021-06-11 15:49:21,342 INFO L129 PetriNetUnfolder]: 486/962 cut-off events. [2021-06-11 15:49:21,342 INFO L130 PetriNetUnfolder]: For 3699/3845 co-relation queries the response was YES. [2021-06-11 15:49:21,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4544 conditions, 962 events. 486/962 cut-off events. For 3699/3845 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 6619 event pairs, 49 based on Foata normal form. 18/907 useless extension candidates. Maximal degree in co-relation 4515. Up to 556 conditions per place. [2021-06-11 15:49:21,354 INFO L151 LiptonReduction]: Number of co-enabled transitions 1178 [2021-06-11 15:49:21,367 INFO L163 LiptonReduction]: Checked pairs total: 1372 [2021-06-11 15:49:21,368 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:21,368 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 143 [2021-06-11 15:49:21,368 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 96 transitions, 850 flow [2021-06-11 15:49:21,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 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 15:49:21,368 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:21,369 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 15:49:21,369 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 15:49:21,369 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 15:49:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:21,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1930450665, now seen corresponding path program 1 times [2021-06-11 15:49:21,370 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:21,370 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118227375] [2021-06-11 15:49:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:21,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:21,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:21,401 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:21,401 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:21,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 15:49:21,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118227375] [2021-06-11 15:49:21,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:21,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:49:21,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943879478] [2021-06-11 15:49:21,404 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:49:21,404 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:21,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:49:21,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:49:21,404 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 221 [2021-06-11 15:49:21,405 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 96 transitions, 850 flow. Second operand has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:21,405 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:21,405 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 221 [2021-06-11 15:49:21,405 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:21,544 INFO L129 PetriNetUnfolder]: 817/1604 cut-off events. [2021-06-11 15:49:21,544 INFO L130 PetriNetUnfolder]: For 6538/6824 co-relation queries the response was YES. [2021-06-11 15:49:21,551 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7662 conditions, 1604 events. 817/1604 cut-off events. For 6538/6824 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 12090 event pairs, 107 based on Foata normal form. 60/1572 useless extension candidates. Maximal degree in co-relation 7631. Up to 969 conditions per place. [2021-06-11 15:49:21,557 INFO L132 encePairwiseOnDemand]: 218/221 looper letters, 3 selfloop transitions, 3 changer transitions 9/96 dead transitions. [2021-06-11 15:49:21,558 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 862 flow [2021-06-11 15:49:21,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:49:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:49:21,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2021-06-11 15:49:21,559 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8778280542986425 [2021-06-11 15:49:21,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 582 transitions. [2021-06-11 15:49:21,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 582 transitions. [2021-06-11 15:49:21,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:21,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 582 transitions. [2021-06-11 15:49:21,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 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 15:49:21,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 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 15:49:21,562 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 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 15:49:21,562 INFO L185 Difference]: Start difference. First operand has 73 places, 96 transitions, 850 flow. Second operand 3 states and 582 transitions. [2021-06-11 15:49:21,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 862 flow [2021-06-11 15:49:21,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 824 flow, removed 19 selfloop flow, removed 0 redundant places. [2021-06-11 15:49:21,583 INFO L241 Difference]: Finished difference. Result has 76 places, 87 transitions, 733 flow [2021-06-11 15:49:21,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=733, PETRI_PLACES=76, PETRI_TRANSITIONS=87} [2021-06-11 15:49:21,583 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2021-06-11 15:49:21,583 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:21,583 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 87 transitions, 733 flow [2021-06-11 15:49:21,584 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 87 transitions, 733 flow [2021-06-11 15:49:21,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 87 transitions, 733 flow [2021-06-11 15:49:21,673 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 204#(= ~__unbuffered_cnt~0 0), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), 229#true, Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, 120#L2true, 59#P0EXITtrue, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,673 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,673 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,673 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,673 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,674 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 204#(= ~__unbuffered_cnt~0 0), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, 120#L2true, 59#P0EXITtrue, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,674 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,674 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,674 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,674 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,680 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 204#(= ~__unbuffered_cnt~0 0), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 95#L864true, Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), 229#true, Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), 47#P0ENTRYtrue, Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, P3Thread1of1ForFork3InUse, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,680 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 15:49:21,680 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:49:21,681 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:49:21,681 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:49:21,681 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 204#(= ~__unbuffered_cnt~0 0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), 95#L864true, Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), 231#(= ~y~0 1), Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), 47#P0ENTRYtrue, Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, P3Thread1of1ForFork3InUse, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,681 INFO L384 tUnfolder$Statistics]: this new event has 21 ancestors and is cut-off event [2021-06-11 15:49:21,681 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:49:21,681 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:49:21,681 INFO L387 tUnfolder$Statistics]: existing Event has 21 ancestors and is cut-off event [2021-06-11 15:49:21,684 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 204#(= ~__unbuffered_cnt~0 0), 82#L853-1true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), 229#true, Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, 59#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,684 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 15:49:21,685 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 15:49:21,685 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 15:49:21,685 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 15:49:21,685 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 204#(= ~__unbuffered_cnt~0 0), 82#L853-1true, Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, 59#P0EXITtrue, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,685 INFO L384 tUnfolder$Statistics]: this new event has 22 ancestors and is cut-off event [2021-06-11 15:49:21,685 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 15:49:21,685 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 15:49:21,685 INFO L387 tUnfolder$Statistics]: existing Event has 22 ancestors and is cut-off event [2021-06-11 15:49:21,694 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 204#(= ~__unbuffered_cnt~0 0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), 229#true, Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, 120#L2true, 59#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,694 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,695 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,695 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,695 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,695 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,696 INFO L382 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 204#(= ~__unbuffered_cnt~0 0), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, 120#L2true, 59#P0EXITtrue, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,696 INFO L384 tUnfolder$Statistics]: this new event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,696 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,696 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,696 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,696 INFO L387 tUnfolder$Statistics]: existing Event has 23 ancestors and is cut-off event [2021-06-11 15:49:21,701 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 204#(= ~__unbuffered_cnt~0 0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, 95#L864true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), 229#true, Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, 59#P0EXITtrue, P3Thread1of1ForFork3InUse, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,701 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 15:49:21,701 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 15:49:21,701 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 15:49:21,701 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 15:49:21,701 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([980] L829-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_113 (+ v_~__unbuffered_cnt~0_114 1)) (= |v_P3Thread1of1ForFork3_#res.offset_19| 0) (= |v_P3Thread1of1ForFork3_#res.base_19| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_114} OutVars{P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_113, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_19|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset][4], [P0Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse, 8#P1EXITtrue, Black: 196#(and (not (= ~z$w_buff0~0 ~z~0)) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z$r_buff0_thd3~0 0) (not (= ~z$w_buff1~0 ~z$w_buff0~0)) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), Black: 140#(= ~__unbuffered_p3_EAX~0 0), Black: 204#(= ~__unbuffered_cnt~0 0), Black: 205#(= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0), Black: 207#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~__unbuffered_cnt~0 0)), 212#true, Black: 148#(= ~y~0 0), 151#true, 95#L864true, Black: 154#(and (= ~z$w_buff1~0 0) (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0)), Black: 215#(and (= ~z$w_buff0_used~0 1) (= ~z$r_buff0_thd4~0 1) (= ~__unbuffered_cnt~0 0)), Black: 216#(and (= ~z$w_buff0_used~0 0) (= ~__unbuffered_cnt~0 0)), Black: 217#(and (not (= 4 ~__unbuffered_cnt~0)) (= ~z$w_buff0_used~0 0)), Black: 218#(and (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 222#(and (not (= 4 ~__unbuffered_cnt~0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~z$w_buff0_used~0 0)), Black: 164#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), 231#(= ~y~0 1), 108#P3EXITtrue, Black: 171#(and (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$w_buff0_used~0 0)), Black: 172#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff1_used~0 0) (= ~z~0 1) (= ~z$r_buff0_thd3~0 0) (= ~z$r_buff1_thd0~0 0)), 50#P2EXITtrue, 59#P0EXITtrue, Black: 182#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), P3Thread1of1ForFork3InUse, Black: 183#(and (= ~z$r_buff0_thd0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), P1Thread1of1ForFork1InUse]) [2021-06-11 15:49:21,702 INFO L384 tUnfolder$Statistics]: this new event has 24 ancestors and is cut-off event [2021-06-11 15:49:21,702 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 15:49:21,702 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 15:49:21,702 INFO L387 tUnfolder$Statistics]: existing Event has 24 ancestors and is cut-off event [2021-06-11 15:49:21,703 INFO L129 PetriNetUnfolder]: 794/1517 cut-off events. [2021-06-11 15:49:21,703 INFO L130 PetriNetUnfolder]: For 6268/6565 co-relation queries the response was YES. [2021-06-11 15:49:21,710 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6974 conditions, 1517 events. 794/1517 cut-off events. For 6268/6565 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 11067 event pairs, 161 based on Foata normal form. 16/1430 useless extension candidates. Maximal degree in co-relation 6943. Up to 849 conditions per place. [2021-06-11 15:49:21,723 INFO L151 LiptonReduction]: Number of co-enabled transitions 1078 [2021-06-11 15:49:21,733 INFO L163 LiptonReduction]: Checked pairs total: 1110 [2021-06-11 15:49:21,734 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:21,734 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 151 [2021-06-11 15:49:21,736 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 87 transitions, 733 flow [2021-06-11 15:49:21,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:21,736 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:21,736 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:21,736 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 15:49:21,736 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 15:49:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:21,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1662130376, now seen corresponding path program 1 times [2021-06-11 15:49:21,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:21,737 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955265260] [2021-06-11 15:49:21,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:21,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:21,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:21,798 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 15:49:21,798 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:49:21,801 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:21,801 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:21,804 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:21,804 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:21,804 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 15:49:21,804 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955265260] [2021-06-11 15:49:21,804 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:21,805 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:49:21,805 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045707763] [2021-06-11 15:49:21,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:49:21,805 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:21,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:49:21,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:49:21,806 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:49:21,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 87 transitions, 733 flow. Second operand has 5 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 15:49:21,807 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:21,807 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:49:21,807 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:21,998 INFO L129 PetriNetUnfolder]: 626/1330 cut-off events. [2021-06-11 15:49:21,998 INFO L130 PetriNetUnfolder]: For 6669/7036 co-relation queries the response was YES. [2021-06-11 15:49:22,004 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6932 conditions, 1330 events. 626/1330 cut-off events. For 6669/7036 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 10334 event pairs, 65 based on Foata normal form. 160/1431 useless extension candidates. Maximal degree in co-relation 6899. Up to 746 conditions per place. [2021-06-11 15:49:22,009 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 11 selfloop transitions, 35 changer transitions 3/100 dead transitions. [2021-06-11 15:49:22,009 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 100 transitions, 953 flow [2021-06-11 15:49:22,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:49:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:49:22,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1290 transitions. [2021-06-11 15:49:22,011 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8338720103425986 [2021-06-11 15:49:22,011 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1290 transitions. [2021-06-11 15:49:22,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1290 transitions. [2021-06-11 15:49:22,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:22,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1290 transitions. [2021-06-11 15:49:22,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.28571428571428) internal successors, (1290), 7 states have internal predecessors, (1290), 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 15:49:22,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 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 15:49:22,016 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 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 15:49:22,016 INFO L185 Difference]: Start difference. First operand has 76 places, 87 transitions, 733 flow. Second operand 7 states and 1290 transitions. [2021-06-11 15:49:22,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 100 transitions, 953 flow [2021-06-11 15:49:22,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 100 transitions, 948 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 15:49:22,029 INFO L241 Difference]: Finished difference. Result has 84 places, 93 transitions, 919 flow [2021-06-11 15:49:22,030 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=919, PETRI_PLACES=84, PETRI_TRANSITIONS=93} [2021-06-11 15:49:22,030 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 40 predicate places. [2021-06-11 15:49:22,030 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:22,030 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 93 transitions, 919 flow [2021-06-11 15:49:22,030 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 93 transitions, 919 flow [2021-06-11 15:49:22,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 93 transitions, 919 flow [2021-06-11 15:49:22,126 INFO L129 PetriNetUnfolder]: 549/1192 cut-off events. [2021-06-11 15:49:22,126 INFO L130 PetriNetUnfolder]: For 7627/8069 co-relation queries the response was YES. [2021-06-11 15:49:22,132 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 1192 events. 549/1192 cut-off events. For 7627/8069 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 9255 event pairs, 59 based on Foata normal form. 46/1179 useless extension candidates. Maximal degree in co-relation 6927. Up to 669 conditions per place. [2021-06-11 15:49:22,142 INFO L151 LiptonReduction]: Number of co-enabled transitions 1260 [2021-06-11 15:49:22,155 INFO L163 LiptonReduction]: Checked pairs total: 1381 [2021-06-11 15:49:22,155 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:22,155 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 125 [2021-06-11 15:49:22,156 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 93 transitions, 919 flow [2021-06-11 15:49:22,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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 15:49:22,156 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:22,156 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:22,156 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 15:49:22,156 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 15:49:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1511179600, now seen corresponding path program 1 times [2021-06-11 15:49:22,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:22,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583180337] [2021-06-11 15:49:22,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:22,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:22,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:22,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:22,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:22,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:22,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:22,189 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 15:49:22,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583180337] [2021-06-11 15:49:22,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:22,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:49:22,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094057011] [2021-06-11 15:49:22,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:49:22,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:22,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:49:22,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:49:22,191 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 221 [2021-06-11 15:49:22,191 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 93 transitions, 919 flow. Second operand has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 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 15:49:22,191 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:22,191 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 221 [2021-06-11 15:49:22,191 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:22,412 INFO L129 PetriNetUnfolder]: 1117/2321 cut-off events. [2021-06-11 15:49:22,412 INFO L130 PetriNetUnfolder]: For 14928/15534 co-relation queries the response was YES. [2021-06-11 15:49:22,424 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13667 conditions, 2321 events. 1117/2321 cut-off events. For 14928/15534 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 19738 event pairs, 123 based on Foata normal form. 80/2266 useless extension candidates. Maximal degree in co-relation 13630. Up to 1362 conditions per place. [2021-06-11 15:49:22,431 INFO L132 encePairwiseOnDemand]: 218/221 looper letters, 4 selfloop transitions, 2 changer transitions 11/95 dead transitions. [2021-06-11 15:49:22,431 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 95 transitions, 947 flow [2021-06-11 15:49:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:49:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:49:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 763 transitions. [2021-06-11 15:49:22,433 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631221719457014 [2021-06-11 15:49:22,433 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 763 transitions. [2021-06-11 15:49:22,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 763 transitions. [2021-06-11 15:49:22,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:22,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 763 transitions. [2021-06-11 15:49:22,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 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 15:49:22,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 15:49:22,445 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 15:49:22,446 INFO L185 Difference]: Start difference. First operand has 84 places, 93 transitions, 919 flow. Second operand 4 states and 763 transitions. [2021-06-11 15:49:22,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 95 transitions, 947 flow [2021-06-11 15:49:22,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 95 transitions, 868 flow, removed 25 selfloop flow, removed 3 redundant places. [2021-06-11 15:49:22,537 INFO L241 Difference]: Finished difference. Result has 86 places, 83 transitions, 719 flow [2021-06-11 15:49:22,537 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=719, PETRI_PLACES=86, PETRI_TRANSITIONS=83} [2021-06-11 15:49:22,537 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 42 predicate places. [2021-06-11 15:49:22,537 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:22,537 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 83 transitions, 719 flow [2021-06-11 15:49:22,537 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 83 transitions, 719 flow [2021-06-11 15:49:22,538 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 83 transitions, 719 flow [2021-06-11 15:49:22,719 INFO L129 PetriNetUnfolder]: 916/1881 cut-off events. [2021-06-11 15:49:22,720 INFO L130 PetriNetUnfolder]: For 11146/11726 co-relation queries the response was YES. [2021-06-11 15:49:22,729 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10416 conditions, 1881 events. 916/1881 cut-off events. For 11146/11726 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 15260 event pairs, 111 based on Foata normal form. 80/1834 useless extension candidates. Maximal degree in co-relation 10380. Up to 1072 conditions per place. [2021-06-11 15:49:22,749 INFO L151 LiptonReduction]: Number of co-enabled transitions 1232 [2021-06-11 15:49:22,763 INFO L163 LiptonReduction]: Checked pairs total: 824 [2021-06-11 15:49:22,763 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:22,763 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 226 [2021-06-11 15:49:22,764 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 83 transitions, 719 flow [2021-06-11 15:49:22,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 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 15:49:22,765 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:22,765 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:22,765 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 15:49:22,765 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 15:49:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:22,765 INFO L82 PathProgramCache]: Analyzing trace with hash 274074400, now seen corresponding path program 1 times [2021-06-11 15:49:22,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:22,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485379393] [2021-06-11 15:49:22,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:22,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:22,793 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:22,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:22,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:22,796 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:22,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:22,799 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 15:49:22,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485379393] [2021-06-11 15:49:22,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:22,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:49:22,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573477474] [2021-06-11 15:49:22,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:49:22,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:22,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:49:22,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:49:22,801 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 221 [2021-06-11 15:49:22,801 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 83 transitions, 719 flow. Second operand has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:22,801 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:22,801 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 221 [2021-06-11 15:49:22,801 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:23,148 INFO L129 PetriNetUnfolder]: 1846/3705 cut-off events. [2021-06-11 15:49:23,149 INFO L130 PetriNetUnfolder]: For 22763/23784 co-relation queries the response was YES. [2021-06-11 15:49:23,169 INFO L84 FinitePrefix]: Finished finitePrefix Result has 20887 conditions, 3705 events. 1846/3705 cut-off events. For 22763/23784 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 33244 event pairs, 240 based on Foata normal form. 176/3577 useless extension candidates. Maximal degree in co-relation 20849. Up to 2231 conditions per place. [2021-06-11 15:49:23,182 INFO L132 encePairwiseOnDemand]: 218/221 looper letters, 4 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2021-06-11 15:49:23,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 85 transitions, 749 flow [2021-06-11 15:49:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:49:23,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:49:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 759 transitions. [2021-06-11 15:49:23,185 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8585972850678733 [2021-06-11 15:49:23,185 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 759 transitions. [2021-06-11 15:49:23,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 759 transitions. [2021-06-11 15:49:23,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:23,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 759 transitions. [2021-06-11 15:49:23,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 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 15:49:23,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 15:49:23,187 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 15:49:23,187 INFO L185 Difference]: Start difference. First operand has 86 places, 83 transitions, 719 flow. Second operand 4 states and 759 transitions. [2021-06-11 15:49:23,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 85 transitions, 749 flow [2021-06-11 15:49:23,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 85 transitions, 719 flow, removed 11 selfloop flow, removed 3 redundant places. [2021-06-11 15:49:23,296 INFO L241 Difference]: Finished difference. Result has 88 places, 84 transitions, 702 flow [2021-06-11 15:49:23,296 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=702, PETRI_PLACES=88, PETRI_TRANSITIONS=84} [2021-06-11 15:49:23,296 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2021-06-11 15:49:23,296 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:23,296 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 84 transitions, 702 flow [2021-06-11 15:49:23,296 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 84 transitions, 702 flow [2021-06-11 15:49:23,297 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 702 flow [2021-06-11 15:49:23,590 INFO L129 PetriNetUnfolder]: 1752/3541 cut-off events. [2021-06-11 15:49:23,591 INFO L130 PetriNetUnfolder]: For 14006/15019 co-relation queries the response was YES. [2021-06-11 15:49:23,606 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16462 conditions, 3541 events. 1752/3541 cut-off events. For 14006/15019 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 31883 event pairs, 221 based on Foata normal form. 129/3351 useless extension candidates. Maximal degree in co-relation 16425. Up to 2071 conditions per place. [2021-06-11 15:49:23,637 INFO L151 LiptonReduction]: Number of co-enabled transitions 1318 [2021-06-11 15:49:23,643 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:49:23,643 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:23,643 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 347 [2021-06-11 15:49:23,644 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 84 transitions, 702 flow [2021-06-11 15:49:23,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:23,644 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:23,644 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:23,644 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 15:49:23,644 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 15:49:23,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:23,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1733767322, now seen corresponding path program 2 times [2021-06-11 15:49:23,645 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:23,645 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817539233] [2021-06-11 15:49:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:23,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:23,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:23,687 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:23,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:23,690 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 15:49:23,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:49:23,694 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:23,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:23,698 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:23,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:23,699 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 15:49:23,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817539233] [2021-06-11 15:49:23,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:23,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:49:23,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803137974] [2021-06-11 15:49:23,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:49:23,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:23,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:49:23,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:49:23,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:49:23,701 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 84 transitions, 702 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:23,701 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:23,701 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:49:23,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:24,051 INFO L129 PetriNetUnfolder]: 1453/3152 cut-off events. [2021-06-11 15:49:24,051 INFO L130 PetriNetUnfolder]: For 14992/17220 co-relation queries the response was YES. [2021-06-11 15:49:24,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16929 conditions, 3152 events. 1453/3152 cut-off events. For 14992/17220 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 29236 event pairs, 17 based on Foata normal form. 1093/4004 useless extension candidates. Maximal degree in co-relation 16890. Up to 1964 conditions per place. [2021-06-11 15:49:24,074 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 6 selfloop transitions, 42 changer transitions 4/97 dead transitions. [2021-06-11 15:49:24,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 97 transitions, 932 flow [2021-06-11 15:49:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:49:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:49:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1658 transitions. [2021-06-11 15:49:24,077 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8335847159376572 [2021-06-11 15:49:24,077 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1658 transitions. [2021-06-11 15:49:24,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1658 transitions. [2021-06-11 15:49:24,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:24,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1658 transitions. [2021-06-11 15:49:24,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 184.22222222222223) internal successors, (1658), 9 states have internal predecessors, (1658), 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 15:49:24,082 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 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 15:49:24,082 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 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 15:49:24,082 INFO L185 Difference]: Start difference. First operand has 88 places, 84 transitions, 702 flow. Second operand 9 states and 1658 transitions. [2021-06-11 15:49:24,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 97 transitions, 932 flow [2021-06-11 15:49:24,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 97 transitions, 929 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 15:49:24,147 INFO L241 Difference]: Finished difference. Result has 98 places, 93 transitions, 912 flow [2021-06-11 15:49:24,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=912, PETRI_PLACES=98, PETRI_TRANSITIONS=93} [2021-06-11 15:49:24,147 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2021-06-11 15:49:24,147 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:24,148 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 912 flow [2021-06-11 15:49:24,148 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 912 flow [2021-06-11 15:49:24,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 912 flow [2021-06-11 15:49:24,411 INFO L129 PetriNetUnfolder]: 1443/3126 cut-off events. [2021-06-11 15:49:24,411 INFO L130 PetriNetUnfolder]: For 18722/19825 co-relation queries the response was YES. [2021-06-11 15:49:24,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18062 conditions, 3126 events. 1443/3126 cut-off events. For 18722/19825 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 29114 event pairs, 18 based on Foata normal form. 22/2873 useless extension candidates. Maximal degree in co-relation 18021. Up to 1971 conditions per place. [2021-06-11 15:49:24,455 INFO L151 LiptonReduction]: Number of co-enabled transitions 1404 [2021-06-11 15:49:24,461 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:49:24,461 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:49:24,461 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 314 [2021-06-11 15:49:24,463 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 93 transitions, 912 flow [2021-06-11 15:49:24,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:49:24,464 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:24,464 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 15:49:24,464 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-06-11 15:49:24,464 INFO L428 AbstractCegarLoop]: === Iteration 16 === [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 15:49:24,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:24,464 INFO L82 PathProgramCache]: Analyzing trace with hash 465164676, now seen corresponding path program 1 times [2021-06-11 15:49:24,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:24,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421343246] [2021-06-11 15:49:24,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:49:24,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:24,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:24,524 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:24,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:24,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:24,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:24,533 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 15:49:24,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:49:24,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:24,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:49:24,542 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:24,542 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:24,542 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 15:49:24,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421343246] [2021-06-11 15:49:24,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:49:24,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:49:24,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793071112] [2021-06-11 15:49:24,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:49:24,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:49:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:49:24,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:49:24,546 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:49:24,546 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 93 transitions, 912 flow. Second operand has 7 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 15:49:24,546 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:49:24,546 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:49:24,546 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:49:24,885 INFO L129 PetriNetUnfolder]: 1287/2863 cut-off events. [2021-06-11 15:49:24,885 INFO L130 PetriNetUnfolder]: For 20789/22944 co-relation queries the response was YES. [2021-06-11 15:49:24,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18703 conditions, 2863 events. 1287/2863 cut-off events. For 20789/22944 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 26943 event pairs, 0 based on Foata normal form. 776/3404 useless extension candidates. Maximal degree in co-relation 18660. Up to 1783 conditions per place. [2021-06-11 15:49:24,905 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 2 selfloop transitions, 43 changer transitions 25/98 dead transitions. [2021-06-11 15:49:24,905 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 98 transitions, 1074 flow [2021-06-11 15:49:24,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 15:49:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 15:49:24,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2019 transitions. [2021-06-11 15:49:24,908 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8305224187577128 [2021-06-11 15:49:24,908 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2019 transitions. [2021-06-11 15:49:24,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2019 transitions. [2021-06-11 15:49:24,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:49:24,909 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2019 transitions. [2021-06-11 15:49:24,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 183.54545454545453) internal successors, (2019), 11 states have internal predecessors, (2019), 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 15:49:24,915 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 221.0) internal successors, (2652), 12 states have internal predecessors, (2652), 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 15:49:24,916 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 221.0) internal successors, (2652), 12 states have internal predecessors, (2652), 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 15:49:24,916 INFO L185 Difference]: Start difference. First operand has 98 places, 93 transitions, 912 flow. Second operand 11 states and 2019 transitions. [2021-06-11 15:49:24,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 98 transitions, 1074 flow [2021-06-11 15:49:25,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 919 flow, removed 40 selfloop flow, removed 6 redundant places. [2021-06-11 15:49:25,157 INFO L241 Difference]: Finished difference. Result has 105 places, 73 transitions, 679 flow [2021-06-11 15:49:25,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=679, PETRI_PLACES=105, PETRI_TRANSITIONS=73} [2021-06-11 15:49:25,158 INFO L343 CegarLoopForPetriNet]: 44 programPoint places, 61 predicate places. [2021-06-11 15:49:25,158 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:49:25,158 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 73 transitions, 679 flow [2021-06-11 15:49:25,158 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 73 transitions, 679 flow [2021-06-11 15:49:25,159 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 73 transitions, 679 flow [2021-06-11 15:49:25,201 INFO L129 PetriNetUnfolder]: 254/702 cut-off events. [2021-06-11 15:49:25,201 INFO L130 PetriNetUnfolder]: For 2565/2895 co-relation queries the response was YES. [2021-06-11 15:49:25,203 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3512 conditions, 702 events. 254/702 cut-off events. For 2565/2895 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5528 event pairs, 0 based on Foata normal form. 5/660 useless extension candidates. Maximal degree in co-relation 3475. Up to 190 conditions per place. [2021-06-11 15:49:25,208 INFO L151 LiptonReduction]: Number of co-enabled transitions 816 [2021-06-11 15:49:25,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:25,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:25,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:49:25,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:49:25,281 INFO L163 LiptonReduction]: Checked pairs total: 147 [2021-06-11 15:49:25,281 INFO L165 LiptonReduction]: Total number of compositions: 3 [2021-06-11 15:49:25,281 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 123 [2021-06-11 15:49:25,282 INFO L480 AbstractCegarLoop]: Abstraction has has 96 places, 71 transitions, 677 flow [2021-06-11 15:49:25,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 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 15:49:25,282 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:49:25,282 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:49:25,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-11 15:49:25,283 INFO L428 AbstractCegarLoop]: === Iteration 17 === [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 15:49:25,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:49:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash -264808303, now seen corresponding path program 1 times [2021-06-11 15:49:25,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:49:25,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693861303] [2021-06-11 15:49:25,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:49:25,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:49:25,324 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:49:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:49:25,348 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:49:25,377 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:49:25,377 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:49:25,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-11 15:49:25,464 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:49:25 BasicIcfg [2021-06-11 15:49:25,465 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:49:25,465 INFO L168 Benchmark]: Toolchain (without parser) took 22854.22 ms. Allocated memory was 383.8 MB in the beginning and 813.7 MB in the end (delta: 429.9 MB). Free memory was 346.7 MB in the beginning and 742.5 MB in the end (delta: -395.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:25,465 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 383.8 MB. Free memory is still 364.3 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:49:25,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 403.10 ms. Allocated memory is still 383.8 MB. Free memory was 346.5 MB in the beginning and 343.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:25,465 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.05 ms. Allocated memory is still 383.8 MB. Free memory was 343.6 MB in the beginning and 340.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:25,465 INFO L168 Benchmark]: Boogie Preprocessor took 48.69 ms. Allocated memory is still 383.8 MB. Free memory was 340.5 MB in the beginning and 338.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:25,465 INFO L168 Benchmark]: RCFGBuilder took 1394.50 ms. Allocated memory is still 383.8 MB. Free memory was 338.4 MB in the beginning and 278.1 MB in the end (delta: 60.4 MB). Peak memory consumption was 128.5 MB. Max. memory is 16.0 GB. [2021-06-11 15:49:25,466 INFO L168 Benchmark]: TraceAbstraction took 20942.32 ms. Allocated memory was 383.8 MB in the beginning and 813.7 MB in the end (delta: 429.9 MB). Free memory was 278.1 MB in the beginning and 742.5 MB in the end (delta: -464.4 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:49:25,466 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.36 ms. Allocated memory is still 383.8 MB. Free memory is still 364.3 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 403.10 ms. Allocated memory is still 383.8 MB. Free memory was 346.5 MB in the beginning and 343.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 57.05 ms. Allocated memory is still 383.8 MB. Free memory was 343.6 MB in the beginning and 340.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 48.69 ms. Allocated memory is still 383.8 MB. Free memory was 340.5 MB in the beginning and 338.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1394.50 ms. Allocated memory is still 383.8 MB. Free memory was 338.4 MB in the beginning and 278.1 MB in the end (delta: 60.4 MB). Peak memory consumption was 128.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20942.32 ms. Allocated memory was 383.8 MB in the beginning and 813.7 MB in the end (delta: 429.9 MB). Free memory was 278.1 MB in the beginning and 742.5 MB in the end (delta: -464.4 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5565.4ms, 124 PlacesBefore, 44 PlacesAfterwards, 113 TransitionsBefore, 32 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 101 TotalNumberOfCompositions, 7147 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3446, positive: 3244, positive conditional: 3244, positive unconditional: 0, negative: 202, negative conditional: 202, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3446, positive: 3244, positive conditional: 0, positive unconditional: 3244, negative: 202, negative conditional: 0, negative unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3446, positive: 3244, positive conditional: 0, positive unconditional: 3244, negative: 202, negative conditional: 0, negative unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2112, positive: 2064, positive conditional: 0, positive unconditional: 2064, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2112, positive: 2033, positive conditional: 0, positive unconditional: 2033, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 630, positive: 57, positive conditional: 0, positive unconditional: 57, negative: 573, negative conditional: 0, negative unconditional: 573, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3446, positive: 1180, positive conditional: 0, positive unconditional: 1180, negative: 154, negative conditional: 0, negative unconditional: 154, unknown: 2112, unknown conditional: 0, unknown unconditional: 2112] , Statistics on independence cache: Total cache size (in pairs): 2112, Positive cache size: 2064, Positive conditional cache size: 0, Positive unconditional cache size: 2064, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8579.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: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 245, positive: 193, positive conditional: 193, positive unconditional: 0, negative: 52, negative conditional: 52, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 245, positive: 193, positive conditional: 4, positive unconditional: 189, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 245, positive: 193, positive conditional: 4, positive unconditional: 189, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 97, positive: 79, positive conditional: 3, positive unconditional: 76, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 97, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 19, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 436, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 422, negative conditional: 0, negative unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 245, positive: 114, positive conditional: 1, positive unconditional: 113, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 97, unknown conditional: 3, unknown unconditional: 94] , Statistics on independence cache: Total cache size (in pairs): 2209, Positive cache size: 2143, Positive conditional cache size: 3, Positive unconditional cache size: 2140, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 202.6ms, 42 PlacesBefore, 37 PlacesAfterwards, 26 TransitionsBefore, 25 TransitionsAfterwards, 328 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 713 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 332, positive: 289, positive conditional: 289, positive unconditional: 0, negative: 43, negative conditional: 43, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 332, positive: 289, positive conditional: 0, positive unconditional: 289, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 332, positive: 289, positive conditional: 0, positive unconditional: 289, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 30, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 30, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 59, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 332, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 30, unknown conditional: 0, unknown unconditional: 30] , Statistics on independence cache: Total cache size (in pairs): 2239, Positive cache size: 2168, Positive conditional cache size: 3, Positive unconditional cache size: 2165, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 342 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 292 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 89, positive conditional: 0, positive unconditional: 89, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2241, Positive cache size: 2170, Positive conditional cache size: 3, Positive unconditional cache size: 2167, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.7ms, 42 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 268 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 83, positive: 70, positive conditional: 70, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 83, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 83, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 83, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 2249, Positive cache size: 2175, Positive conditional cache size: 3, Positive unconditional cache size: 2172, Negative cache size: 74, Negative conditional cache size: 0, Negative unconditional cache size: 74, Eliminated conditions: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 48.4ms, 46 PlacesBefore, 46 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 271 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 59, positive conditional: 59, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 71, positive: 59, positive conditional: 2, positive unconditional: 57, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 59, positive conditional: 2, positive unconditional: 57, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 39, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 59, positive conditional: 2, positive unconditional: 57, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2251, Positive cache size: 2175, Positive conditional cache size: 3, Positive unconditional cache size: 2172, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.8ms, 50 PlacesBefore, 50 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 317 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, positive: 74, positive conditional: 24, positive unconditional: 50, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 74, positive conditional: 24, positive unconditional: 50, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 87, positive: 73, positive conditional: 24, positive unconditional: 49, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2252, Positive cache size: 2176, Positive conditional cache size: 3, Positive unconditional cache size: 2173, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.6ms, 56 PlacesBefore, 56 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 384 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, positive: 111, positive conditional: 111, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, positive: 111, positive conditional: 42, positive unconditional: 69, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 111, positive conditional: 42, positive unconditional: 69, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 126, positive: 111, positive conditional: 42, positive unconditional: 69, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2252, Positive cache size: 2176, Positive conditional cache size: 3, Positive unconditional cache size: 2173, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.7ms, 58 PlacesBefore, 58 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 554 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 377 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 134, positive: 119, positive conditional: 119, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 134, positive: 119, positive conditional: 32, positive unconditional: 87, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 134, positive: 119, positive conditional: 32, positive unconditional: 87, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, 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: 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: 134, positive: 118, positive conditional: 31, positive unconditional: 87, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2253, Positive cache size: 2177, Positive conditional cache size: 4, Positive unconditional cache size: 2173, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.1ms, 61 PlacesBefore, 61 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 844 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 454 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 146, positive: 132, positive conditional: 132, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 146, positive: 132, positive conditional: 76, positive unconditional: 56, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 146, positive: 132, positive conditional: 76, positive unconditional: 56, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, 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: 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: 146, positive: 129, positive conditional: 74, positive unconditional: 55, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2256, Positive cache size: 2180, Positive conditional cache size: 6, Positive unconditional cache size: 2174, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 141.8ms, 73 PlacesBefore, 73 PlacesAfterwards, 96 TransitionsBefore, 96 TransitionsAfterwards, 1178 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1372 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 364, positive: 339, positive conditional: 339, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 364, positive: 339, positive conditional: 205, positive unconditional: 134, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 364, positive: 339, positive conditional: 205, positive unconditional: 134, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 4, positive unconditional: 5, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 364, positive: 330, positive conditional: 201, positive unconditional: 129, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 9, unknown conditional: 4, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 2265, Positive cache size: 2189, Positive conditional cache size: 10, Positive unconditional cache size: 2179, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 149.9ms, 76 PlacesBefore, 76 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 1078 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1110 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, positive: 321, positive conditional: 321, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, positive: 321, positive conditional: 176, positive unconditional: 145, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, positive: 321, positive conditional: 176, positive unconditional: 145, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 344, positive: 321, positive conditional: 176, positive unconditional: 145, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2265, Positive cache size: 2189, Positive conditional cache size: 10, Positive unconditional cache size: 2179, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 125.0ms, 84 PlacesBefore, 84 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1381 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 344, positive: 319, positive conditional: 319, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 344, positive: 319, positive conditional: 196, positive unconditional: 123, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 344, positive: 319, positive conditional: 196, positive unconditional: 123, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 344, positive: 317, positive conditional: 196, positive unconditional: 121, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2267, Positive cache size: 2191, Positive conditional cache size: 10, Positive unconditional cache size: 2181, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 225.9ms, 86 PlacesBefore, 86 PlacesAfterwards, 83 TransitionsBefore, 83 TransitionsAfterwards, 1232 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 824 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 218, positive: 206, positive conditional: 206, positive unconditional: 0, negative: 12, negative conditional: 12, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 218, positive: 206, positive conditional: 144, positive unconditional: 62, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 218, positive: 206, positive conditional: 144, positive unconditional: 62, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.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: 218, positive: 206, positive conditional: 144, positive unconditional: 62, 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): 2267, Positive cache size: 2191, Positive conditional cache size: 10, Positive unconditional cache size: 2181, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 346.9ms, 88 PlacesBefore, 88 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 1318 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 2267, Positive cache size: 2191, Positive conditional cache size: 10, Positive unconditional cache size: 2181, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 313.3ms, 98 PlacesBefore, 98 PlacesAfterwards, 93 TransitionsBefore, 93 TransitionsAfterwards, 1404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: 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: 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): 2267, Positive cache size: 2191, Positive conditional cache size: 10, Positive unconditional cache size: 2181, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.1ms, 105 PlacesBefore, 96 PlacesAfterwards, 73 TransitionsBefore, 71 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 147 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 147, positive: 147, positive conditional: 147, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 147, positive: 147, positive conditional: 110, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 147, positive: 147, positive conditional: 110, positive unconditional: 37, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 147, positive: 145, positive conditional: 110, positive unconditional: 35, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2269, Positive cache size: 2193, Positive conditional cache size: 10, Positive unconditional cache size: 2183, Negative cache size: 76, Negative conditional cache size: 0, Negative unconditional cache size: 76, Eliminated conditions: 8 - 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1237; [L847] FCALL, FORK 0 pthread_create(&t1237, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=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] [L848] 0 pthread_t t1238; [L849] FCALL, FORK 0 pthread_create(&t1238, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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] [L850] 0 pthread_t t1239; [L851] FCALL, FORK 0 pthread_create(&t1239, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L852] 0 pthread_t t1240; [L853] FCALL, FORK 0 pthread_create(&t1240, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=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] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 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) [L824] 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) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 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 [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 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 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] 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) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] 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) [L859] 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) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 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 [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 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 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)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_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, 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=2, 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: 20783.1ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3280.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 5621.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 61 SDtfs, 45 SDslu, 28 SDs, 0 SdLazy, 447 SolverSat, 129 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 380.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 438.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=919occurred in iteration=12, InterpolantAutomatonStates: 87, 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: 42.1ms SsaConstructionTime, 379.3ms SatisfiabilityAnalysisTime, 832.3ms InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 1299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...