/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/mix057_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:53:11,661 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:53:11,664 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:53:11,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:53:11,710 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:53:11,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:53:11,716 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:53:11,722 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:53:11,724 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:53:11,729 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:53:11,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:53:11,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:53:11,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:53:11,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:53:11,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:53:11,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:53:11,740 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:53:11,741 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:53:11,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:53:11,750 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:53:11,751 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:53:11,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:53:11,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:53:11,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:53:11,758 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:53:11,758 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:53:11,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:53:11,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:53:11,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:53:11,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:53:11,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:53:11,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:53:11,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:53:11,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:53:11,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:53:11,764 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:53:11,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:53:11,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:53:11,765 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:53:11,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:53:11,766 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:53:11,770 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:53:11,802 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:53:11,802 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:53:11,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:53:11,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:53:11,805 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:53:11,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:53:11,806 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:53:11,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:53:11,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:53:11,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:53:11,807 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:53:11,807 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:53:11,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:53:11,807 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:53:11,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:53:11,807 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:53:11,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:53:11,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:53:11,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:53:11,808 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:53:11,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:53:11,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:53:11,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:53:11,808 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:53:11,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:53:11,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:53:11,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:53:11,809 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:53:11,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:53:11,809 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:53:11,809 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:53:12,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:53:12,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:53:12,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:53:12,139 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:53:12,140 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:53:12,141 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2021-06-11 15:53:12,204 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d4ea540/5bf7cbedee01452caa25b8979fd0f5b8/FLAG02e20f99c [2021-06-11 15:53:12,804 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:53:12,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_pso.opt.i [2021-06-11 15:53:12,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d4ea540/5bf7cbedee01452caa25b8979fd0f5b8/FLAG02e20f99c [2021-06-11 15:53:13,185 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72d4ea540/5bf7cbedee01452caa25b8979fd0f5b8 [2021-06-11 15:53:13,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:53:13,189 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:53:13,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:53:13,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:53:13,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:53:13,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3785d5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13, skipping insertion in model container [2021-06-11 15:53:13,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,202 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:53:13,240 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:53:13,401 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/mix057_pso.opt.i[948,961] [2021-06-11 15:53:13,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:53:13,587 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:53:13,600 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/mix057_pso.opt.i[948,961] [2021-06-11 15:53:13,635 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:53:13,691 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:53:13,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13 WrapperNode [2021-06-11 15:53:13,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:53:13,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:53:13,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:53:13,693 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:53:13,699 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:53:13" (1/1) ... [2021-06-11 15:53:13,713 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:53:13" (1/1) ... [2021-06-11 15:53:13,753 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:53:13,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:53:13,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:53:13,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:53:13,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,783 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (1/1) ... [2021-06-11 15:53:13,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:53:13,800 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:53:13,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:53:13,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:53:13,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (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:53:13,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:53:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:53:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:53:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:53:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:53:13,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:53:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:53:13,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:53:13,869 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:53:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:53:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 15:53:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 15:53:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:53:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:53:13,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:53:13,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:53:13,872 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:53:15,496 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:53:15,496 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:53:15,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:53:15 BoogieIcfgContainer [2021-06-11 15:53:15,498 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:53:15,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:53:15,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:53:15,502 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:53:15,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:53:13" (1/3) ... [2021-06-11 15:53:15,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7565ccf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:53:15, skipping insertion in model container [2021-06-11 15:53:15,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:53:13" (2/3) ... [2021-06-11 15:53:15,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7565ccf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:53:15, skipping insertion in model container [2021-06-11 15:53:15,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:53:15" (3/3) ... [2021-06-11 15:53:15,505 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_pso.opt.i [2021-06-11 15:53:15,511 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:53:15,515 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:53:15,515 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:53:15,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,551 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,552 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,552 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,555 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,558 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,559 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,560 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,560 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,560 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,561 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,561 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,561 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,562 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,562 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,563 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,564 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,565 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,572 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,574 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,574 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,574 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,576 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,577 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,577 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,578 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,578 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,579 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,579 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,580 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,580 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,581 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,581 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:53:15,582 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:53:15,597 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 15:53:15,614 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:53:15,614 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:53:15,614 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:53:15,614 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:53:15,614 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:53:15,614 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:53:15,615 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:53:15,615 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:53:15,624 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2021-06-11 15:53:15,658 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-06-11 15:53:15,659 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:53:15,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-06-11 15:53:15,662 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2021-06-11 15:53:15,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2021-06-11 15:53:15,668 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:15,678 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2021-06-11 15:53:15,681 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2021-06-11 15:53:15,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2021-06-11 15:53:15,701 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-06-11 15:53:15,701 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:53:15,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-06-11 15:53:15,705 INFO L151 LiptonReduction]: Number of co-enabled transitions 2406 [2021-06-11 15:53:15,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:15,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:15,878 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:15,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:15,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:15,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:15,963 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:15,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:15,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:15,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:15,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:15,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:16,002 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:16,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:16,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:16,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:16,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:16,060 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:16,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:16,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:16,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:16,219 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:16,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:16,223 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:16,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:17,011 WARN L205 SmtUtils]: Spent 777.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-06-11 15:53:17,311 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 15:53:18,695 WARN L205 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-06-11 15:53:19,324 WARN L205 SmtUtils]: Spent 626.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-06-11 15:53:19,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,336 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,392 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:19,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:19,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:19,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,559 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:19,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,612 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:19,613 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:19,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,741 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:19,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,937 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:53:19,938 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:53:19,965 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:19,968 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,055 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,190 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:20,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:20,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:20,212 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,282 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:20,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:20,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:20,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,457 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:53:20,459 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,651 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,829 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,855 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,857 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,905 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:20,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:20,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:21,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:21,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:21,112 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:21,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:21,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:21,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:21,262 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:21,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:21,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:21,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:21,514 WARN L205 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 15:53:21,934 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 90 [2021-06-11 15:53:22,116 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-06-11 15:53:22,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,132 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,140 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:53:22,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,146 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,147 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:53:22,147 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:53:22,151 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,157 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 15:53:22,158 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,161 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 15:53:22,164 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 15:53:22,164 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:53:22,167 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,179 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 15:53:22,180 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 15:53:22,181 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:53:22,184 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,189 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 15:53:22,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:22,454 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,456 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,458 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:22,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:22,492 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,493 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:22,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:22,612 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:22,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:22,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:22,763 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,768 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,768 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:22,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:22,836 INFO L142 QuantifierPusher]: treesize reduction 12, result has 98.2 percent of original size [2021-06-11 15:53:22,857 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,859 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,866 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:53:22,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:53:22,874 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 4, 4, 3, 2, 1] term [2021-06-11 15:53:22,875 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:53:22,876 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,878 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2021-06-11 15:53:22,878 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:53:22,880 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,881 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:53:22,881 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:53:22,882 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:53:22,896 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,900 INFO L147 QuantifierPusher]: treesize reduction 29, result has 3.3 percent of original size 1 [2021-06-11 15:53:22,901 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:22,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:22,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:22,908 INFO L142 QuantifierPusher]: treesize reduction 31, result has 73.7 percent of original size [2021-06-11 15:53:22,911 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 15:53:22,920 INFO L147 QuantifierPusher]: treesize reduction 200, result has 55.4 percent of original size 248 [2021-06-11 15:53:23,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:23,101 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:23,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:23,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:23,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,352 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:23,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,354 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:23,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:53:23,356 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:23,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:23,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,357 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:23,358 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,358 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:53:23,359 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:53:23,359 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:23,360 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:53:23,361 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:53:23,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,419 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:53:23,592 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:23,735 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,736 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:23,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:23,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:23,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:24,156 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:24,161 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:24,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:24,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:24,164 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:24,529 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-06-11 15:53:24,662 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-11 15:53:24,960 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-06-11 15:53:25,100 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-06-11 15:53:25,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:25,111 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:53:25,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:25,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:25,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:25,155 INFO L163 LiptonReduction]: Checked pairs total: 6317 [2021-06-11 15:53:25,155 INFO L165 LiptonReduction]: Total number of compositions: 96 [2021-06-11 15:53:25,161 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9494 [2021-06-11 15:53:25,180 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-06-11 15:53:25,180 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:53:25,180 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:25,181 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:53:25,181 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:25,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:25,186 INFO L82 PathProgramCache]: Analyzing trace with hash -84277167, now seen corresponding path program 1 times [2021-06-11 15:53:25,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:25,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751677828] [2021-06-11 15:53:25,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:25,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:25,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:25,439 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:53:25,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751677828] [2021-06-11 15:53:25,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:25,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:53:25,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601809234] [2021-06-11 15:53:25,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:53:25,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:53:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:53:25,461 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 208 [2021-06-11 15:53:25,466 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:53:25,466 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:25,467 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 208 [2021-06-11 15:53:25,467 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:25,529 INFO L129 PetriNetUnfolder]: 16/69 cut-off events. [2021-06-11 15:53:25,529 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:53:25,531 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 69 events. 16/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 221 event pairs, 2 based on Foata normal form. 12/78 useless extension candidates. Maximal degree in co-relation 106. Up to 27 conditions per place. [2021-06-11 15:53:25,532 INFO L132 encePairwiseOnDemand]: 203/208 looper letters, 7 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2021-06-11 15:53:25,532 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 92 flow [2021-06-11 15:53:25,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:53:25,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:53:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2021-06-11 15:53:25,549 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8589743589743589 [2021-06-11 15:53:25,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 536 transitions. [2021-06-11 15:53:25,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 536 transitions. [2021-06-11 15:53:25,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:25,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 536 transitions. [2021-06-11 15:53:25,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 0 states have call successors, (0), 0 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:53:25,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 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:53:25,569 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 0 states have call successors, (0), 0 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:53:25,571 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 74 flow. Second operand 3 states and 536 transitions. [2021-06-11 15:53:25,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 92 flow [2021-06-11 15:53:25,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 15:53:25,575 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2021-06-11 15:53:25,576 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, 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=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2021-06-11 15:53:25,577 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2021-06-11 15:53:25,577 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:25,577 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 28 transitions, 68 flow [2021-06-11 15:53:25,578 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 28 transitions, 68 flow [2021-06-11 15:53:25,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 68 flow [2021-06-11 15:53:25,583 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-06-11 15:53:25,583 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:53:25,583 INFO L84 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 28 events. 0/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 40 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:53:25,584 INFO L151 LiptonReduction]: Number of co-enabled transitions 390 [2021-06-11 15:53:26,286 WARN L205 SmtUtils]: Spent 663.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-06-11 15:53:26,825 WARN L205 SmtUtils]: Spent 536.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2021-06-11 15:53:29,055 WARN L205 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 290 DAG size of output: 288 [2021-06-11 15:53:30,225 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 287 [2021-06-11 15:53:30,243 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:30,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:30,576 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 15:53:30,912 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 15:53:31,573 WARN L205 SmtUtils]: Spent 656.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 15:53:32,214 WARN L205 SmtUtils]: Spent 639.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 15:53:32,545 INFO L163 LiptonReduction]: Checked pairs total: 874 [2021-06-11 15:53:32,546 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:53:32,546 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6969 [2021-06-11 15:53:32,547 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-06-11 15:53:32,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:53:32,547 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:32,547 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:53:32,547 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 15:53:32,547 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:32,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:32,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1857176670, now seen corresponding path program 1 times [2021-06-11 15:53:32,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:32,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638087707] [2021-06-11 15:53:32,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:32,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:32,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:32,648 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:53:32,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:53:32,653 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:53:32,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638087707] [2021-06-11 15:53:32,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:32,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:53:32,653 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954149885] [2021-06-11 15:53:32,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:53:32,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:32,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:53:32,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:53:32,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 210 [2021-06-11 15:53:32,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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:53:32,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:32,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 210 [2021-06-11 15:53:32,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:32,696 INFO L129 PetriNetUnfolder]: 7/46 cut-off events. [2021-06-11 15:53:32,696 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:53:32,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 46 events. 7/46 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 114 event pairs, 1 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 68. Up to 10 conditions per place. [2021-06-11 15:53:32,697 INFO L132 encePairwiseOnDemand]: 205/210 looper letters, 3 selfloop transitions, 3 changer transitions 6/34 dead transitions. [2021-06-11 15:53:32,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 104 flow [2021-06-11 15:53:32,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:53:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:53:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2021-06-11 15:53:32,700 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8219047619047619 [2021-06-11 15:53:32,700 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 863 transitions. [2021-06-11 15:53:32,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 863 transitions. [2021-06-11 15:53:32,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:32,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 863 transitions. [2021-06-11 15:53:32,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.6) internal successors, (863), 5 states have internal predecessors, (863), 0 states have call successors, (0), 0 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:53:32,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:32,706 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:32,706 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 5 states and 863 transitions. [2021-06-11 15:53:32,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 104 flow [2021-06-11 15:53:32,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 34 transitions, 100 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:53:32,707 INFO L241 Difference]: Finished difference. Result has 42 places, 28 transitions, 83 flow [2021-06-11 15:53:32,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2021-06-11 15:53:32,708 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2021-06-11 15:53:32,708 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:32,708 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 28 transitions, 83 flow [2021-06-11 15:53:32,708 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 28 transitions, 83 flow [2021-06-11 15:53:32,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 28 transitions, 83 flow [2021-06-11 15:53:32,713 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-06-11 15:53:32,713 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 15:53:32,714 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 34 events. 3/34 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 53. Up to 10 conditions per place. [2021-06-11 15:53:32,714 INFO L151 LiptonReduction]: Number of co-enabled transitions 376 [2021-06-11 15:53:32,716 INFO L163 LiptonReduction]: Checked pairs total: 338 [2021-06-11 15:53:32,717 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:32,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 15:53:32,718 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 83 flow [2021-06-11 15:53:32,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 170.75) internal successors, (683), 4 states have internal predecessors, (683), 0 states have call successors, (0), 0 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:53:32,718 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:32,718 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:53:32,718 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 15:53:32,719 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:32,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:32,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1857177349, now seen corresponding path program 1 times [2021-06-11 15:53:32,719 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:32,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951774880] [2021-06-11 15:53:32,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:32,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:32,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:32,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:32,827 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:53:32,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951774880] [2021-06-11 15:53:32,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:32,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:53:32,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151277818] [2021-06-11 15:53:32,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:53:32,829 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:32,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:53:32,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:53:32,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 210 [2021-06-11 15:53:32,831 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 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:53:32,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:32,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 210 [2021-06-11 15:53:32,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:32,849 INFO L129 PetriNetUnfolder]: 10/59 cut-off events. [2021-06-11 15:53:32,849 INFO L130 PetriNetUnfolder]: For 16/25 co-relation queries the response was YES. [2021-06-11 15:53:32,850 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 59 events. 10/59 cut-off events. For 16/25 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 181 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 106. Up to 19 conditions per place. [2021-06-11 15:53:32,851 INFO L132 encePairwiseOnDemand]: 206/210 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-06-11 15:53:32,851 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 30 transitions, 99 flow [2021-06-11 15:53:32,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:53:32,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:53:32,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2021-06-11 15:53:32,853 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8634920634920635 [2021-06-11 15:53:32,853 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2021-06-11 15:53:32,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2021-06-11 15:53:32,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:32,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2021-06-11 15:53:32,855 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 0 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:53:32,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:53:32,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:53:32,857 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 83 flow. Second operand 3 states and 544 transitions. [2021-06-11 15:53:32,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 30 transitions, 99 flow [2021-06-11 15:53:32,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 92 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 15:53:32,858 INFO L241 Difference]: Finished difference. Result has 40 places, 30 transitions, 95 flow [2021-06-11 15:53:32,859 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=95, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2021-06-11 15:53:32,859 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2021-06-11 15:53:32,859 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:32,859 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 30 transitions, 95 flow [2021-06-11 15:53:32,859 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 30 transitions, 95 flow [2021-06-11 15:53:32,860 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 95 flow [2021-06-11 15:53:32,865 INFO L129 PetriNetUnfolder]: 7/46 cut-off events. [2021-06-11 15:53:32,865 INFO L130 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2021-06-11 15:53:32,866 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 46 events. 7/46 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 137 event pairs, 3 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 79. Up to 15 conditions per place. [2021-06-11 15:53:32,866 INFO L151 LiptonReduction]: Number of co-enabled transitions 430 [2021-06-11 15:53:32,869 INFO L163 LiptonReduction]: Checked pairs total: 280 [2021-06-11 15:53:32,869 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:32,869 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 15:53:32,870 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 95 flow [2021-06-11 15:53:32,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 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:53:32,870 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:32,870 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:53:32,870 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:53:32,871 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:32,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:32,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1334246578, now seen corresponding path program 1 times [2021-06-11 15:53:32,871 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:32,871 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025141459] [2021-06-11 15:53:32,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:32,928 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:32,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:32,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:32,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:32,932 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:53:32,933 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025141459] [2021-06-11 15:53:32,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:32,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:53:32,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274059770] [2021-06-11 15:53:32,933 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:53:32,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:32,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:53:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:53:32,935 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 210 [2021-06-11 15:53:32,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:53:32,936 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:32,936 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 210 [2021-06-11 15:53:32,936 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:32,951 INFO L129 PetriNetUnfolder]: 4/53 cut-off events. [2021-06-11 15:53:32,952 INFO L130 PetriNetUnfolder]: For 26/61 co-relation queries the response was YES. [2021-06-11 15:53:32,952 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 53 events. 4/53 cut-off events. For 26/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 188 event pairs, 1 based on Foata normal form. 4/52 useless extension candidates. Maximal degree in co-relation 99. Up to 15 conditions per place. [2021-06-11 15:53:32,952 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 3 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2021-06-11 15:53:32,952 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 107 flow [2021-06-11 15:53:32,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:53:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:53:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2021-06-11 15:53:32,955 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.861904761904762 [2021-06-11 15:53:32,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 543 transitions. [2021-06-11 15:53:32,955 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 543 transitions. [2021-06-11 15:53:32,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:32,955 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 543 transitions. [2021-06-11 15:53:32,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:32,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:53:32,958 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:53:32,958 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 95 flow. Second operand 3 states and 543 transitions. [2021-06-11 15:53:32,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 107 flow [2021-06-11 15:53:32,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 104 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:53:32,960 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 103 flow [2021-06-11 15:53:32,960 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2021-06-11 15:53:32,960 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2021-06-11 15:53:32,960 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:32,960 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 30 transitions, 103 flow [2021-06-11 15:53:32,960 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 30 transitions, 103 flow [2021-06-11 15:53:32,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 30 transitions, 103 flow [2021-06-11 15:53:32,966 INFO L129 PetriNetUnfolder]: 4/46 cut-off events. [2021-06-11 15:53:32,966 INFO L130 PetriNetUnfolder]: For 19/26 co-relation queries the response was YES. [2021-06-11 15:53:32,966 INFO L84 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 46 events. 4/46 cut-off events. For 19/26 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 2 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 82. Up to 13 conditions per place. [2021-06-11 15:53:32,967 INFO L151 LiptonReduction]: Number of co-enabled transitions 430 [2021-06-11 15:53:32,969 INFO L163 LiptonReduction]: Checked pairs total: 280 [2021-06-11 15:53:32,969 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:32,970 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-06-11 15:53:32,970 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 103 flow [2021-06-11 15:53:32,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:53:32,971 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:32,971 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:53:32,971 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:53:32,971 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:32,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1737909587, now seen corresponding path program 1 times [2021-06-11 15:53:32,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:32,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307933298] [2021-06-11 15:53:32,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:33,054 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 15:53:33,055 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:53:33,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:33,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:53:33,089 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:53:33,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307933298] [2021-06-11 15:53:33,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:33,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:53:33,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567204597] [2021-06-11 15:53:33,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:53:33,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:33,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:53:33,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:53:33,092 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 210 [2021-06-11 15:53:33,093 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 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:53:33,093 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:33,093 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 210 [2021-06-11 15:53:33,093 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:33,158 INFO L129 PetriNetUnfolder]: 109/280 cut-off events. [2021-06-11 15:53:33,159 INFO L130 PetriNetUnfolder]: For 237/305 co-relation queries the response was YES. [2021-06-11 15:53:33,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 280 events. 109/280 cut-off events. For 237/305 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1538 event pairs, 68 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 644. Up to 165 conditions per place. [2021-06-11 15:53:33,162 INFO L132 encePairwiseOnDemand]: 206/210 looper letters, 7 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2021-06-11 15:53:33,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 129 flow [2021-06-11 15:53:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:53:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:53:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2021-06-11 15:53:33,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7793650793650794 [2021-06-11 15:53:33,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 491 transitions. [2021-06-11 15:53:33,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 491 transitions. [2021-06-11 15:53:33,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:33,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 491 transitions. [2021-06-11 15:53:33,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 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:53:33,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:53:33,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:53:33,168 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 103 flow. Second operand 3 states and 491 transitions. [2021-06-11 15:53:33,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 129 flow [2021-06-11 15:53:33,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 124 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 15:53:33,170 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 117 flow [2021-06-11 15:53:33,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2021-06-11 15:53:33,170 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2021-06-11 15:53:33,170 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:33,170 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 32 transitions, 117 flow [2021-06-11 15:53:33,171 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 32 transitions, 117 flow [2021-06-11 15:53:33,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 32 transitions, 117 flow [2021-06-11 15:53:33,181 INFO L129 PetriNetUnfolder]: 15/90 cut-off events. [2021-06-11 15:53:33,181 INFO L130 PetriNetUnfolder]: For 75/85 co-relation queries the response was YES. [2021-06-11 15:53:33,182 INFO L84 FinitePrefix]: Finished finitePrefix Result has 205 conditions, 90 events. 15/90 cut-off events. For 75/85 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 412 event pairs, 7 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 192. Up to 29 conditions per place. [2021-06-11 15:53:33,183 INFO L151 LiptonReduction]: Number of co-enabled transitions 468 [2021-06-11 15:53:33,185 INFO L163 LiptonReduction]: Checked pairs total: 218 [2021-06-11 15:53:33,185 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:33,185 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-06-11 15:53:33,186 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 117 flow [2021-06-11 15:53:33,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.75) internal successors, (643), 4 states have internal predecessors, (643), 0 states have call successors, (0), 0 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:53:33,187 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:33,187 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:53:33,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:53:33,187 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:33,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:33,187 INFO L82 PathProgramCache]: Analyzing trace with hash 964613071, now seen corresponding path program 1 times [2021-06-11 15:53:33,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:33,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675451404] [2021-06-11 15:53:33,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:33,276 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 15:53:33,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 15:53:33,299 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 15:53:33,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:53:33,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:33,329 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:53:33,336 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:53:33,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675451404] [2021-06-11 15:53:33,336 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:33,336 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:53:33,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915444647] [2021-06-11 15:53:33,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:53:33,337 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:33,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:53:33,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:53:33,338 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 210 [2021-06-11 15:53:33,339 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:53:33,339 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:33,339 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 210 [2021-06-11 15:53:33,339 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:33,426 INFO L129 PetriNetUnfolder]: 98/262 cut-off events. [2021-06-11 15:53:33,427 INFO L130 PetriNetUnfolder]: For 369/419 co-relation queries the response was YES. [2021-06-11 15:53:33,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 689 conditions, 262 events. 98/262 cut-off events. For 369/419 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1417 event pairs, 22 based on Foata normal form. 7/240 useless extension candidates. Maximal degree in co-relation 674. Up to 129 conditions per place. [2021-06-11 15:53:33,430 INFO L132 encePairwiseOnDemand]: 205/210 looper letters, 8 selfloop transitions, 6 changer transitions 0/37 dead transitions. [2021-06-11 15:53:33,430 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 165 flow [2021-06-11 15:53:33,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:53:33,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:53:33,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 654 transitions. [2021-06-11 15:53:33,432 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7785714285714286 [2021-06-11 15:53:33,432 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 654 transitions. [2021-06-11 15:53:33,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 654 transitions. [2021-06-11 15:53:33,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:33,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 654 transitions. [2021-06-11 15:53:33,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 0 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:53:33,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:33,436 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:33,436 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 117 flow. Second operand 4 states and 654 transitions. [2021-06-11 15:53:33,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 165 flow [2021-06-11 15:53:33,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 37 transitions, 162 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:53:33,438 INFO L241 Difference]: Finished difference. Result has 47 places, 34 transitions, 139 flow [2021-06-11 15:53:33,438 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2021-06-11 15:53:33,439 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 4 predicate places. [2021-06-11 15:53:33,439 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:33,439 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 34 transitions, 139 flow [2021-06-11 15:53:33,439 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 34 transitions, 139 flow [2021-06-11 15:53:33,439 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 139 flow [2021-06-11 15:53:33,453 INFO L129 PetriNetUnfolder]: 23/105 cut-off events. [2021-06-11 15:53:33,453 INFO L130 PetriNetUnfolder]: For 146/161 co-relation queries the response was YES. [2021-06-11 15:53:33,453 INFO L84 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 105 events. 23/105 cut-off events. For 146/161 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 518 event pairs, 9 based on Foata normal form. 1/91 useless extension candidates. Maximal degree in co-relation 272. Up to 36 conditions per place. [2021-06-11 15:53:33,454 INFO L151 LiptonReduction]: Number of co-enabled transitions 508 [2021-06-11 15:53:33,537 INFO L163 LiptonReduction]: Checked pairs total: 192 [2021-06-11 15:53:33,537 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:33,538 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 99 [2021-06-11 15:53:33,538 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 139 flow [2021-06-11 15:53:33,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:53:33,539 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:33,539 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:53:33,539 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:53:33,539 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:33,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1959271871, now seen corresponding path program 1 times [2021-06-11 15:53:33,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:33,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628122213] [2021-06-11 15:53:33,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:33,596 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 15:53:33,597 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:53:33,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:33,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 15:53:33,636 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:33,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 15:53:33,653 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:53:33,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628122213] [2021-06-11 15:53:33,653 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:33,653 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:53:33,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591662547] [2021-06-11 15:53:33,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:53:33,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:33,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:53:33,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:53:33,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 210 [2021-06-11 15:53:33,656 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:53:33,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:33,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 210 [2021-06-11 15:53:33,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:33,754 INFO L129 PetriNetUnfolder]: 87/241 cut-off events. [2021-06-11 15:53:33,754 INFO L130 PetriNetUnfolder]: For 429/477 co-relation queries the response was YES. [2021-06-11 15:53:33,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 241 events. 87/241 cut-off events. For 429/477 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1324 event pairs, 43 based on Foata normal form. 5/221 useless extension candidates. Maximal degree in co-relation 693. Up to 136 conditions per place. [2021-06-11 15:53:33,757 INFO L132 encePairwiseOnDemand]: 205/210 looper letters, 10 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2021-06-11 15:53:33,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 179 flow [2021-06-11 15:53:33,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:53:33,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:53:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 654 transitions. [2021-06-11 15:53:33,760 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7785714285714286 [2021-06-11 15:53:33,760 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 654 transitions. [2021-06-11 15:53:33,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 654 transitions. [2021-06-11 15:53:33,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:33,761 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 654 transitions. [2021-06-11 15:53:33,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 163.5) internal successors, (654), 4 states have internal predecessors, (654), 0 states have call successors, (0), 0 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:53:33,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:33,763 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:33,763 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 139 flow. Second operand 4 states and 654 transitions. [2021-06-11 15:53:33,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 179 flow [2021-06-11 15:53:33,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 173 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 15:53:33,766 INFO L241 Difference]: Finished difference. Result has 50 places, 36 transitions, 158 flow [2021-06-11 15:53:33,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2021-06-11 15:53:33,767 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2021-06-11 15:53:33,767 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:33,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 36 transitions, 158 flow [2021-06-11 15:53:33,767 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 36 transitions, 158 flow [2021-06-11 15:53:33,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 36 transitions, 158 flow [2021-06-11 15:53:33,786 INFO L129 PetriNetUnfolder]: 40/141 cut-off events. [2021-06-11 15:53:33,787 INFO L130 PetriNetUnfolder]: For 322/339 co-relation queries the response was YES. [2021-06-11 15:53:33,787 INFO L84 FinitePrefix]: Finished finitePrefix Result has 432 conditions, 141 events. 40/141 cut-off events. For 322/339 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 719 event pairs, 17 based on Foata normal form. 2/122 useless extension candidates. Maximal degree in co-relation 415. Up to 51 conditions per place. [2021-06-11 15:53:33,789 INFO L151 LiptonReduction]: Number of co-enabled transitions 548 [2021-06-11 15:53:33,961 INFO L163 LiptonReduction]: Checked pairs total: 166 [2021-06-11 15:53:33,961 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:33,961 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 194 [2021-06-11 15:53:33,963 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 158 flow [2021-06-11 15:53:33,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 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:53:33,963 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:33,963 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:53:33,963 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:53:33,964 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:33,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1613325579, now seen corresponding path program 1 times [2021-06-11 15:53:33,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:33,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969856655] [2021-06-11 15:53:33,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:34,064 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:34,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:53:34,072 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:34,072 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:34,081 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:34,082 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:53:34,091 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-06-11 15:53:34,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-11 15:53:34,116 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:53:34,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969856655] [2021-06-11 15:53:34,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:34,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:53:34,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948639541] [2021-06-11 15:53:34,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:53:34,117 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:34,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:53:34,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:53:34,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2021-06-11 15:53:34,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 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:53:34,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:34,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2021-06-11 15:53:34,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:34,231 INFO L129 PetriNetUnfolder]: 72/221 cut-off events. [2021-06-11 15:53:34,231 INFO L130 PetriNetUnfolder]: For 612/649 co-relation queries the response was YES. [2021-06-11 15:53:34,232 INFO L84 FinitePrefix]: Finished finitePrefix Result has 659 conditions, 221 events. 72/221 cut-off events. For 612/649 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1192 event pairs, 8 based on Foata normal form. 15/215 useless extension candidates. Maximal degree in co-relation 640. Up to 81 conditions per place. [2021-06-11 15:53:34,234 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 10 selfloop transitions, 8 changer transitions 0/41 dead transitions. [2021-06-11 15:53:34,234 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 41 transitions, 208 flow [2021-06-11 15:53:34,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:53:34,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:53:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 828 transitions. [2021-06-11 15:53:34,237 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7885714285714286 [2021-06-11 15:53:34,238 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 828 transitions. [2021-06-11 15:53:34,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 828 transitions. [2021-06-11 15:53:34,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:34,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 828 transitions. [2021-06-11 15:53:34,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 165.6) internal successors, (828), 5 states have internal predecessors, (828), 0 states have call successors, (0), 0 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:53:34,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:34,242 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:34,242 INFO L185 Difference]: Start difference. First operand has 50 places, 36 transitions, 158 flow. Second operand 5 states and 828 transitions. [2021-06-11 15:53:34,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 41 transitions, 208 flow [2021-06-11 15:53:34,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 41 transitions, 199 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 15:53:34,244 INFO L241 Difference]: Finished difference. Result has 54 places, 38 transitions, 190 flow [2021-06-11 15:53:34,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=190, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2021-06-11 15:53:34,244 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 11 predicate places. [2021-06-11 15:53:34,244 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:34,245 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 38 transitions, 190 flow [2021-06-11 15:53:34,245 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 38 transitions, 190 flow [2021-06-11 15:53:34,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 38 transitions, 190 flow [2021-06-11 15:53:34,261 INFO L129 PetriNetUnfolder]: 30/117 cut-off events. [2021-06-11 15:53:34,261 INFO L130 PetriNetUnfolder]: For 350/364 co-relation queries the response was YES. [2021-06-11 15:53:34,262 INFO L84 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 117 events. 30/117 cut-off events. For 350/364 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 533 event pairs, 11 based on Foata normal form. 3/105 useless extension candidates. Maximal degree in co-relation 389. Up to 38 conditions per place. [2021-06-11 15:53:34,263 INFO L151 LiptonReduction]: Number of co-enabled transitions 592 [2021-06-11 15:53:34,377 INFO L163 LiptonReduction]: Checked pairs total: 194 [2021-06-11 15:53:34,377 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:34,377 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 133 [2021-06-11 15:53:34,377 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 190 flow [2021-06-11 15:53:34,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 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:53:34,378 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:34,378 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:53:34,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 15:53:34,378 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:34,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:34,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1768840198, now seen corresponding path program 1 times [2021-06-11 15:53:34,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:34,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349712929] [2021-06-11 15:53:34,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:34,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:34,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:53:34,435 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:34,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:53:34,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:34,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:34,447 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-06-11 15:53:34,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-11 15:53:34,469 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 15:53:34,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 15:53:34,490 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:53:34,490 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349712929] [2021-06-11 15:53:34,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:34,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:53:34,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408981509] [2021-06-11 15:53:34,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:53:34,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:34,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:53:34,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:53:34,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 210 [2021-06-11 15:53:34,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 190 flow. Second operand has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:34,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:34,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 210 [2021-06-11 15:53:34,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:34,580 INFO L129 PetriNetUnfolder]: 87/260 cut-off events. [2021-06-11 15:53:34,580 INFO L130 PetriNetUnfolder]: For 760/793 co-relation queries the response was YES. [2021-06-11 15:53:34,582 INFO L84 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 260 events. 87/260 cut-off events. For 760/793 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1490 event pairs, 7 based on Foata normal form. 9/248 useless extension candidates. Maximal degree in co-relation 884. Up to 117 conditions per place. [2021-06-11 15:53:34,583 INFO L132 encePairwiseOnDemand]: 203/210 looper letters, 13 selfloop transitions, 10 changer transitions 0/46 dead transitions. [2021-06-11 15:53:34,583 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 275 flow [2021-06-11 15:53:34,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:53:34,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:53:34,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 812 transitions. [2021-06-11 15:53:34,586 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2021-06-11 15:53:34,586 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 812 transitions. [2021-06-11 15:53:34,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 812 transitions. [2021-06-11 15:53:34,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:34,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 812 transitions. [2021-06-11 15:53:34,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 162.4) internal successors, (812), 5 states have internal predecessors, (812), 0 states have call successors, (0), 0 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:53:34,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:34,590 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:34,590 INFO L185 Difference]: Start difference. First operand has 54 places, 38 transitions, 190 flow. Second operand 5 states and 812 transitions. [2021-06-11 15:53:34,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 275 flow [2021-06-11 15:53:34,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 46 transitions, 260 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-11 15:53:34,593 INFO L241 Difference]: Finished difference. Result has 58 places, 43 transitions, 243 flow [2021-06-11 15:53:34,593 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2021-06-11 15:53:34,594 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 15 predicate places. [2021-06-11 15:53:34,594 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:34,594 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 43 transitions, 243 flow [2021-06-11 15:53:34,594 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 43 transitions, 243 flow [2021-06-11 15:53:34,594 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 43 transitions, 243 flow [2021-06-11 15:53:34,616 INFO L129 PetriNetUnfolder]: 51/182 cut-off events. [2021-06-11 15:53:34,616 INFO L130 PetriNetUnfolder]: For 626/639 co-relation queries the response was YES. [2021-06-11 15:53:34,617 INFO L84 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 182 events. 51/182 cut-off events. For 626/639 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 993 event pairs, 10 based on Foata normal form. 4/167 useless extension candidates. Maximal degree in co-relation 645. Up to 65 conditions per place. [2021-06-11 15:53:34,619 INFO L151 LiptonReduction]: Number of co-enabled transitions 680 [2021-06-11 15:53:34,625 INFO L163 LiptonReduction]: Checked pairs total: 218 [2021-06-11 15:53:34,625 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:34,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-06-11 15:53:34,626 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 243 flow [2021-06-11 15:53:34,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:34,626 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:34,626 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:53:34,626 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:53:34,626 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:34,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1118749014, now seen corresponding path program 2 times [2021-06-11 15:53:34,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:34,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135217499] [2021-06-11 15:53:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:34,764 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-06-11 15:53:34,765 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:53:34,794 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 15:53:34,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 15:53:34,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:34,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:53:34,840 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-11 15:53:34,841 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:53:34,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:34,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:53:34,884 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:53:34,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135217499] [2021-06-11 15:53:34,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:34,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:53:34,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043281646] [2021-06-11 15:53:34,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:53:34,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:53:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:53:34,886 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 210 [2021-06-11 15:53:34,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 243 flow. Second operand has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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:53:34,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:34,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 210 [2021-06-11 15:53:34,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:34,998 INFO L129 PetriNetUnfolder]: 90/261 cut-off events. [2021-06-11 15:53:34,998 INFO L130 PetriNetUnfolder]: For 1182/1220 co-relation queries the response was YES. [2021-06-11 15:53:34,999 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1031 conditions, 261 events. 90/261 cut-off events. For 1182/1220 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1469 event pairs, 14 based on Foata normal form. 12/252 useless extension candidates. Maximal degree in co-relation 1008. Up to 120 conditions per place. [2021-06-11 15:53:35,001 INFO L132 encePairwiseOnDemand]: 204/210 looper letters, 13 selfloop transitions, 12 changer transitions 0/48 dead transitions. [2021-06-11 15:53:35,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 321 flow [2021-06-11 15:53:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:53:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:53:35,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 791 transitions. [2021-06-11 15:53:35,004 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7533333333333333 [2021-06-11 15:53:35,004 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 791 transitions. [2021-06-11 15:53:35,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 791 transitions. [2021-06-11 15:53:35,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:35,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 791 transitions. [2021-06-11 15:53:35,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.2) internal successors, (791), 5 states have internal predecessors, (791), 0 states have call successors, (0), 0 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:53:35,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:35,008 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:35,008 INFO L185 Difference]: Start difference. First operand has 58 places, 43 transitions, 243 flow. Second operand 5 states and 791 transitions. [2021-06-11 15:53:35,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 321 flow [2021-06-11 15:53:35,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 48 transitions, 311 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 15:53:35,011 INFO L241 Difference]: Finished difference. Result has 62 places, 45 transitions, 285 flow [2021-06-11 15:53:35,012 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=285, PETRI_PLACES=62, PETRI_TRANSITIONS=45} [2021-06-11 15:53:35,012 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 19 predicate places. [2021-06-11 15:53:35,012 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:35,012 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 45 transitions, 285 flow [2021-06-11 15:53:35,012 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 45 transitions, 285 flow [2021-06-11 15:53:35,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 45 transitions, 285 flow [2021-06-11 15:53:35,034 INFO L129 PetriNetUnfolder]: 46/177 cut-off events. [2021-06-11 15:53:35,034 INFO L130 PetriNetUnfolder]: For 719/731 co-relation queries the response was YES. [2021-06-11 15:53:35,035 INFO L84 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 177 events. 46/177 cut-off events. For 719/731 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 957 event pairs, 13 based on Foata normal form. 4/165 useless extension candidates. Maximal degree in co-relation 648. Up to 60 conditions per place. [2021-06-11 15:53:35,037 INFO L151 LiptonReduction]: Number of co-enabled transitions 714 [2021-06-11 15:53:35,042 INFO L163 LiptonReduction]: Checked pairs total: 258 [2021-06-11 15:53:35,042 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:35,042 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-06-11 15:53:35,043 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 285 flow [2021-06-11 15:53:35,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 155.85714285714286) internal successors, (1091), 7 states have internal predecessors, (1091), 0 states have call successors, (0), 0 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:53:35,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:35,044 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:53:35,044 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 15:53:35,044 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:35,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1891475244, now seen corresponding path program 1 times [2021-06-11 15:53:35,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:35,045 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36068342] [2021-06-11 15:53:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:35,087 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:35,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:53:35,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:35,097 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:53:35,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36068342] [2021-06-11 15:53:35,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:35,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:53:35,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257708941] [2021-06-11 15:53:35,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:53:35,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:35,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:53:35,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:53:35,099 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-06-11 15:53:35,099 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 285 flow. Second operand has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 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:53:35,099 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:35,100 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-06-11 15:53:35,100 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:35,279 INFO L129 PetriNetUnfolder]: 775/1475 cut-off events. [2021-06-11 15:53:35,279 INFO L130 PetriNetUnfolder]: For 3324/3481 co-relation queries the response was YES. [2021-06-11 15:53:35,287 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4150 conditions, 1475 events. 775/1475 cut-off events. For 3324/3481 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 10974 event pairs, 250 based on Foata normal form. 118/1234 useless extension candidates. Maximal degree in co-relation 4125. Up to 704 conditions per place. [2021-06-11 15:53:35,295 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 11 selfloop transitions, 12 changer transitions 0/59 dead transitions. [2021-06-11 15:53:35,296 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 59 transitions, 359 flow [2021-06-11 15:53:35,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:53:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:53:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2021-06-11 15:53:35,299 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8228571428571428 [2021-06-11 15:53:35,299 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 864 transitions. [2021-06-11 15:53:35,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 864 transitions. [2021-06-11 15:53:35,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:35,299 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 864 transitions. [2021-06-11 15:53:35,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.8) internal successors, (864), 5 states have internal predecessors, (864), 0 states have call successors, (0), 0 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:53:35,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:35,303 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 210.0) internal successors, (1260), 6 states have internal predecessors, (1260), 0 states have call successors, (0), 0 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:53:35,303 INFO L185 Difference]: Start difference. First operand has 62 places, 45 transitions, 285 flow. Second operand 5 states and 864 transitions. [2021-06-11 15:53:35,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 59 transitions, 359 flow [2021-06-11 15:53:35,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 331 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-06-11 15:53:35,308 INFO L241 Difference]: Finished difference. Result has 66 places, 55 transitions, 345 flow [2021-06-11 15:53:35,308 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2021-06-11 15:53:35,308 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 23 predicate places. [2021-06-11 15:53:35,309 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:35,309 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 55 transitions, 345 flow [2021-06-11 15:53:35,309 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 55 transitions, 345 flow [2021-06-11 15:53:35,309 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 345 flow [2021-06-11 15:53:35,427 INFO L129 PetriNetUnfolder]: 637/1214 cut-off events. [2021-06-11 15:53:35,427 INFO L130 PetriNetUnfolder]: For 2757/3465 co-relation queries the response was YES. [2021-06-11 15:53:35,435 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4122 conditions, 1214 events. 637/1214 cut-off events. For 2757/3465 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 8713 event pairs, 269 based on Foata normal form. 8/965 useless extension candidates. Maximal degree in co-relation 4096. Up to 834 conditions per place. [2021-06-11 15:53:35,450 INFO L151 LiptonReduction]: Number of co-enabled transitions 1018 [2021-06-11 15:53:35,457 INFO L163 LiptonReduction]: Checked pairs total: 274 [2021-06-11 15:53:35,457 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:35,457 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 148 [2021-06-11 15:53:35,460 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 345 flow [2021-06-11 15:53:35,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 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:53:35,461 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:35,461 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:53:35,461 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 15:53:35,461 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1005653590, now seen corresponding path program 1 times [2021-06-11 15:53:35,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:35,461 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776347834] [2021-06-11 15:53:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:35,514 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:35,519 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:35,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:53:35,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:35,532 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:53:35,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776347834] [2021-06-11 15:53:35,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:35,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:53:35,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236058590] [2021-06-11 15:53:35,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:53:35,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:35,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:53:35,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:53:35,534 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-06-11 15:53:35,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 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:53:35,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:35,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-06-11 15:53:35,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:35,769 INFO L129 PetriNetUnfolder]: 597/1187 cut-off events. [2021-06-11 15:53:35,770 INFO L130 PetriNetUnfolder]: For 3734/7370 co-relation queries the response was YES. [2021-06-11 15:53:35,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4785 conditions, 1187 events. 597/1187 cut-off events. For 3734/7370 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 8378 event pairs, 62 based on Foata normal form. 281/1242 useless extension candidates. Maximal degree in co-relation 4757. Up to 816 conditions per place. [2021-06-11 15:53:35,783 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 11 selfloop transitions, 22 changer transitions 0/69 dead transitions. [2021-06-11 15:53:35,783 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 492 flow [2021-06-11 15:53:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:53:35,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:53:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1210 transitions. [2021-06-11 15:53:35,786 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8231292517006803 [2021-06-11 15:53:35,786 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1210 transitions. [2021-06-11 15:53:35,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1210 transitions. [2021-06-11 15:53:35,787 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:35,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1210 transitions. [2021-06-11 15:53:35,789 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:53:35,792 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:53:35,792 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 210.0) internal successors, (1680), 8 states have internal predecessors, (1680), 0 states have call successors, (0), 0 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:53:35,792 INFO L185 Difference]: Start difference. First operand has 66 places, 55 transitions, 345 flow. Second operand 7 states and 1210 transitions. [2021-06-11 15:53:35,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 492 flow [2021-06-11 15:53:35,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 69 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:53:35,797 INFO L241 Difference]: Finished difference. Result has 75 places, 65 transitions, 497 flow [2021-06-11 15:53:35,797 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=497, PETRI_PLACES=75, PETRI_TRANSITIONS=65} [2021-06-11 15:53:35,797 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2021-06-11 15:53:35,797 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:35,797 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 65 transitions, 497 flow [2021-06-11 15:53:35,797 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 65 transitions, 497 flow [2021-06-11 15:53:35,798 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 65 transitions, 497 flow [2021-06-11 15:53:35,899 INFO L129 PetriNetUnfolder]: 527/1028 cut-off events. [2021-06-11 15:53:35,899 INFO L130 PetriNetUnfolder]: For 4657/7460 co-relation queries the response was YES. [2021-06-11 15:53:35,907 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4962 conditions, 1028 events. 527/1028 cut-off events. For 4657/7460 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 7433 event pairs, 72 based on Foata normal form. 12/840 useless extension candidates. Maximal degree in co-relation 4931. Up to 730 conditions per place. [2021-06-11 15:53:35,919 INFO L151 LiptonReduction]: Number of co-enabled transitions 1262 [2021-06-11 15:53:35,927 INFO L163 LiptonReduction]: Checked pairs total: 336 [2021-06-11 15:53:35,928 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:35,928 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 131 [2021-06-11 15:53:35,928 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 65 transitions, 497 flow [2021-06-11 15:53:35,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 168.8) internal successors, (844), 5 states have internal predecessors, (844), 0 states have call successors, (0), 0 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:53:35,929 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:35,929 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:53:35,929 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 15:53:35,929 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1751740636, now seen corresponding path program 1 times [2021-06-11 15:53:35,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:35,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114248558] [2021-06-11 15:53:35,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:35,969 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,970 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:35,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:35,975 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:35,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:35,979 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:53:35,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114248558] [2021-06-11 15:53:35,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:35,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:53:35,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679245594] [2021-06-11 15:53:35,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:53:35,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:53:35,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:53:35,981 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 210 [2021-06-11 15:53:35,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 65 transitions, 497 flow. Second operand has 4 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:53:35,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:35,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 210 [2021-06-11 15:53:35,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:36,242 INFO L129 PetriNetUnfolder]: 1154/2219 cut-off events. [2021-06-11 15:53:36,242 INFO L130 PetriNetUnfolder]: For 11896/17790 co-relation queries the response was YES. [2021-06-11 15:53:36,259 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10646 conditions, 2219 events. 1154/2219 cut-off events. For 11896/17790 co-relation queries the response was YES. Maximal size of possible extension queue 433. Compared 17528 event pairs, 127 based on Foata normal form. 64/1895 useless extension candidates. Maximal degree in co-relation 10613. Up to 1620 conditions per place. [2021-06-11 15:53:36,272 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 4 selfloop transitions, 2 changer transitions 5/67 dead transitions. [2021-06-11 15:53:36,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 67 transitions, 531 flow [2021-06-11 15:53:36,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:53:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:53:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 723 transitions. [2021-06-11 15:53:36,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8607142857142858 [2021-06-11 15:53:36,275 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 723 transitions. [2021-06-11 15:53:36,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 723 transitions. [2021-06-11 15:53:36,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:36,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 723 transitions. [2021-06-11 15:53:36,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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:53:36,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:36,279 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 210.0) internal successors, (1050), 5 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:36,279 INFO L185 Difference]: Start difference. First operand has 75 places, 65 transitions, 497 flow. Second operand 4 states and 723 transitions. [2021-06-11 15:53:36,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 67 transitions, 531 flow [2021-06-11 15:53:36,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 67 transitions, 477 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-06-11 15:53:36,328 INFO L241 Difference]: Finished difference. Result has 77 places, 61 transitions, 409 flow [2021-06-11 15:53:36,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=77, PETRI_TRANSITIONS=61} [2021-06-11 15:53:36,329 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2021-06-11 15:53:36,329 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:36,329 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 61 transitions, 409 flow [2021-06-11 15:53:36,329 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 61 transitions, 409 flow [2021-06-11 15:53:36,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 61 transitions, 409 flow [2021-06-11 15:53:36,575 INFO L129 PetriNetUnfolder]: 986/1877 cut-off events. [2021-06-11 15:53:36,576 INFO L130 PetriNetUnfolder]: For 8141/9092 co-relation queries the response was YES. [2021-06-11 15:53:36,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7959 conditions, 1877 events. 986/1877 cut-off events. For 8141/9092 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 14623 event pairs, 126 based on Foata normal form. 23/1527 useless extension candidates. Maximal degree in co-relation 7927. Up to 1232 conditions per place. [2021-06-11 15:53:36,617 INFO L151 LiptonReduction]: Number of co-enabled transitions 1302 [2021-06-11 15:53:36,626 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:53:36,626 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:36,626 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 297 [2021-06-11 15:53:36,627 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 61 transitions, 409 flow [2021-06-11 15:53:36,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 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:53:36,627 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:36,627 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:53:36,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 15:53:36,627 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:36,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1921264584, now seen corresponding path program 2 times [2021-06-11 15:53:36,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:36,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386902280] [2021-06-11 15:53:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:36,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:36,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:36,681 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:36,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 15:53:36,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386902280] [2021-06-11 15:53:36,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:36,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:53:36,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596264994] [2021-06-11 15:53:36,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:53:36,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:53:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:53:36,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 210 [2021-06-11 15:53:36,687 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 61 transitions, 409 flow. Second operand has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:53:36,687 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:36,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 210 [2021-06-11 15:53:36,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:37,020 INFO L129 PetriNetUnfolder]: 1612/3041 cut-off events. [2021-06-11 15:53:37,020 INFO L130 PetriNetUnfolder]: For 15537/17690 co-relation queries the response was YES. [2021-06-11 15:53:37,040 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12888 conditions, 3041 events. 1612/3041 cut-off events. For 15537/17690 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 25438 event pairs, 209 based on Foata normal form. 70/2515 useless extension candidates. Maximal degree in co-relation 12854. Up to 2099 conditions per place. [2021-06-11 15:53:37,055 INFO L132 encePairwiseOnDemand]: 207/210 looper letters, 3 selfloop transitions, 3 changer transitions 0/61 dead transitions. [2021-06-11 15:53:37,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 61 transitions, 421 flow [2021-06-11 15:53:37,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:53:37,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:53:37,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2021-06-11 15:53:37,057 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.861904761904762 [2021-06-11 15:53:37,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 543 transitions. [2021-06-11 15:53:37,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 543 transitions. [2021-06-11 15:53:37,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:37,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 543 transitions. [2021-06-11 15:53:37,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:53:37,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:53:37,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 210.0) internal successors, (840), 4 states have internal predecessors, (840), 0 states have call successors, (0), 0 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:53:37,060 INFO L185 Difference]: Start difference. First operand has 77 places, 61 transitions, 409 flow. Second operand 3 states and 543 transitions. [2021-06-11 15:53:37,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 61 transitions, 421 flow [2021-06-11 15:53:37,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 61 transitions, 406 flow, removed 0 selfloop flow, removed 5 redundant places. [2021-06-11 15:53:37,110 INFO L241 Difference]: Finished difference. Result has 75 places, 61 transitions, 405 flow [2021-06-11 15:53:37,110 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2021-06-11 15:53:37,111 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 32 predicate places. [2021-06-11 15:53:37,111 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:37,111 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 61 transitions, 405 flow [2021-06-11 15:53:37,111 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 61 transitions, 405 flow [2021-06-11 15:53:37,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 61 transitions, 405 flow [2021-06-11 15:53:37,381 INFO L129 PetriNetUnfolder]: 1667/3092 cut-off events. [2021-06-11 15:53:37,382 INFO L130 PetriNetUnfolder]: For 13170/14853 co-relation queries the response was YES. [2021-06-11 15:53:37,401 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13108 conditions, 3092 events. 1667/3092 cut-off events. For 13170/14853 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 25705 event pairs, 208 based on Foata normal form. 32/2462 useless extension candidates. Maximal degree in co-relation 13077. Up to 2152 conditions per place. [2021-06-11 15:53:37,488 INFO L151 LiptonReduction]: Number of co-enabled transitions 1302 [2021-06-11 15:53:37,496 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:53:37,496 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:37,496 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 385 [2021-06-11 15:53:37,497 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 405 flow [2021-06-11 15:53:37,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 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:53:37,497 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:37,497 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:53:37,498 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 15:53:37,498 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:37,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:37,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1021502147, now seen corresponding path program 1 times [2021-06-11 15:53:37,498 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:37,498 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318681506] [2021-06-11 15:53:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:37,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:37,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:37,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:37,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:37,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:37,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:37,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:37,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:37,563 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:53:37,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:37,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:37,570 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:53:37,570 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318681506] [2021-06-11 15:53:37,570 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:37,570 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:53:37,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851279528] [2021-06-11 15:53:37,571 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:53:37,571 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:53:37,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:53:37,573 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-06-11 15:53:37,574 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 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:53:37,574 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:37,574 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-06-11 15:53:37,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:37,959 INFO L129 PetriNetUnfolder]: 1457/2736 cut-off events. [2021-06-11 15:53:37,960 INFO L130 PetriNetUnfolder]: For 12626/22110 co-relation queries the response was YES. [2021-06-11 15:53:37,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 13592 conditions, 2736 events. 1457/2736 cut-off events. For 12626/22110 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 21844 event pairs, 18 based on Foata normal form. 882/3039 useless extension candidates. Maximal degree in co-relation 13559. Up to 1841 conditions per place. [2021-06-11 15:53:37,999 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 6 selfloop transitions, 32 changer transitions 4/75 dead transitions. [2021-06-11 15:53:37,999 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 75 transitions, 622 flow [2021-06-11 15:53:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:53:38,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:53:38,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1556 transitions. [2021-06-11 15:53:38,005 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8232804232804233 [2021-06-11 15:53:38,005 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1556 transitions. [2021-06-11 15:53:38,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1556 transitions. [2021-06-11 15:53:38,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:38,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1556 transitions. [2021-06-11 15:53:38,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 172.88888888888889) internal successors, (1556), 9 states have internal predecessors, (1556), 0 states have call successors, (0), 0 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:53:38,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 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:53:38,024 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 210.0) internal successors, (2100), 10 states have internal predecessors, (2100), 0 states have call successors, (0), 0 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:53:38,024 INFO L185 Difference]: Start difference. First operand has 75 places, 61 transitions, 405 flow. Second operand 9 states and 1556 transitions. [2021-06-11 15:53:38,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 75 transitions, 622 flow [2021-06-11 15:53:38,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 75 transitions, 617 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 15:53:38,070 INFO L241 Difference]: Finished difference. Result has 85 places, 71 transitions, 596 flow [2021-06-11 15:53:38,070 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=596, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2021-06-11 15:53:38,070 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 42 predicate places. [2021-06-11 15:53:38,070 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:38,071 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 85 places, 71 transitions, 596 flow [2021-06-11 15:53:38,071 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 85 places, 71 transitions, 596 flow [2021-06-11 15:53:38,072 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 71 transitions, 596 flow [2021-06-11 15:53:38,301 INFO L129 PetriNetUnfolder]: 1353/2608 cut-off events. [2021-06-11 15:53:38,302 INFO L130 PetriNetUnfolder]: For 16483/20043 co-relation queries the response was YES. [2021-06-11 15:53:38,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14022 conditions, 2608 events. 1353/2608 cut-off events. For 16483/20043 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 21731 event pairs, 17 based on Foata normal form. 11/2042 useless extension candidates. Maximal degree in co-relation 13987. Up to 1713 conditions per place. [2021-06-11 15:53:38,350 INFO L151 LiptonReduction]: Number of co-enabled transitions 1392 [2021-06-11 15:53:38,360 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:53:38,360 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:38,360 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 290 [2021-06-11 15:53:38,361 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 596 flow [2021-06-11 15:53:38,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 168.83333333333334) internal successors, (1013), 6 states have internal predecessors, (1013), 0 states have call successors, (0), 0 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:53:38,361 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:38,361 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:53:38,362 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 15:53:38,362 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:38,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:38,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1296297885, now seen corresponding path program 1 times [2021-06-11 15:53:38,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:38,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615967641] [2021-06-11 15:53:38,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:53:38,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:38,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:38,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:38,428 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:38,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:38,432 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:38,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:38,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:53:38,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:38,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:53:38,450 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:53:38,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:53:38,450 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:53:38,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615967641] [2021-06-11 15:53:38,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:53:38,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:53:38,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220580028] [2021-06-11 15:53:38,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:53:38,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:53:38,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:53:38,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:53:38,455 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2021-06-11 15:53:38,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 596 flow. Second operand has 7 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 states have internal predecessors, (1182), 0 states have call successors, (0), 0 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:53:38,456 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:53:38,456 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2021-06-11 15:53:38,456 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:53:38,887 INFO L129 PetriNetUnfolder]: 1309/2493 cut-off events. [2021-06-11 15:53:38,887 INFO L130 PetriNetUnfolder]: For 17997/28135 co-relation queries the response was YES. [2021-06-11 15:53:38,905 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15543 conditions, 2493 events. 1309/2493 cut-off events. For 17997/28135 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 20088 event pairs, 0 based on Foata normal form. 776/2691 useless extension candidates. Maximal degree in co-relation 15506. Up to 1615 conditions per place. [2021-06-11 15:53:38,916 INFO L132 encePairwiseOnDemand]: 202/210 looper letters, 2 selfloop transitions, 37 changer transitions 5/77 dead transitions. [2021-06-11 15:53:38,916 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 77 transitions, 750 flow [2021-06-11 15:53:38,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 15:53:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 15:53:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1894 transitions. [2021-06-11 15:53:38,921 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8199134199134199 [2021-06-11 15:53:38,921 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1894 transitions. [2021-06-11 15:53:38,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1894 transitions. [2021-06-11 15:53:38,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:53:38,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1894 transitions. [2021-06-11 15:53:38,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 172.1818181818182) internal successors, (1894), 11 states have internal predecessors, (1894), 0 states have call successors, (0), 0 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:53:38,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 0 states have call successors, (0), 0 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:53:38,930 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 210.0) internal successors, (2520), 12 states have internal predecessors, (2520), 0 states have call successors, (0), 0 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:53:38,930 INFO L185 Difference]: Start difference. First operand has 85 places, 71 transitions, 596 flow. Second operand 11 states and 1894 transitions. [2021-06-11 15:53:38,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 77 transitions, 750 flow [2021-06-11 15:53:39,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 77 transitions, 622 flow, removed 42 selfloop flow, removed 6 redundant places. [2021-06-11 15:53:39,156 INFO L241 Difference]: Finished difference. Result has 92 places, 72 transitions, 573 flow [2021-06-11 15:53:39,156 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=573, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2021-06-11 15:53:39,156 INFO L343 CegarLoopForPetriNet]: 43 programPoint places, 49 predicate places. [2021-06-11 15:53:39,156 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:53:39,156 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 92 places, 72 transitions, 573 flow [2021-06-11 15:53:39,157 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 92 places, 72 transitions, 573 flow [2021-06-11 15:53:39,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 72 transitions, 573 flow [2021-06-11 15:53:39,314 INFO L129 PetriNetUnfolder]: 1285/2453 cut-off events. [2021-06-11 15:53:39,314 INFO L130 PetriNetUnfolder]: For 8767/10339 co-relation queries the response was YES. [2021-06-11 15:53:39,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11089 conditions, 2453 events. 1285/2453 cut-off events. For 8767/10339 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 20943 event pairs, 0 based on Foata normal form. 9/1872 useless extension candidates. Maximal degree in co-relation 11052. Up to 868 conditions per place. [2021-06-11 15:53:39,345 INFO L151 LiptonReduction]: Number of co-enabled transitions 1358 [2021-06-11 15:53:39,362 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:53:39,362 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:53:39,362 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 206 [2021-06-11 15:53:39,362 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 72 transitions, 573 flow [2021-06-11 15:53:39,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 168.85714285714286) internal successors, (1182), 7 states have internal predecessors, (1182), 0 states have call successors, (0), 0 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:53:39,363 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:53:39,363 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:53:39,363 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 15:53:39,363 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:53:39,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:53:39,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1582508398, now seen corresponding path program 1 times [2021-06-11 15:53:39,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:53:39,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726145223] [2021-06-11 15:53:39,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:53:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:53:39,393 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:53:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:53:39,424 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:53:39,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:53:39,462 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:53:39,462 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 15:53:39,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:53:39 BasicIcfg [2021-06-11 15:53:39,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:53:39,563 INFO L168 Benchmark]: Toolchain (without parser) took 26374.56 ms. Allocated memory was 352.3 MB in the beginning and 740.3 MB in the end (delta: 388.0 MB). Free memory was 314.7 MB in the beginning and 334.3 MB in the end (delta: -19.6 MB). Peak memory consumption was 370.0 MB. Max. memory is 16.0 GB. [2021-06-11 15:53:39,564 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 352.3 MB. Free memory is still 333.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:53:39,564 INFO L168 Benchmark]: CACSL2BoogieTranslator took 501.48 ms. Allocated memory is still 352.3 MB. Free memory was 314.5 MB in the beginning and 310.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. [2021-06-11 15:53:39,564 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.71 ms. Allocated memory is still 352.3 MB. Free memory was 309.9 MB in the beginning and 306.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 15:53:39,564 INFO L168 Benchmark]: Boogie Preprocessor took 32.82 ms. Allocated memory is still 352.3 MB. Free memory was 306.7 MB in the beginning and 304.6 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:53:39,564 INFO L168 Benchmark]: RCFGBuilder took 1697.90 ms. Allocated memory is still 352.3 MB. Free memory was 304.6 MB in the beginning and 290.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 182.7 MB. Max. memory is 16.0 GB. [2021-06-11 15:53:39,564 INFO L168 Benchmark]: TraceAbstraction took 24063.00 ms. Allocated memory was 352.3 MB in the beginning and 740.3 MB in the end (delta: 388.0 MB). Free memory was 289.7 MB in the beginning and 334.3 MB in the end (delta: -44.6 MB). Peak memory consumption was 343.4 MB. Max. memory is 16.0 GB. [2021-06-11 15:53:39,565 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.50 ms. Allocated memory is still 352.3 MB. Free memory is still 333.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 501.48 ms. Allocated memory is still 352.3 MB. Free memory was 314.5 MB in the beginning and 310.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.71 ms. Allocated memory is still 352.3 MB. Free memory was 309.9 MB in the beginning and 306.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 32.82 ms. Allocated memory is still 352.3 MB. Free memory was 306.7 MB in the beginning and 304.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1697.90 ms. Allocated memory is still 352.3 MB. Free memory was 304.6 MB in the beginning and 290.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 182.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24063.00 ms. Allocated memory was 352.3 MB in the beginning and 740.3 MB in the end (delta: 388.0 MB). Free memory was 289.7 MB in the beginning and 334.3 MB in the end (delta: -44.6 MB). Peak memory consumption was 343.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9473.5ms, 119 PlacesBefore, 43 PlacesAfterwards, 108 TransitionsBefore, 31 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 96 TotalNumberOfCompositions, 6317 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3187, positive: 3003, positive conditional: 3003, positive unconditional: 0, negative: 184, negative conditional: 184, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3187, positive: 3003, positive conditional: 0, positive unconditional: 3003, negative: 184, negative conditional: 0, negative unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3187, positive: 3003, positive conditional: 0, positive unconditional: 3003, negative: 184, negative conditional: 0, negative unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1954, positive: 1904, positive conditional: 0, positive unconditional: 1904, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1954, positive: 1864, positive conditional: 0, positive unconditional: 1864, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 90, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 879, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 755, negative conditional: 0, negative unconditional: 755, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3187, positive: 1099, positive conditional: 0, positive unconditional: 1099, negative: 134, negative conditional: 0, negative unconditional: 134, unknown: 1954, unknown conditional: 0, unknown unconditional: 1954] , Statistics on independence cache: Total cache size (in pairs): 1954, Positive cache size: 1904, Positive conditional cache size: 0, Positive unconditional cache size: 1904, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6967.2ms, 39 PlacesBefore, 38 PlacesAfterwards, 28 TransitionsBefore, 27 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 874 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 256, positive: 208, positive conditional: 208, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 256, positive: 208, positive conditional: 11, positive unconditional: 197, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 208, positive conditional: 11, positive unconditional: 197, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 27, positive conditional: 1, positive unconditional: 26, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 360, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 319, negative conditional: 0, negative unconditional: 319, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 256, positive: 181, positive conditional: 10, positive unconditional: 171, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 37, unknown conditional: 1, unknown unconditional: 36] , Statistics on independence cache: Total cache size (in pairs): 1991, Positive cache size: 1931, Positive conditional cache size: 1, Positive unconditional cache size: 1930, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1ms, 42 PlacesBefore, 39 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 376 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 338 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 96, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 96, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 96, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 19, negative conditional: 0, negative unconditional: 19, 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: 96, positive: 75, positive conditional: 0, positive unconditional: 75, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1993, Positive cache size: 1933, Positive conditional cache size: 1, Positive unconditional cache size: 1932, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.5ms, 40 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 73, positive: 58, positive conditional: 58, 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: 73, positive: 58, positive conditional: 0, positive unconditional: 58, 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: 73, positive: 58, positive conditional: 0, positive unconditional: 58, 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: 73, positive: 58, positive conditional: 0, positive unconditional: 58, 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): 1993, Positive cache size: 1933, Positive conditional cache size: 1, Positive unconditional cache size: 1932, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.0ms, 42 PlacesBefore, 42 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 430 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 61, positive conditional: 61, 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: 76, positive: 61, positive conditional: 0, positive unconditional: 61, 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: 76, positive: 61, positive conditional: 0, positive unconditional: 61, 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: 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: 76, positive: 59, positive conditional: 0, positive unconditional: 59, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1995, Positive cache size: 1935, Positive conditional cache size: 1, Positive unconditional cache size: 1934, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.6ms, 44 PlacesBefore, 44 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 218 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 41, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 41, positive: 30, positive conditional: 2, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 30, positive conditional: 2, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, 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: 41, positive: 30, positive conditional: 2, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1995, Positive cache size: 1935, Positive conditional cache size: 1, Positive unconditional cache size: 1934, Negative cache size: 60, Negative conditional cache size: 0, Negative unconditional cache size: 60, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 98.4ms, 47 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 508 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 192 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 59, positive: 50, positive conditional: 50, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 59, positive: 50, positive conditional: 7, positive unconditional: 43, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 50, positive conditional: 7, positive unconditional: 43, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 12, positive conditional: 2, positive unconditional: 10, 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: 14, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 79, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 38, positive conditional: 5, positive unconditional: 33, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 14, unknown conditional: 2, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 2009, Positive cache size: 1947, Positive conditional cache size: 3, Positive unconditional cache size: 1944, Negative cache size: 62, Negative conditional cache size: 0, Negative unconditional cache size: 62, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 193.8ms, 50 PlacesBefore, 50 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 166 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 46, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 46, positive: 39, positive conditional: 12, positive unconditional: 27, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 46, positive: 39, positive conditional: 12, positive unconditional: 27, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 164, positive: 137, positive conditional: 137, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 46, positive: 33, positive conditional: 6, positive unconditional: 27, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 7, unknown conditional: 6, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2016, Positive cache size: 1953, Positive conditional cache size: 9, Positive unconditional cache size: 1944, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 131.9ms, 54 PlacesBefore, 54 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 592 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 194 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 41, positive conditional: 41, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, positive: 41, positive conditional: 19, positive unconditional: 22, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 41, positive conditional: 19, positive unconditional: 22, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 6, positive unconditional: 4, 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: 10, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 109, positive: 109, positive conditional: 109, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 31, positive conditional: 13, positive unconditional: 18, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 10, unknown conditional: 6, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 2026, Positive cache size: 1963, Positive conditional cache size: 15, Positive unconditional cache size: 1948, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 30.8ms, 58 PlacesBefore, 58 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 680 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 218 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 45, positive: 36, positive conditional: 24, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 45, positive: 36, positive conditional: 24, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, 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: 45, positive: 36, positive conditional: 24, positive unconditional: 12, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2026, Positive cache size: 1963, Positive conditional cache size: 15, Positive unconditional cache size: 1948, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.9ms, 62 PlacesBefore, 62 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 714 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 258 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 43, positive: 32, positive conditional: 32, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 43, positive: 32, positive conditional: 20, positive unconditional: 12, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 43, positive: 32, positive conditional: 20, positive unconditional: 12, negative: 11, negative conditional: 0, negative unconditional: 11, 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: 43, positive: 32, positive conditional: 20, positive unconditional: 12, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2026, Positive cache size: 1963, Positive conditional cache size: 15, Positive unconditional cache size: 1948, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 148.2ms, 66 PlacesBefore, 66 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 1018 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 274 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, positive: 40, positive conditional: 23, positive unconditional: 17, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 40, positive conditional: 23, positive unconditional: 17, negative: 9, negative conditional: 0, negative unconditional: 9, 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: 49, positive: 39, positive conditional: 23, positive unconditional: 16, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2027, Positive cache size: 1964, Positive conditional cache size: 15, Positive unconditional cache size: 1949, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 130.2ms, 75 PlacesBefore, 75 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 1262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 336 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 33, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 33, positive: 24, positive conditional: 20, positive unconditional: 4, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 24, positive conditional: 20, positive unconditional: 4, negative: 9, negative conditional: 0, negative unconditional: 9, 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: 33, positive: 24, positive conditional: 20, positive unconditional: 4, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2027, Positive cache size: 1964, Positive conditional cache size: 15, Positive unconditional cache size: 1949, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 296.8ms, 77 PlacesBefore, 77 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 1302 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): 2027, Positive cache size: 1964, Positive conditional cache size: 15, Positive unconditional cache size: 1949, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 385.1ms, 75 PlacesBefore, 75 PlacesAfterwards, 61 TransitionsBefore, 61 TransitionsAfterwards, 1302 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): 2027, Positive cache size: 1964, Positive conditional cache size: 15, Positive unconditional cache size: 1949, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 289.1ms, 85 PlacesBefore, 85 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 1392 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): 2027, Positive cache size: 1964, Positive conditional cache size: 15, Positive unconditional cache size: 1949, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 205.2ms, 92 PlacesBefore, 91 PlacesAfterwards, 72 TransitionsBefore, 72 TransitionsAfterwards, 1358 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): 2027, Positive cache size: 1964, Positive conditional cache size: 15, Positive unconditional cache size: 1949, Negative cache size: 63, Negative conditional cache size: 0, Negative unconditional cache size: 63, Eliminated conditions: 0 - 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_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1525; [L835] FCALL, FORK 0 pthread_create(&t1525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1526; [L837] FCALL, FORK 0 pthread_create(&t1526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1527; [L839] FCALL, FORK 0 pthread_create(&t1527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1528; [L841] FCALL, FORK 0 pthread_create(&t1528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L782] 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) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] 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) [L782] 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) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 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 [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 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 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L812] 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) [L812] 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) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 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 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 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 [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] 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) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] 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) [L847] 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) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 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 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 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 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] 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) [L858] 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) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 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)) [L864] 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)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 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_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, 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, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 5.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 23852.3ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 3329.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9559.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 63 SDtfs, 43 SDslu, 27 SDs, 0 SdLazy, 357 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 433.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 559.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=596occurred in iteration=15, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 52.8ms SsaConstructionTime, 498.6ms SatisfiabilityAnalysisTime, 1172.1ms InterpolantComputationTime, 271 NumberOfCodeBlocks, 271 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 1807 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...