/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/mix044_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 15:48:08,753 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 15:48:08,754 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 15:48:08,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 15:48:08,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 15:48:08,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 15:48:08,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 15:48:08,794 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 15:48:08,795 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 15:48:08,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 15:48:08,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 15:48:08,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 15:48:08,801 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 15:48:08,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 15:48:08,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 15:48:08,804 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 15:48:08,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 15:48:08,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 15:48:08,808 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 15:48:08,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 15:48:08,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 15:48:08,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 15:48:08,813 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 15:48:08,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 15:48:08,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 15:48:08,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 15:48:08,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 15:48:08,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 15:48:08,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 15:48:08,819 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 15:48:08,819 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 15:48:08,820 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 15:48:08,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 15:48:08,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 15:48:08,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 15:48:08,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 15:48:08,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 15:48:08,823 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 15:48:08,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 15:48:08,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 15:48:08,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 15:48:08,826 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:48:08,849 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 15:48:08,849 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 15:48:08,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 15:48:08,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 15:48:08,850 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 15:48:08,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 15:48:08,850 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 15:48:08,850 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 15:48:08,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 15:48:08,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 15:48:08,851 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 15:48:08,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 15:48:08,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:48:08,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 15:48:08,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 15:48:08,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 15:48:08,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 15:48:08,852 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 15:48:08,852 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 15:48:08,852 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 15:48:08,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 15:48:08,852 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:48:09,049 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 15:48:09,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 15:48:09,080 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 15:48:09,081 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 15:48:09,081 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 15:48:09,082 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-06-11 15:48:09,137 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f0a4810/d967e96bbad74d96a791a3e0e4d6ee2b/FLAG757dec440 [2021-06-11 15:48:09,535 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 15:48:09,536 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.oepc.i [2021-06-11 15:48:09,550 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f0a4810/d967e96bbad74d96a791a3e0e4d6ee2b/FLAG757dec440 [2021-06-11 15:48:09,564 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07f0a4810/d967e96bbad74d96a791a3e0e4d6ee2b [2021-06-11 15:48:09,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 15:48:09,569 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 15:48:09,570 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 15:48:09,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 15:48:09,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 15:48:09,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:48:09" (1/1) ... [2021-06-11 15:48:09,575 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e97295e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:09, skipping insertion in model container [2021-06-11 15:48:09,575 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 03:48:09" (1/1) ... [2021-06-11 15:48:09,580 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 15:48:09,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 15:48:09,775 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/mix044_tso.oepc.i[949,962] [2021-06-11 15:48:09,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:48:09,956 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 15:48:09,963 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/mix044_tso.oepc.i[949,962] [2021-06-11 15:48:09,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 15:48:10,044 INFO L208 MainTranslator]: Completed translation [2021-06-11 15:48:10,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10 WrapperNode [2021-06-11 15:48:10,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 15:48:10,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 15:48:10,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 15:48:10,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 15:48:10,050 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:48:10" (1/1) ... [2021-06-11 15:48:10,061 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:48:10" (1/1) ... [2021-06-11 15:48:10,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 15:48:10,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 15:48:10,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 15:48:10,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 15:48:10,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (1/1) ... [2021-06-11 15:48:10,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (1/1) ... [2021-06-11 15:48:10,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (1/1) ... [2021-06-11 15:48:10,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (1/1) ... [2021-06-11 15:48:10,109 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (1/1) ... [2021-06-11 15:48:10,112 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (1/1) ... [2021-06-11 15:48:10,114 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (1/1) ... [2021-06-11 15:48:10,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 15:48:10,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 15:48:10,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 15:48:10,118 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 15:48:10,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 15:48:10,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 15:48:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 15:48:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 15:48:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 15:48:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 15:48:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 15:48:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 15:48:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 15:48:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 15:48:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 15:48:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 15:48:10,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 15:48:10,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 15:48:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 15:48:10,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 15:48:10,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 15:48:10,184 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:48:11,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 15:48:11,625 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 15:48:11,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:48:11 BoogieIcfgContainer [2021-06-11 15:48:11,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 15:48:11,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 15:48:11,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 15:48:11,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 15:48:11,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 03:48:09" (1/3) ... [2021-06-11 15:48:11,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdf7423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:48:11, skipping insertion in model container [2021-06-11 15:48:11,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 03:48:10" (2/3) ... [2021-06-11 15:48:11,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cdf7423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 03:48:11, skipping insertion in model container [2021-06-11 15:48:11,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 03:48:11" (3/3) ... [2021-06-11 15:48:11,635 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.oepc.i [2021-06-11 15:48:11,639 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 15:48:11,642 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 15:48:11,642 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 15:48:11,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,669 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,669 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,670 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,671 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,672 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,674 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,674 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,676 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,676 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,676 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,677 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,678 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,679 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,679 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,680 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,681 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,682 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,683 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,684 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,684 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,685 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,687 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,692 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,694 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,695 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,697 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,697 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,698 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,699 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,699 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,699 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 15:48:11,701 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 15:48:11,713 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 15:48:11,733 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 15:48:11,733 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 15:48:11,733 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 15:48:11,733 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 15:48:11,734 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 15:48:11,734 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 15:48:11,734 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 15:48:11,734 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 15:48:11,744 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-06-11 15:48:11,786 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-06-11 15:48:11,787 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:48:11,789 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-06-11 15:48:11,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-06-11 15:48:11,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-06-11 15:48:11,796 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:11,804 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-06-11 15:48:11,806 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-06-11 15:48:11,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-06-11 15:48:11,835 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-06-11 15:48:11,835 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:48:11,836 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 92 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-06-11 15:48:11,839 INFO L151 LiptonReduction]: Number of co-enabled transitions 2868 [2021-06-11 15:48:11,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:11,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:11,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:11,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,030 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,044 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,127 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,128 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,281 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:12,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:12,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:12,318 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,319 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,330 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:12,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:12,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:13,074 WARN L205 SmtUtils]: Spent 630.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-06-11 15:48:13,634 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-06-11 15:48:14,875 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-06-11 15:48:15,402 WARN L205 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-06-11 15:48:15,404 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,405 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:15,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,467 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:15,470 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:15,471 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:15,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:15,533 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,535 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:15,537 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:15,540 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:15,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:15,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,762 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 15:48:15,762 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:15,782 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:15,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,913 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:15,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,914 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:15,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:15,989 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:15,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,006 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,044 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,045 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,176 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:48:16,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,277 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,290 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,304 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,305 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,392 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,447 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,475 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,502 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,525 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,648 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,795 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,796 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:16,871 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:16,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:17,138 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2021-06-11 15:48:17,494 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 15:48:17,608 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 15:48:17,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:17,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,627 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:48:17,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:17,629 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,630 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 15:48:17,630 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:17,632 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,634 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 15:48:17,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:17,636 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 15:48:17,637 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 15:48:17,637 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:17,638 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,640 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 15:48:17,641 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 15:48:17,641 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:17,643 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,645 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 15:48:17,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,690 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:17,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:17,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:17,720 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:17,805 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,806 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:17,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:17,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,970 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:17,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:17,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:17,990 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:17,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,135 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,173 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,174 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:18,238 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:18,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,363 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,369 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 15:48:18,370 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,371 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 15:48:18,378 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 4, 4, 3, 2, 1] term [2021-06-11 15:48:18,378 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:18,379 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,380 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2021-06-11 15:48:18,380 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:18,383 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,384 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 4, 3, 2, 1] term [2021-06-11 15:48:18,384 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:18,385 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,391 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 86 [2021-06-11 15:48:18,393 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,394 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,394 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,395 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,396 INFO L147 QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1 [2021-06-11 15:48:18,396 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 5, 3, 2, 1] term [2021-06-11 15:48:18,396 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:18,398 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,398 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 6, 5, 1] term [2021-06-11 15:48:18,398 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 15:48:18,399 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,401 INFO L147 QuantifierPusher]: treesize reduction 127, result has 32.4 percent of original size 61 [2021-06-11 15:48:18,409 INFO L147 QuantifierPusher]: treesize reduction 321, result has 44.2 percent of original size 254 [2021-06-11 15:48:18,501 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,503 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,503 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:18,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:18,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,609 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:18,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,777 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,781 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 15:48:18,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:18,782 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,782 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,783 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,784 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 15:48:18,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 15:48:18,786 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,787 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,787 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 15:48:18,788 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 15:48:18,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,825 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 15:48:18,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,984 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:18,984 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:18,985 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:18,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:19,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:19,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:19,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:19,420 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:19,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:19,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:19,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:19,703 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-11 15:48:19,843 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-11 15:48:20,157 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-11 15:48:20,284 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-11 15:48:20,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:20,306 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 15:48:20,306 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:20,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:20,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:20,320 INFO L163 LiptonReduction]: Checked pairs total: 9067 [2021-06-11 15:48:20,320 INFO L165 LiptonReduction]: Total number of compositions: 100 [2021-06-11 15:48:20,323 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8528 [2021-06-11 15:48:20,332 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2021-06-11 15:48:20,332 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:48:20,332 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:20,333 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-06-11 15:48:20,333 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1174540730, now seen corresponding path program 1 times [2021-06-11 15:48:20,342 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:20,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676758047] [2021-06-11 15:48:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:20,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:20,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:20,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:20,461 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:48:20,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676758047] [2021-06-11 15:48:20,462 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:20,462 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:48:20,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569869204] [2021-06-11 15:48:20,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:48:20,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:20,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:48:20,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:48:20,477 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 219 [2021-06-11 15:48:20,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:20,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:20,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 219 [2021-06-11 15:48:20,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:20,558 INFO L129 PetriNetUnfolder]: 133/303 cut-off events. [2021-06-11 15:48:20,558 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:48:20,560 INFO L84 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 303 events. 133/303 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1591 event pairs, 87 based on Foata normal form. 45/306 useless extension candidates. Maximal degree in co-relation 511. Up to 153 conditions per place. [2021-06-11 15:48:20,562 INFO L132 encePairwiseOnDemand]: 214/219 looper letters, 11 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2021-06-11 15:48:20,562 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 38 transitions, 114 flow [2021-06-11 15:48:20,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:48:20,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:48:20,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2021-06-11 15:48:20,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8721461187214612 [2021-06-11 15:48:20,573 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2021-06-11 15:48:20,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2021-06-11 15:48:20,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:20,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2021-06-11 15:48:20,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 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:48:20,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:20,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:20,586 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 84 flow. Second operand 3 states and 573 transitions. [2021-06-11 15:48:20,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 38 transitions, 114 flow [2021-06-11 15:48:20,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 15:48:20,589 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 78 flow [2021-06-11 15:48:20,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-06-11 15:48:20,591 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-06-11 15:48:20,591 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:20,591 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 78 flow [2021-06-11 15:48:20,591 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 78 flow [2021-06-11 15:48:20,592 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 78 flow [2021-06-11 15:48:20,595 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-06-11 15:48:20,595 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:48:20,595 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 57 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 15:48:20,596 INFO L151 LiptonReduction]: Number of co-enabled transitions 556 [2021-06-11 15:48:21,142 WARN L205 SmtUtils]: Spent 544.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-06-11 15:48:21,645 WARN L205 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2021-06-11 15:48:23,640 WARN L205 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 292 DAG size of output: 290 [2021-06-11 15:48:24,693 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 289 [2021-06-11 15:48:24,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:24,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:24,986 WARN L205 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-06-11 15:48:25,268 WARN L205 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-06-11 15:48:25,829 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-06-11 15:48:26,394 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-06-11 15:48:26,658 INFO L163 LiptonReduction]: Checked pairs total: 1290 [2021-06-11 15:48:26,658 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:48:26,658 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6067 [2021-06-11 15:48:26,659 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2021-06-11 15:48:26,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:26,659 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:26,659 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:26,660 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 15:48:26,660 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:26,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1125085489, now seen corresponding path program 1 times [2021-06-11 15:48:26,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:26,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902274114] [2021-06-11 15:48:26,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:26,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:26,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:26,782 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 15:48:26,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:48:26,793 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:48:26,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902274114] [2021-06-11 15:48:26,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:26,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:48:26,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464752432] [2021-06-11 15:48:26,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:48:26,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:26,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:48:26,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:48:26,796 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:48:26,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:26,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:26,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:48:26,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:26,832 INFO L129 PetriNetUnfolder]: 7/53 cut-off events. [2021-06-11 15:48:26,832 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 15:48:26,832 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 53 events. 7/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 128 event pairs, 1 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 75. Up to 10 conditions per place. [2021-06-11 15:48:26,833 INFO L132 encePairwiseOnDemand]: 216/221 looper letters, 3 selfloop transitions, 3 changer transitions 8/39 dead transitions. [2021-06-11 15:48:26,833 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 114 flow [2021-06-11 15:48:26,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:48:26,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:48:26,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 913 transitions. [2021-06-11 15:48:26,835 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8262443438914027 [2021-06-11 15:48:26,836 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 913 transitions. [2021-06-11 15:48:26,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 913 transitions. [2021-06-11 15:48:26,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:26,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 913 transitions. [2021-06-11 15:48:26,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.6) internal successors, (913), 5 states have internal predecessors, (913), 0 states have call successors, (0), 0 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:48:26,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:26,840 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:26,840 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 5 states and 913 transitions. [2021-06-11 15:48:26,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 114 flow [2021-06-11 15:48:26,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:48:26,841 INFO L241 Difference]: Finished difference. Result has 47 places, 31 transitions, 89 flow [2021-06-11 15:48:26,841 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2021-06-11 15:48:26,842 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-06-11 15:48:26,842 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:26,842 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 31 transitions, 89 flow [2021-06-11 15:48:26,842 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 31 transitions, 89 flow [2021-06-11 15:48:26,842 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 89 flow [2021-06-11 15:48:26,846 INFO L129 PetriNetUnfolder]: 3/43 cut-off events. [2021-06-11 15:48:26,847 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-06-11 15:48:26,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 71 conditions, 43 events. 3/43 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 84 event pairs, 1 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 62. Up to 10 conditions per place. [2021-06-11 15:48:26,847 INFO L151 LiptonReduction]: Number of co-enabled transitions 486 [2021-06-11 15:48:26,994 INFO L163 LiptonReduction]: Checked pairs total: 517 [2021-06-11 15:48:26,994 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:26,994 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 152 [2021-06-11 15:48:26,995 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 89 flow [2021-06-11 15:48:26,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:26,996 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:26,996 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:26,996 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 15:48:26,996 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:26,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1124383430, now seen corresponding path program 1 times [2021-06-11 15:48:26,996 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:26,997 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403094785] [2021-06-11 15:48:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:27,080 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:27,081 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:27,083 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:48:27,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403094785] [2021-06-11 15:48:27,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:27,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 15:48:27,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814905377] [2021-06-11 15:48:27,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:48:27,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:27,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:48:27,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:48:27,084 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 221 [2021-06-11 15:48:27,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 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:48:27,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:27,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 221 [2021-06-11 15:48:27,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:27,093 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-06-11 15:48:27,094 INFO L130 PetriNetUnfolder]: For 8/9 co-relation queries the response was YES. [2021-06-11 15:48:27,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68 conditions, 37 events. 2/37 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 2/38 useless extension candidates. Maximal degree in co-relation 57. Up to 8 conditions per place. [2021-06-11 15:48:27,094 INFO L132 encePairwiseOnDemand]: 218/221 looper letters, 1 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2021-06-11 15:48:27,094 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 31 transitions, 95 flow [2021-06-11 15:48:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:48:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:48:27,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions. [2021-06-11 15:48:27,096 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8793363499245852 [2021-06-11 15:48:27,096 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 583 transitions. [2021-06-11 15:48:27,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions. [2021-06-11 15:48:27,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:27,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions. [2021-06-11 15:48:27,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,099 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,099 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 89 flow. Second operand 3 states and 583 transitions. [2021-06-11 15:48:27,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 31 transitions, 95 flow [2021-06-11 15:48:27,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 88 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 15:48:27,100 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 90 flow [2021-06-11 15:48:27,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-06-11 15:48:27,100 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2021-06-11 15:48:27,100 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:27,100 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 90 flow [2021-06-11 15:48:27,101 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 90 flow [2021-06-11 15:48:27,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 90 flow [2021-06-11 15:48:27,104 INFO L129 PetriNetUnfolder]: 2/37 cut-off events. [2021-06-11 15:48:27,104 INFO L130 PetriNetUnfolder]: For 2/3 co-relation queries the response was YES. [2021-06-11 15:48:27,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 37 events. 2/37 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 1 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 52. Up to 8 conditions per place. [2021-06-11 15:48:27,105 INFO L151 LiptonReduction]: Number of co-enabled transitions 484 [2021-06-11 15:48:27,107 INFO L163 LiptonReduction]: Checked pairs total: 485 [2021-06-11 15:48:27,107 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:27,107 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 15:48:27,107 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 90 flow [2021-06-11 15:48:27,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 193.66666666666666) internal successors, (581), 3 states have internal predecessors, (581), 0 states have call successors, (0), 0 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:48:27,108 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:27,108 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:27,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 15:48:27,108 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:27,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:27,108 INFO L82 PathProgramCache]: Analyzing trace with hash 493389083, now seen corresponding path program 1 times [2021-06-11 15:48:27,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:27,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617659485] [2021-06-11 15:48:27,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:27,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:27,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:48:27,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:27,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:27,175 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:48:27,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617659485] [2021-06-11 15:48:27,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:27,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:48:27,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494462421] [2021-06-11 15:48:27,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:48:27,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:27,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:48:27,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:48:27,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 221 [2021-06-11 15:48:27,177 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:48:27,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:27,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 221 [2021-06-11 15:48:27,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:27,268 INFO L129 PetriNetUnfolder]: 283/497 cut-off events. [2021-06-11 15:48:27,268 INFO L130 PetriNetUnfolder]: For 102/190 co-relation queries the response was YES. [2021-06-11 15:48:27,271 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 497 events. 283/497 cut-off events. For 102/190 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2528 event pairs, 216 based on Foata normal form. 6/450 useless extension candidates. Maximal degree in co-relation 1024. Up to 389 conditions per place. [2021-06-11 15:48:27,273 INFO L132 encePairwiseOnDemand]: 217/221 looper letters, 11 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2021-06-11 15:48:27,273 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 128 flow [2021-06-11 15:48:27,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:48:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:48:27,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 507 transitions. [2021-06-11 15:48:27,275 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7647058823529411 [2021-06-11 15:48:27,275 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 507 transitions. [2021-06-11 15:48:27,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 507 transitions. [2021-06-11 15:48:27,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:27,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 507 transitions. [2021-06-11 15:48:27,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 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:48:27,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,278 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,278 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 90 flow. Second operand 3 states and 507 transitions. [2021-06-11 15:48:27,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 128 flow [2021-06-11 15:48:27,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 36 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 15:48:27,280 INFO L241 Difference]: Finished difference. Result has 44 places, 33 transitions, 105 flow [2021-06-11 15:48:27,281 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=105, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2021-06-11 15:48:27,281 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -4 predicate places. [2021-06-11 15:48:27,281 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:27,281 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 33 transitions, 105 flow [2021-06-11 15:48:27,281 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 33 transitions, 105 flow [2021-06-11 15:48:27,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 105 flow [2021-06-11 15:48:27,290 INFO L129 PetriNetUnfolder]: 6/54 cut-off events. [2021-06-11 15:48:27,290 INFO L130 PetriNetUnfolder]: For 14/15 co-relation queries the response was YES. [2021-06-11 15:48:27,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 54 events. 6/54 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 167 event pairs, 3 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 91. Up to 13 conditions per place. [2021-06-11 15:48:27,291 INFO L151 LiptonReduction]: Number of co-enabled transitions 550 [2021-06-11 15:48:27,444 INFO L163 LiptonReduction]: Checked pairs total: 411 [2021-06-11 15:48:27,444 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:27,444 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 163 [2021-06-11 15:48:27,445 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 105 flow [2021-06-11 15:48:27,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 states have internal predecessors, (659), 0 states have call successors, (0), 0 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:48:27,445 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:27,445 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:27,445 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 15:48:27,445 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:27,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1157444446, now seen corresponding path program 1 times [2021-06-11 15:48:27,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:27,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142599004] [2021-06-11 15:48:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:27,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:27,491 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:27,491 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:27,507 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-06-11 15:48:27,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-06-11 15:48:27,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:27,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:27,528 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:48:27,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142599004] [2021-06-11 15:48:27,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:27,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:48:27,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825225505] [2021-06-11 15:48:27,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:48:27,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:27,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:48:27,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:48:27,530 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 221 [2021-06-11 15:48:27,531 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 105 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:48:27,531 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:27,531 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 221 [2021-06-11 15:48:27,531 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:27,646 INFO L129 PetriNetUnfolder]: 291/513 cut-off events. [2021-06-11 15:48:27,646 INFO L130 PetriNetUnfolder]: For 267/375 co-relation queries the response was YES. [2021-06-11 15:48:27,648 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1217 conditions, 513 events. 291/513 cut-off events. For 267/375 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2627 event pairs, 192 based on Foata normal form. 9/473 useless extension candidates. Maximal degree in co-relation 1204. Up to 389 conditions per place. [2021-06-11 15:48:27,650 INFO L132 encePairwiseOnDemand]: 214/221 looper letters, 12 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2021-06-11 15:48:27,650 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 161 flow [2021-06-11 15:48:27,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:48:27,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:48:27,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 692 transitions. [2021-06-11 15:48:27,652 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7828054298642534 [2021-06-11 15:48:27,652 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 692 transitions. [2021-06-11 15:48:27,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 692 transitions. [2021-06-11 15:48:27,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:27,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 692 transitions. [2021-06-11 15:48:27,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:48:27,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,655 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,655 INFO L185 Difference]: Start difference. First operand has 44 places, 33 transitions, 105 flow. Second operand 4 states and 692 transitions. [2021-06-11 15:48:27,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 161 flow [2021-06-11 15:48:27,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 15:48:27,657 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 141 flow [2021-06-11 15:48:27,657 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2021-06-11 15:48:27,657 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-06-11 15:48:27,657 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:27,657 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 141 flow [2021-06-11 15:48:27,658 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 141 flow [2021-06-11 15:48:27,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 141 flow [2021-06-11 15:48:27,677 INFO L129 PetriNetUnfolder]: 85/204 cut-off events. [2021-06-11 15:48:27,677 INFO L130 PetriNetUnfolder]: For 193/215 co-relation queries the response was YES. [2021-06-11 15:48:27,678 INFO L84 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 204 events. 85/204 cut-off events. For 193/215 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 971 event pairs, 48 based on Foata normal form. 4/187 useless extension candidates. Maximal degree in co-relation 492. Up to 128 conditions per place. [2021-06-11 15:48:27,679 INFO L151 LiptonReduction]: Number of co-enabled transitions 634 [2021-06-11 15:48:27,682 INFO L163 LiptonReduction]: Checked pairs total: 351 [2021-06-11 15:48:27,682 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:27,682 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-06-11 15:48:27,683 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 141 flow [2021-06-11 15:48:27,683 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:48:27,683 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:27,683 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:27,683 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 15:48:27,683 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:27,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:27,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1658636453, now seen corresponding path program 1 times [2021-06-11 15:48:27,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:27,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476942040] [2021-06-11 15:48:27,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:27,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:27,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:27,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:27,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:27,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:27,738 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:27,743 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:48:27,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476942040] [2021-06-11 15:48:27,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:27,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:48:27,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749486079] [2021-06-11 15:48:27,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:48:27,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:27,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:48:27,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:48:27,745 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 221 [2021-06-11 15:48:27,746 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,746 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:27,746 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 221 [2021-06-11 15:48:27,746 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:27,872 INFO L129 PetriNetUnfolder]: 324/574 cut-off events. [2021-06-11 15:48:27,872 INFO L130 PetriNetUnfolder]: For 610/1410 co-relation queries the response was YES. [2021-06-11 15:48:27,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1647 conditions, 574 events. 324/574 cut-off events. For 610/1410 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 2978 event pairs, 101 based on Foata normal form. 25/550 useless extension candidates. Maximal degree in co-relation 1632. Up to 352 conditions per place. [2021-06-11 15:48:27,876 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 18 selfloop transitions, 12 changer transitions 0/52 dead transitions. [2021-06-11 15:48:27,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 255 flow [2021-06-11 15:48:27,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:48:27,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:48:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 872 transitions. [2021-06-11 15:48:27,879 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7891402714932126 [2021-06-11 15:48:27,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 872 transitions. [2021-06-11 15:48:27,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 872 transitions. [2021-06-11 15:48:27,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:27,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 872 transitions. [2021-06-11 15:48:27,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,882 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:27,882 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 141 flow. Second operand 5 states and 872 transitions. [2021-06-11 15:48:27,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 255 flow [2021-06-11 15:48:27,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 244 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-06-11 15:48:27,884 INFO L241 Difference]: Finished difference. Result has 51 places, 45 transitions, 210 flow [2021-06-11 15:48:27,884 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=210, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2021-06-11 15:48:27,884 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 3 predicate places. [2021-06-11 15:48:27,885 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:27,885 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 45 transitions, 210 flow [2021-06-11 15:48:27,885 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 45 transitions, 210 flow [2021-06-11 15:48:27,885 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 45 transitions, 210 flow [2021-06-11 15:48:27,962 INFO L129 PetriNetUnfolder]: 161/335 cut-off events. [2021-06-11 15:48:27,962 INFO L130 PetriNetUnfolder]: For 872/1051 co-relation queries the response was YES. [2021-06-11 15:48:27,963 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 335 events. 161/335 cut-off events. For 872/1051 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1758 event pairs, 63 based on Foata normal form. 1/300 useless extension candidates. Maximal degree in co-relation 1108. Up to 185 conditions per place. [2021-06-11 15:48:27,966 INFO L151 LiptonReduction]: Number of co-enabled transitions 816 [2021-06-11 15:48:28,079 INFO L163 LiptonReduction]: Checked pairs total: 438 [2021-06-11 15:48:28,079 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:28,079 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 195 [2021-06-11 15:48:28,080 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 210 flow [2021-06-11 15:48:28,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:28,080 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:28,080 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:48:28,080 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 15:48:28,080 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:28,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:28,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1735244186, now seen corresponding path program 1 times [2021-06-11 15:48:28,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:28,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675879921] [2021-06-11 15:48:28,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:28,124 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:28,124 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:28,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:28,133 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:28,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:28,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:48:28,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:28,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:28,150 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:48:28,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675879921] [2021-06-11 15:48:28,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:28,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:48:28,150 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105770523] [2021-06-11 15:48:28,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:48:28,150 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:28,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:48:28,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:48:28,151 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 221 [2021-06-11 15:48:28,152 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:48:28,152 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:28,152 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 221 [2021-06-11 15:48:28,152 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:28,276 INFO L129 PetriNetUnfolder]: 368/727 cut-off events. [2021-06-11 15:48:28,276 INFO L130 PetriNetUnfolder]: For 1661/3831 co-relation queries the response was YES. [2021-06-11 15:48:28,278 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2645 conditions, 727 events. 368/727 cut-off events. For 1661/3831 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 4261 event pairs, 106 based on Foata normal form. 40/709 useless extension candidates. Maximal degree in co-relation 2628. Up to 421 conditions per place. [2021-06-11 15:48:28,282 INFO L132 encePairwiseOnDemand]: 215/221 looper letters, 17 selfloop transitions, 12 changer transitions 0/51 dead transitions. [2021-06-11 15:48:28,282 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 51 transitions, 304 flow [2021-06-11 15:48:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:48:28,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:48:28,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 716 transitions. [2021-06-11 15:48:28,284 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8099547511312217 [2021-06-11 15:48:28,284 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 716 transitions. [2021-06-11 15:48:28,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 716 transitions. [2021-06-11 15:48:28,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:28,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 716 transitions. [2021-06-11 15:48:28,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.0) internal successors, (716), 4 states have internal predecessors, (716), 0 states have call successors, (0), 0 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:48:28,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:28,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:28,287 INFO L185 Difference]: Start difference. First operand has 51 places, 45 transitions, 210 flow. Second operand 4 states and 716 transitions. [2021-06-11 15:48:28,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 51 transitions, 304 flow [2021-06-11 15:48:28,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 284 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-06-11 15:48:28,290 INFO L241 Difference]: Finished difference. Result has 54 places, 48 transitions, 256 flow [2021-06-11 15:48:28,290 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=256, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2021-06-11 15:48:28,290 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-06-11 15:48:28,290 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:28,290 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 48 transitions, 256 flow [2021-06-11 15:48:28,291 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 48 transitions, 256 flow [2021-06-11 15:48:28,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 48 transitions, 256 flow [2021-06-11 15:48:28,330 INFO L129 PetriNetUnfolder]: 174/402 cut-off events. [2021-06-11 15:48:28,330 INFO L130 PetriNetUnfolder]: For 1194/1476 co-relation queries the response was YES. [2021-06-11 15:48:28,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 402 events. 174/402 cut-off events. For 1194/1476 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2235 event pairs, 44 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 1492. Up to 226 conditions per place. [2021-06-11 15:48:28,334 INFO L151 LiptonReduction]: Number of co-enabled transitions 888 [2021-06-11 15:48:28,589 INFO L163 LiptonReduction]: Checked pairs total: 525 [2021-06-11 15:48:28,589 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:28,589 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 299 [2021-06-11 15:48:28,589 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 256 flow [2021-06-11 15:48:28,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 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:48:28,590 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:28,590 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:48:28,590 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 15:48:28,590 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1728001579, now seen corresponding path program 1 times [2021-06-11 15:48:28,590 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:28,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704283764] [2021-06-11 15:48:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:28,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:28,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:28,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:28,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:48:28,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:28,635 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:28,635 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:48:28,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704283764] [2021-06-11 15:48:28,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:28,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:48:28,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936281247] [2021-06-11 15:48:28,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:48:28,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:28,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:48:28,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:48:28,637 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:48:28,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:28,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:28,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:48:28,638 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:28,877 INFO L129 PetriNetUnfolder]: 989/1866 cut-off events. [2021-06-11 15:48:28,877 INFO L130 PetriNetUnfolder]: For 2885/3600 co-relation queries the response was YES. [2021-06-11 15:48:28,883 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5073 conditions, 1866 events. 989/1866 cut-off events. For 2885/3600 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 14033 event pairs, 313 based on Foata normal form. 120/1619 useless extension candidates. Maximal degree in co-relation 5054. Up to 815 conditions per place. [2021-06-11 15:48:28,891 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 10 selfloop transitions, 12 changer transitions 0/62 dead transitions. [2021-06-11 15:48:28,891 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 328 flow [2021-06-11 15:48:28,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:48:28,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:48:28,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 924 transitions. [2021-06-11 15:48:28,894 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8361990950226245 [2021-06-11 15:48:28,894 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 924 transitions. [2021-06-11 15:48:28,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 924 transitions. [2021-06-11 15:48:28,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:28,894 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 924 transitions. [2021-06-11 15:48:28,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.8) internal successors, (924), 5 states have internal predecessors, (924), 0 states have call successors, (0), 0 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:48:28,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:28,898 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:28,898 INFO L185 Difference]: Start difference. First operand has 54 places, 48 transitions, 256 flow. Second operand 5 states and 924 transitions. [2021-06-11 15:48:28,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 328 flow [2021-06-11 15:48:28,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 309 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-11 15:48:28,902 INFO L241 Difference]: Finished difference. Result has 59 places, 58 transitions, 321 flow [2021-06-11 15:48:28,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=321, PETRI_PLACES=59, PETRI_TRANSITIONS=58} [2021-06-11 15:48:28,902 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2021-06-11 15:48:28,902 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:28,903 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 58 transitions, 321 flow [2021-06-11 15:48:28,903 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 58 transitions, 321 flow [2021-06-11 15:48:28,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 58 transitions, 321 flow [2021-06-11 15:48:29,044 INFO L129 PetriNetUnfolder]: 912/1806 cut-off events. [2021-06-11 15:48:29,044 INFO L130 PetriNetUnfolder]: For 4389/6095 co-relation queries the response was YES. [2021-06-11 15:48:29,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6129 conditions, 1806 events. 912/1806 cut-off events. For 4389/6095 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 13894 event pairs, 352 based on Foata normal form. 16/1509 useless extension candidates. Maximal degree in co-relation 6109. Up to 1019 conditions per place. [2021-06-11 15:48:29,067 INFO L151 LiptonReduction]: Number of co-enabled transitions 1292 [2021-06-11 15:48:29,097 INFO L163 LiptonReduction]: Checked pairs total: 529 [2021-06-11 15:48:29,097 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:29,097 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 195 [2021-06-11 15:48:29,097 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 58 transitions, 321 flow [2021-06-11 15:48:29,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:29,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:29,098 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:29,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 15:48:29,098 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:29,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1891351930, now seen corresponding path program 1 times [2021-06-11 15:48:29,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:29,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238711470] [2021-06-11 15:48:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:29,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:29,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:29,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:29,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:48:29,205 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.1 percent of original size [2021-06-11 15:48:29,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-06-11 15:48:29,230 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-06-11 15:48:29,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-06-11 15:48:29,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:29,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 15:48:29,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:29,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 15:48:29,277 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:48:29,278 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238711470] [2021-06-11 15:48:29,278 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:29,278 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:48:29,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730871936] [2021-06-11 15:48:29,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 15:48:29,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:29,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 15:48:29,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-11 15:48:29,280 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 221 [2021-06-11 15:48:29,280 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 58 transitions, 321 flow. Second operand has 8 states, 8 states have (on average 160.875) internal successors, (1287), 8 states have internal predecessors, (1287), 0 states have call successors, (0), 0 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:48:29,280 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:29,280 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 221 [2021-06-11 15:48:29,281 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:29,713 INFO L129 PetriNetUnfolder]: 1364/2470 cut-off events. [2021-06-11 15:48:29,713 INFO L130 PetriNetUnfolder]: For 6084/8834 co-relation queries the response was YES. [2021-06-11 15:48:29,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 2470 events. 1364/2470 cut-off events. For 6084/8834 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 17751 event pairs, 444 based on Foata normal form. 111/2265 useless extension candidates. Maximal degree in co-relation 9229. Up to 1252 conditions per place. [2021-06-11 15:48:29,738 INFO L132 encePairwiseOnDemand]: 212/221 looper letters, 36 selfloop transitions, 26 changer transitions 0/94 dead transitions. [2021-06-11 15:48:29,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 94 transitions, 701 flow [2021-06-11 15:48:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:48:29,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:48:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1155 transitions. [2021-06-11 15:48:29,741 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.746606334841629 [2021-06-11 15:48:29,742 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1155 transitions. [2021-06-11 15:48:29,742 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1155 transitions. [2021-06-11 15:48:29,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:29,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1155 transitions. [2021-06-11 15:48:29,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 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:48:29,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:29,746 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:29,746 INFO L185 Difference]: Start difference. First operand has 59 places, 58 transitions, 321 flow. Second operand 7 states and 1155 transitions. [2021-06-11 15:48:29,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 94 transitions, 701 flow [2021-06-11 15:48:29,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 15:48:29,760 INFO L241 Difference]: Finished difference. Result has 68 places, 79 transitions, 569 flow [2021-06-11 15:48:29,760 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=569, PETRI_PLACES=68, PETRI_TRANSITIONS=79} [2021-06-11 15:48:29,760 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 20 predicate places. [2021-06-11 15:48:29,760 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:29,760 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 79 transitions, 569 flow [2021-06-11 15:48:29,761 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 79 transitions, 569 flow [2021-06-11 15:48:29,761 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 79 transitions, 569 flow [2021-06-11 15:48:29,962 INFO L129 PetriNetUnfolder]: 1147/2253 cut-off events. [2021-06-11 15:48:29,962 INFO L130 PetriNetUnfolder]: For 6764/8821 co-relation queries the response was YES. [2021-06-11 15:48:29,973 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8190 conditions, 2253 events. 1147/2253 cut-off events. For 6764/8821 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 17948 event pairs, 433 based on Foata normal form. 32/1911 useless extension candidates. Maximal degree in co-relation 8165. Up to 1324 conditions per place. [2021-06-11 15:48:29,996 INFO L151 LiptonReduction]: Number of co-enabled transitions 1616 [2021-06-11 15:48:30,049 INFO L163 LiptonReduction]: Checked pairs total: 1208 [2021-06-11 15:48:30,049 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:30,049 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 289 [2021-06-11 15:48:30,050 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 79 transitions, 569 flow [2021-06-11 15:48:30,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 160.875) internal successors, (1287), 8 states have internal predecessors, (1287), 0 states have call successors, (0), 0 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:48:30,051 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:30,051 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:48:30,051 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 15:48:30,051 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:30,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:30,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1680241306, now seen corresponding path program 1 times [2021-06-11 15:48:30,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:30,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488255102] [2021-06-11 15:48:30,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:30,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:30,116 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:30,118 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:30,119 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:30,121 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:30,122 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:48:30,126 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:30,127 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:30,127 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:48:30,127 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488255102] [2021-06-11 15:48:30,127 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:30,127 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:48:30,127 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301169403] [2021-06-11 15:48:30,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 15:48:30,128 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:30,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 15:48:30,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 15:48:30,129 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:48:30,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 79 transitions, 569 flow. Second operand has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:30,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:30,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:48:30,129 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:30,338 INFO L129 PetriNetUnfolder]: 883/1829 cut-off events. [2021-06-11 15:48:30,338 INFO L130 PetriNetUnfolder]: For 5247/10262 co-relation queries the response was YES. [2021-06-11 15:48:30,348 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7431 conditions, 1829 events. 883/1829 cut-off events. For 5247/10262 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 14289 event pairs, 83 based on Foata normal form. 607/2197 useless extension candidates. Maximal degree in co-relation 7404. Up to 1122 conditions per place. [2021-06-11 15:48:30,360 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 11 selfloop transitions, 22 changer transitions 0/90 dead transitions. [2021-06-11 15:48:30,360 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 90 transitions, 690 flow [2021-06-11 15:48:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:48:30,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:48:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1294 transitions. [2021-06-11 15:48:30,363 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8364576599870718 [2021-06-11 15:48:30,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1294 transitions. [2021-06-11 15:48:30,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1294 transitions. [2021-06-11 15:48:30,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:30,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1294 transitions. [2021-06-11 15:48:30,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 184.85714285714286) internal successors, (1294), 7 states have internal predecessors, (1294), 0 states have call successors, (0), 0 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:48:30,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:30,368 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:30,368 INFO L185 Difference]: Start difference. First operand has 68 places, 79 transitions, 569 flow. Second operand 7 states and 1294 transitions. [2021-06-11 15:48:30,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 90 transitions, 690 flow [2021-06-11 15:48:30,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 90 transitions, 662 flow, removed 8 selfloop flow, removed 1 redundant places. [2021-06-11 15:48:30,380 INFO L241 Difference]: Finished difference. Result has 76 places, 86 transitions, 667 flow [2021-06-11 15:48:30,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=515, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=667, PETRI_PLACES=76, PETRI_TRANSITIONS=86} [2021-06-11 15:48:30,380 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 28 predicate places. [2021-06-11 15:48:30,380 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:30,381 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 86 transitions, 667 flow [2021-06-11 15:48:30,381 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 86 transitions, 667 flow [2021-06-11 15:48:30,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 76 places, 86 transitions, 667 flow [2021-06-11 15:48:30,526 INFO L129 PetriNetUnfolder]: 871/1825 cut-off events. [2021-06-11 15:48:30,527 INFO L130 PetriNetUnfolder]: For 10618/17608 co-relation queries the response was YES. [2021-06-11 15:48:30,536 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8528 conditions, 1825 events. 871/1825 cut-off events. For 10618/17608 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 14552 event pairs, 104 based on Foata normal form. 54/1607 useless extension candidates. Maximal degree in co-relation 8499. Up to 1138 conditions per place. [2021-06-11 15:48:30,554 INFO L151 LiptonReduction]: Number of co-enabled transitions 1950 [2021-06-11 15:48:30,578 INFO L163 LiptonReduction]: Checked pairs total: 1246 [2021-06-11 15:48:30,579 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:30,579 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 199 [2021-06-11 15:48:30,579 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 86 transitions, 667 flow [2021-06-11 15:48:30,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 180.8) internal successors, (904), 5 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:30,580 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:30,580 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:30,580 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 15:48:30,580 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1243535402, now seen corresponding path program 1 times [2021-06-11 15:48:30,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:30,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397538225] [2021-06-11 15:48:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:30,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:30,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 15:48:30,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:30,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 15:48:30,666 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-11 15:48:30,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 15:48:30,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:30,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:30,696 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:30,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:30,698 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:48:30,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397538225] [2021-06-11 15:48:30,698 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:30,698 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 15:48:30,698 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100671862] [2021-06-11 15:48:30,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:48:30,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:30,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:48:30,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:48:30,699 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 221 [2021-06-11 15:48:30,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 86 transitions, 667 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 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:48:30,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:30,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 221 [2021-06-11 15:48:30,700 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:30,974 INFO L129 PetriNetUnfolder]: 1036/2101 cut-off events. [2021-06-11 15:48:30,974 INFO L130 PetriNetUnfolder]: For 13974/22295 co-relation queries the response was YES. [2021-06-11 15:48:30,987 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10276 conditions, 2101 events. 1036/2101 cut-off events. For 13974/22295 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 16273 event pairs, 112 based on Foata normal form. 215/2039 useless extension candidates. Maximal degree in co-relation 10245. Up to 1232 conditions per place. [2021-06-11 15:48:30,998 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 37 selfloop transitions, 25 changer transitions 0/104 dead transitions. [2021-06-11 15:48:30,998 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 104 transitions, 973 flow [2021-06-11 15:48:30,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 15:48:30,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 15:48:31,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 852 transitions. [2021-06-11 15:48:31,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7710407239819005 [2021-06-11 15:48:31,001 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 852 transitions. [2021-06-11 15:48:31,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 852 transitions. [2021-06-11 15:48:31,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:31,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 852 transitions. [2021-06-11 15:48:31,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.4) internal successors, (852), 5 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:31,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:31,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:31,004 INFO L185 Difference]: Start difference. First operand has 76 places, 86 transitions, 667 flow. Second operand 5 states and 852 transitions. [2021-06-11 15:48:31,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 104 transitions, 973 flow [2021-06-11 15:48:31,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 104 transitions, 919 flow, removed 17 selfloop flow, removed 3 redundant places. [2021-06-11 15:48:31,056 INFO L241 Difference]: Finished difference. Result has 79 places, 95 transitions, 786 flow [2021-06-11 15:48:31,057 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=786, PETRI_PLACES=79, PETRI_TRANSITIONS=95} [2021-06-11 15:48:31,057 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2021-06-11 15:48:31,057 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:31,057 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 95 transitions, 786 flow [2021-06-11 15:48:31,057 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 95 transitions, 786 flow [2021-06-11 15:48:31,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 95 transitions, 786 flow [2021-06-11 15:48:31,195 INFO L129 PetriNetUnfolder]: 887/1908 cut-off events. [2021-06-11 15:48:31,195 INFO L130 PetriNetUnfolder]: For 9278/11660 co-relation queries the response was YES. [2021-06-11 15:48:31,205 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8041 conditions, 1908 events. 887/1908 cut-off events. For 9278/11660 co-relation queries the response was YES. Maximal size of possible extension queue 272. Compared 15801 event pairs, 94 based on Foata normal form. 72/1715 useless extension candidates. Maximal degree in co-relation 8010. Up to 906 conditions per place. [2021-06-11 15:48:31,223 INFO L151 LiptonReduction]: Number of co-enabled transitions 2320 [2021-06-11 15:48:31,264 INFO L163 LiptonReduction]: Checked pairs total: 1491 [2021-06-11 15:48:31,264 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:31,264 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 207 [2021-06-11 15:48:31,267 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 95 transitions, 786 flow [2021-06-11 15:48:31,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 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:48:31,267 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:31,267 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:31,267 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 15:48:31,268 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:31,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:31,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1461083627, now seen corresponding path program 1 times [2021-06-11 15:48:31,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:31,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843646892] [2021-06-11 15:48:31,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:31,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:31,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:31,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:31,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:31,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:31,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:31,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:31,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:48:31,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:31,352 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:31,353 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:48:31,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843646892] [2021-06-11 15:48:31,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:31,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:48:31,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956289748] [2021-06-11 15:48:31,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 15:48:31,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 15:48:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 15:48:31,354 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:48:31,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 95 transitions, 786 flow. Second operand has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:31,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:31,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:48:31,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:31,577 INFO L129 PetriNetUnfolder]: 793/1693 cut-off events. [2021-06-11 15:48:31,577 INFO L130 PetriNetUnfolder]: For 9172/17654 co-relation queries the response was YES. [2021-06-11 15:48:31,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8043 conditions, 1693 events. 793/1693 cut-off events. For 9172/17654 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 13479 event pairs, 9 based on Foata normal form. 911/2372 useless extension candidates. Maximal degree in co-relation 8010. Up to 793 conditions per place. [2021-06-11 15:48:31,599 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 6 selfloop transitions, 32 changer transitions 4/105 dead transitions. [2021-06-11 15:48:31,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 105 transitions, 961 flow [2021-06-11 15:48:31,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 15:48:31,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 15:48:31,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1664 transitions. [2021-06-11 15:48:31,603 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2021-06-11 15:48:31,603 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1664 transitions. [2021-06-11 15:48:31,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1664 transitions. [2021-06-11 15:48:31,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:31,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1664 transitions. [2021-06-11 15:48:31,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 184.88888888888889) internal successors, (1664), 9 states have internal predecessors, (1664), 0 states have call successors, (0), 0 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:48:31,608 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:31,608 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:31,608 INFO L185 Difference]: Start difference. First operand has 79 places, 95 transitions, 786 flow. Second operand 9 states and 1664 transitions. [2021-06-11 15:48:31,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 105 transitions, 961 flow [2021-06-11 15:48:31,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 105 transitions, 918 flow, removed 10 selfloop flow, removed 2 redundant places. [2021-06-11 15:48:31,645 INFO L241 Difference]: Finished difference. Result has 88 places, 101 transitions, 897 flow [2021-06-11 15:48:31,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=897, PETRI_PLACES=88, PETRI_TRANSITIONS=101} [2021-06-11 15:48:31,647 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 40 predicate places. [2021-06-11 15:48:31,647 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:31,647 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 101 transitions, 897 flow [2021-06-11 15:48:31,647 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 101 transitions, 897 flow [2021-06-11 15:48:31,648 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 101 transitions, 897 flow [2021-06-11 15:48:31,765 INFO L129 PetriNetUnfolder]: 768/1662 cut-off events. [2021-06-11 15:48:31,765 INFO L130 PetriNetUnfolder]: For 10013/12134 co-relation queries the response was YES. [2021-06-11 15:48:31,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8284 conditions, 1662 events. 768/1662 cut-off events. For 10013/12134 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 13631 event pairs, 8 based on Foata normal form. 19/1468 useless extension candidates. Maximal degree in co-relation 8249. Up to 761 conditions per place. [2021-06-11 15:48:31,790 INFO L151 LiptonReduction]: Number of co-enabled transitions 2492 [2021-06-11 15:48:31,807 INFO L163 LiptonReduction]: Checked pairs total: 1567 [2021-06-11 15:48:31,807 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:31,807 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 160 [2021-06-11 15:48:31,808 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 101 transitions, 897 flow [2021-06-11 15:48:31,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 180.83333333333334) internal successors, (1085), 6 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:31,808 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:31,808 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:31,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 15:48:31,808 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:31,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:31,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1132287237, now seen corresponding path program 1 times [2021-06-11 15:48:31,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:31,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046779977] [2021-06-11 15:48:31,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:31,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:31,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:31,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:31,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:31,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:31,866 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:31,868 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:48:31,868 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046779977] [2021-06-11 15:48:31,868 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:31,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 15:48:31,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217919977] [2021-06-11 15:48:31,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 15:48:31,869 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 15:48:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 15:48:31,870 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 221 [2021-06-11 15:48:31,871 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 101 transitions, 897 flow. Second operand has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:31,871 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:31,871 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 221 [2021-06-11 15:48:31,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:32,179 INFO L129 PetriNetUnfolder]: 1536/3312 cut-off events. [2021-06-11 15:48:32,179 INFO L130 PetriNetUnfolder]: For 19690/23194 co-relation queries the response was YES. [2021-06-11 15:48:32,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16461 conditions, 3312 events. 1536/3312 cut-off events. For 19690/23194 co-relation queries the response was YES. Maximal size of possible extension queue 516. Compared 30245 event pairs, 16 based on Foata normal form. 37/2932 useless extension candidates. Maximal degree in co-relation 16424. Up to 1526 conditions per place. [2021-06-11 15:48:32,206 INFO L132 encePairwiseOnDemand]: 218/221 looper letters, 4 selfloop transitions, 2 changer transitions 0/103 dead transitions. [2021-06-11 15:48:32,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 103 transitions, 933 flow [2021-06-11 15:48:32,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 15:48:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 15:48:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 763 transitions. [2021-06-11 15:48:32,209 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631221719457014 [2021-06-11 15:48:32,209 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 763 transitions. [2021-06-11 15:48:32,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 763 transitions. [2021-06-11 15:48:32,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:32,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 763 transitions. [2021-06-11 15:48:32,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 190.75) internal successors, (763), 4 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:32,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:32,223 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:32,223 INFO L185 Difference]: Start difference. First operand has 88 places, 101 transitions, 897 flow. Second operand 4 states and 763 transitions. [2021-06-11 15:48:32,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 103 transitions, 933 flow [2021-06-11 15:48:32,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 103 transitions, 825 flow, removed 34 selfloop flow, removed 5 redundant places. [2021-06-11 15:48:32,479 INFO L241 Difference]: Finished difference. Result has 88 places, 102 transitions, 802 flow [2021-06-11 15:48:32,479 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=802, PETRI_PLACES=88, PETRI_TRANSITIONS=102} [2021-06-11 15:48:32,479 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 40 predicate places. [2021-06-11 15:48:32,479 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:32,479 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 102 transitions, 802 flow [2021-06-11 15:48:32,479 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 102 transitions, 802 flow [2021-06-11 15:48:32,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 88 places, 102 transitions, 802 flow [2021-06-11 15:48:32,695 INFO L129 PetriNetUnfolder]: 1535/3310 cut-off events. [2021-06-11 15:48:32,695 INFO L130 PetriNetUnfolder]: For 11002/12531 co-relation queries the response was YES. [2021-06-11 15:48:32,713 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12760 conditions, 3310 events. 1535/3310 cut-off events. For 11002/12531 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 30378 event pairs, 15 based on Foata normal form. 43/2940 useless extension candidates. Maximal degree in co-relation 12724. Up to 1064 conditions per place. [2021-06-11 15:48:32,744 INFO L151 LiptonReduction]: Number of co-enabled transitions 2538 [2021-06-11 15:48:32,763 INFO L163 LiptonReduction]: Checked pairs total: 672 [2021-06-11 15:48:32,763 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:32,763 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 284 [2021-06-11 15:48:32,763 INFO L480 AbstractCegarLoop]: Abstraction has has 88 places, 102 transitions, 802 flow [2021-06-11 15:48:32,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 190.0) internal successors, (760), 4 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:32,764 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:32,764 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:32,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 15:48:32,764 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:32,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:32,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1246094763, now seen corresponding path program 2 times [2021-06-11 15:48:32,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:32,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484180940] [2021-06-11 15:48:32,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:32,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:32,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:32,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:32,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:32,816 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:32,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:32,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:32,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:32,825 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:32,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 15:48:32,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:32,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:32,831 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:48:32,831 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484180940] [2021-06-11 15:48:32,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:32,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 15:48:32,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530184858] [2021-06-11 15:48:32,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:48:32,832 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:32,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:48:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:48:32,833 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 221 [2021-06-11 15:48:32,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 102 transitions, 802 flow. Second operand has 7 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:32,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:32,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 221 [2021-06-11 15:48:32,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:33,285 INFO L129 PetriNetUnfolder]: 1509/3228 cut-off events. [2021-06-11 15:48:33,285 INFO L130 PetriNetUnfolder]: For 13663/23029 co-relation queries the response was YES. [2021-06-11 15:48:33,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14857 conditions, 3228 events. 1509/3228 cut-off events. For 13663/23029 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 29362 event pairs, 6 based on Foata normal form. 1333/4141 useless extension candidates. Maximal degree in co-relation 14819. Up to 1064 conditions per place. [2021-06-11 15:48:33,320 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 2 selfloop transitions, 37 changer transitions 5/108 dead transitions. [2021-06-11 15:48:33,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 108 transitions, 955 flow [2021-06-11 15:48:33,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 15:48:33,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 15:48:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2026 transitions. [2021-06-11 15:48:33,324 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8334018922254216 [2021-06-11 15:48:33,324 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2026 transitions. [2021-06-11 15:48:33,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2026 transitions. [2021-06-11 15:48:33,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:33,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2026 transitions. [2021-06-11 15:48:33,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 184.1818181818182) internal successors, (2026), 11 states have internal predecessors, (2026), 0 states have call successors, (0), 0 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:48:33,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 221.0) internal successors, (2652), 12 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:33,330 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 221.0) internal successors, (2652), 12 states have internal predecessors, (2652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:33,330 INFO L185 Difference]: Start difference. First operand has 88 places, 102 transitions, 802 flow. Second operand 11 states and 2026 transitions. [2021-06-11 15:48:33,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 108 transitions, 955 flow [2021-06-11 15:48:33,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 108 transitions, 934 flow, removed 9 selfloop flow, removed 2 redundant places. [2021-06-11 15:48:33,532 INFO L241 Difference]: Finished difference. Result has 99 places, 103 transitions, 885 flow [2021-06-11 15:48:33,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=885, PETRI_PLACES=99, PETRI_TRANSITIONS=103} [2021-06-11 15:48:33,532 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 51 predicate places. [2021-06-11 15:48:33,532 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:33,532 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 103 transitions, 885 flow [2021-06-11 15:48:33,532 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 103 transitions, 885 flow [2021-06-11 15:48:33,533 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 103 transitions, 885 flow [2021-06-11 15:48:33,741 INFO L129 PetriNetUnfolder]: 1497/3208 cut-off events. [2021-06-11 15:48:33,741 INFO L130 PetriNetUnfolder]: For 13907/16556 co-relation queries the response was YES. [2021-06-11 15:48:33,765 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14819 conditions, 3208 events. 1497/3208 cut-off events. For 13907/16556 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 29835 event pairs, 6 based on Foata normal form. 42/2855 useless extension candidates. Maximal degree in co-relation 14780. Up to 1064 conditions per place. [2021-06-11 15:48:33,800 INFO L151 LiptonReduction]: Number of co-enabled transitions 2482 [2021-06-11 15:48:33,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:33,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:33,870 INFO L163 LiptonReduction]: Checked pairs total: 1409 [2021-06-11 15:48:33,870 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 15:48:33,870 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 338 [2021-06-11 15:48:33,871 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 102 transitions, 883 flow [2021-06-11 15:48:33,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 180.85714285714286) internal successors, (1266), 7 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:33,871 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:33,871 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:33,871 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 15:48:33,871 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:33,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:33,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1328711084, now seen corresponding path program 1 times [2021-06-11 15:48:33,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:33,872 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474594706] [2021-06-11 15:48:33,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:33,938 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:33,939 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 15:48:33,944 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:33,944 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 15:48:33,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:33,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 15:48:33,960 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:33,960 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:48:33,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:33,964 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 15:48:33,968 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:48:33,968 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474594706] [2021-06-11 15:48:33,969 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:33,969 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 15:48:33,969 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549858133] [2021-06-11 15:48:33,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 15:48:33,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:33,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 15:48:33,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 15:48:33,971 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 223 [2021-06-11 15:48:33,971 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 102 transitions, 883 flow. Second operand has 7 states, 7 states have (on average 167.57142857142858) internal successors, (1173), 7 states have internal predecessors, (1173), 0 states have call successors, (0), 0 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:48:33,971 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:33,972 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 223 [2021-06-11 15:48:33,972 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:34,580 INFO L129 PetriNetUnfolder]: 2884/5915 cut-off events. [2021-06-11 15:48:34,580 INFO L130 PetriNetUnfolder]: For 53976/62663 co-relation queries the response was YES. [2021-06-11 15:48:34,619 INFO L84 FinitePrefix]: Finished finitePrefix Result has 27692 conditions, 5915 events. 2884/5915 cut-off events. For 53976/62663 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 57074 event pairs, 27 based on Foata normal form. 586/5703 useless extension candidates. Maximal degree in co-relation 27651. Up to 1776 conditions per place. [2021-06-11 15:48:34,638 INFO L132 encePairwiseOnDemand]: 215/223 looper letters, 101 selfloop transitions, 26 changer transitions 1/179 dead transitions. [2021-06-11 15:48:34,638 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 179 transitions, 1864 flow [2021-06-11 15:48:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 15:48:34,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 15:48:34,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1198 transitions. [2021-06-11 15:48:34,640 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7674567584881486 [2021-06-11 15:48:34,641 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1198 transitions. [2021-06-11 15:48:34,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1198 transitions. [2021-06-11 15:48:34,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:34,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1198 transitions. [2021-06-11 15:48:34,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.14285714285714) internal successors, (1198), 7 states have internal predecessors, (1198), 0 states have call successors, (0), 0 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:48:34,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 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:48:34,644 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 223.0) internal successors, (1784), 8 states have internal predecessors, (1784), 0 states have call successors, (0), 0 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:48:34,644 INFO L185 Difference]: Start difference. First operand has 97 places, 102 transitions, 883 flow. Second operand 7 states and 1198 transitions. [2021-06-11 15:48:34,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 179 transitions, 1864 flow [2021-06-11 15:48:35,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 179 transitions, 1741 flow, removed 27 selfloop flow, removed 10 redundant places. [2021-06-11 15:48:35,503 INFO L241 Difference]: Finished difference. Result has 97 places, 119 transitions, 1038 flow [2021-06-11 15:48:35,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1038, PETRI_PLACES=97, PETRI_TRANSITIONS=119} [2021-06-11 15:48:35,503 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 49 predicate places. [2021-06-11 15:48:35,503 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:35,503 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 119 transitions, 1038 flow [2021-06-11 15:48:35,503 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 119 transitions, 1038 flow [2021-06-11 15:48:35,504 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 119 transitions, 1038 flow [2021-06-11 15:48:35,882 INFO L129 PetriNetUnfolder]: 2674/5637 cut-off events. [2021-06-11 15:48:35,882 INFO L130 PetriNetUnfolder]: For 16369/18247 co-relation queries the response was YES. [2021-06-11 15:48:35,917 INFO L84 FinitePrefix]: Finished finitePrefix Result has 22329 conditions, 5637 events. 2674/5637 cut-off events. For 16369/18247 co-relation queries the response was YES. Maximal size of possible extension queue 942. Compared 56933 event pairs, 20 based on Foata normal form. 54/4936 useless extension candidates. Maximal degree in co-relation 22289. Up to 1840 conditions per place. [2021-06-11 15:48:35,974 INFO L151 LiptonReduction]: Number of co-enabled transitions 2756 [2021-06-11 15:48:35,993 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:48:35,993 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:35,993 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 490 [2021-06-11 15:48:35,993 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 119 transitions, 1038 flow [2021-06-11 15:48:35,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 167.57142857142858) internal successors, (1173), 7 states have internal predecessors, (1173), 0 states have call successors, (0), 0 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:48:35,994 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:35,994 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:35,994 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 15:48:35,994 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:35,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:35,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1728177876, now seen corresponding path program 1 times [2021-06-11 15:48:35,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:35,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124470086] [2021-06-11 15:48:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 15:48:36,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:36,038 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 15:48:36,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 15:48:36,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 15:48:36,041 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:48:36,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124470086] [2021-06-11 15:48:36,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 15:48:36,041 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 15:48:36,041 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270552187] [2021-06-11 15:48:36,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 15:48:36,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 15:48:36,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 15:48:36,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 15:48:36,042 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 223 [2021-06-11 15:48:36,042 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 119 transitions, 1038 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 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:48:36,042 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 15:48:36,043 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 223 [2021-06-11 15:48:36,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 15:48:36,689 INFO L129 PetriNetUnfolder]: 4206/8647 cut-off events. [2021-06-11 15:48:36,689 INFO L130 PetriNetUnfolder]: For 23992/25977 co-relation queries the response was YES. [2021-06-11 15:48:36,740 INFO L84 FinitePrefix]: Finished finitePrefix Result has 34247 conditions, 8647 events. 4206/8647 cut-off events. For 23992/25977 co-relation queries the response was YES. Maximal size of possible extension queue 1560. Compared 90192 event pairs, 32 based on Foata normal form. 91/7495 useless extension candidates. Maximal degree in co-relation 34205. Up to 2848 conditions per place. [2021-06-11 15:48:36,751 INFO L132 encePairwiseOnDemand]: 220/223 looper letters, 3 selfloop transitions, 3 changer transitions 21/119 dead transitions. [2021-06-11 15:48:36,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 119 transitions, 1050 flow [2021-06-11 15:48:36,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 15:48:36,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 15:48:36,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 579 transitions. [2021-06-11 15:48:36,753 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8654708520179372 [2021-06-11 15:48:36,753 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 579 transitions. [2021-06-11 15:48:36,753 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 579 transitions. [2021-06-11 15:48:36,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 15:48:36,754 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 579 transitions. [2021-06-11 15:48:36,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 193.0) internal successors, (579), 3 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 15:48:36,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 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:48:36,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 0 states have call successors, (0), 0 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:48:36,755 INFO L185 Difference]: Start difference. First operand has 97 places, 119 transitions, 1038 flow. Second operand 3 states and 579 transitions. [2021-06-11 15:48:36,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 119 transitions, 1050 flow [2021-06-11 15:48:38,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 119 transitions, 1042 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-06-11 15:48:38,129 INFO L241 Difference]: Finished difference. Result has 100 places, 98 transitions, 808 flow [2021-06-11 15:48:38,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=100, PETRI_TRANSITIONS=98} [2021-06-11 15:48:38,129 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 52 predicate places. [2021-06-11 15:48:38,129 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 15:48:38,129 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 98 transitions, 808 flow [2021-06-11 15:48:38,130 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 98 transitions, 808 flow [2021-06-11 15:48:38,130 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 98 transitions, 808 flow [2021-06-11 15:48:38,635 INFO L129 PetriNetUnfolder]: 3779/7707 cut-off events. [2021-06-11 15:48:38,635 INFO L130 PetriNetUnfolder]: For 20532/22730 co-relation queries the response was YES. [2021-06-11 15:48:38,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 30266 conditions, 7707 events. 3779/7707 cut-off events. For 20532/22730 co-relation queries the response was YES. Maximal size of possible extension queue 1498. Compared 80457 event pairs, 64 based on Foata normal form. 34/6630 useless extension candidates. Maximal degree in co-relation 30224. Up to 2608 conditions per place. [2021-06-11 15:48:38,849 INFO L151 LiptonReduction]: Number of co-enabled transitions 2044 [2021-06-11 15:48:38,979 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 15:48:38,979 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 15:48:38,979 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 850 [2021-06-11 15:48:38,980 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 808 flow [2021-06-11 15:48:38,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 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:48:38,980 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 15:48:38,980 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 15:48:38,980 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 15:48:38,980 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 15:48:38,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 15:48:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash 625869022, now seen corresponding path program 2 times [2021-06-11 15:48:38,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 15:48:38,981 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77478697] [2021-06-11 15:48:38,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 15:48:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:48:39,031 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:48:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 15:48:39,063 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 15:48:39,091 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 15:48:39,092 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 15:48:39,092 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 15:48:39,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 03:48:39 BasicIcfg [2021-06-11 15:48:39,184 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 15:48:39,184 INFO L168 Benchmark]: Toolchain (without parser) took 29615.27 ms. Allocated memory was 346.0 MB in the beginning and 1.3 GB in the end (delta: 958.4 MB). Free memory was 307.8 MB in the beginning and 1.0 GB in the end (delta: -710.7 MB). Peak memory consumption was 249.6 MB. Max. memory is 16.0 GB. [2021-06-11 15:48:39,184 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 346.0 MB. Free memory was 326.0 MB in the beginning and 326.0 MB in the end (delta: 72.5 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 15:48:39,184 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.17 ms. Allocated memory is still 346.0 MB. Free memory was 307.6 MB in the beginning and 303.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-06-11 15:48:39,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.85 ms. Allocated memory is still 346.0 MB. Free memory was 303.3 MB in the beginning and 300.2 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:48:39,188 INFO L168 Benchmark]: Boogie Preprocessor took 27.50 ms. Allocated memory is still 346.0 MB. Free memory was 300.2 MB in the beginning and 298.1 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:48:39,188 INFO L168 Benchmark]: RCFGBuilder took 1509.27 ms. Allocated memory is still 346.0 MB. Free memory was 298.1 MB in the beginning and 205.3 MB in the end (delta: 92.8 MB). Peak memory consumption was 135.8 MB. Max. memory is 16.0 GB. [2021-06-11 15:48:39,188 INFO L168 Benchmark]: TraceAbstraction took 27555.98 ms. Allocated memory was 346.0 MB in the beginning and 1.3 GB in the end (delta: 958.4 MB). Free memory was 204.2 MB in the beginning and 1.0 GB in the end (delta: -814.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB. [2021-06-11 15:48:39,191 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.12 ms. Allocated memory is still 346.0 MB. Free memory was 326.0 MB in the beginning and 326.0 MB in the end (delta: 72.5 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 474.17 ms. Allocated memory is still 346.0 MB. Free memory was 307.6 MB in the beginning and 303.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 43.85 ms. Allocated memory is still 346.0 MB. Free memory was 303.3 MB in the beginning and 300.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 27.50 ms. Allocated memory is still 346.0 MB. Free memory was 300.2 MB in the beginning and 298.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1509.27 ms. Allocated memory is still 346.0 MB. Free memory was 298.1 MB in the beginning and 205.3 MB in the end (delta: 92.8 MB). Peak memory consumption was 135.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 27555.98 ms. Allocated memory was 346.0 MB in the beginning and 1.3 GB in the end (delta: 958.4 MB). Free memory was 204.2 MB in the beginning and 1.0 GB in the end (delta: -814.2 MB). Peak memory consumption was 144.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8514.0ms, 126 PlacesBefore, 48 PlacesAfterwards, 115 TransitionsBefore, 36 TransitionsAfterwards, 2868 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 9067 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3630, positive: 3394, positive conditional: 3394, positive unconditional: 0, negative: 236, negative conditional: 236, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3630, positive: 3394, positive conditional: 0, positive unconditional: 3394, negative: 236, negative conditional: 0, negative unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3630, positive: 3394, positive conditional: 0, positive unconditional: 3394, negative: 236, negative conditional: 0, negative unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2239, positive: 2173, positive conditional: 0, positive unconditional: 2173, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2239, positive: 2126, positive conditional: 0, positive unconditional: 2126, negative: 113, negative conditional: 0, negative unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 113, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 982, positive: 92, positive conditional: 0, positive unconditional: 92, negative: 890, negative conditional: 0, negative unconditional: 890, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3630, positive: 1221, positive conditional: 0, positive unconditional: 1221, negative: 170, negative conditional: 0, negative unconditional: 170, unknown: 2239, unknown conditional: 0, unknown unconditional: 2239] , Statistics on independence cache: Total cache size (in pairs): 2239, Positive cache size: 2173, Positive conditional cache size: 0, Positive unconditional cache size: 2173, Negative cache size: 66, Negative conditional cache size: 0, Negative unconditional cache size: 66, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6066.8ms, 44 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1290 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 277, positive: 217, positive conditional: 217, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 277, positive: 217, positive conditional: 4, positive unconditional: 213, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 277, positive: 217, positive conditional: 4, positive unconditional: 213, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 50, positive: 36, positive conditional: 1, positive unconditional: 35, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 50, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 257, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 245, negative conditional: 0, negative unconditional: 245, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 277, positive: 181, positive conditional: 3, positive unconditional: 178, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 50, unknown conditional: 1, unknown unconditional: 49] , Statistics on independence cache: Total cache size (in pairs): 2289, Positive cache size: 2209, Positive conditional cache size: 1, Positive unconditional cache size: 2208, Negative cache size: 80, Negative conditional cache size: 0, Negative unconditional cache size: 80, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 152.1ms, 47 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 486 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 517 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 110, positive: 85, positive conditional: 85, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 110, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 110, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 144, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 144, negative conditional: 0, negative unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 110, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 2303, Positive cache size: 2218, Positive conditional cache size: 1, Positive unconditional cache size: 2217, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 484 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 485 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 117, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 117, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 117, positive: 94, positive conditional: 0, positive unconditional: 94, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 117, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 2312, Positive cache size: 2227, Positive conditional cache size: 1, Positive unconditional cache size: 2226, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85, Eliminated conditions: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 162.7ms, 44 PlacesBefore, 44 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 550 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 411 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, positive: 121, positive conditional: 121, 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: 140, positive: 121, positive conditional: 10, positive unconditional: 111, negative: 19, negative conditional: 3, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 140, positive: 121, positive conditional: 10, positive unconditional: 111, negative: 19, negative conditional: 3, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 18, positive conditional: 7, positive unconditional: 11, negative: 10, negative conditional: 3, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 16, positive conditional: 0, positive unconditional: 16, 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: 2, positive unconditional: 0, negative: 10, negative conditional: 3, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 148, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 123, negative conditional: 47, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 140, positive: 103, positive conditional: 3, positive unconditional: 100, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 28, unknown conditional: 10, unknown unconditional: 18] , Statistics on independence cache: Total cache size (in pairs): 2340, Positive cache size: 2245, Positive conditional cache size: 8, Positive unconditional cache size: 2237, Negative cache size: 95, Negative conditional cache size: 3, Negative unconditional cache size: 92, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.3ms, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 634 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 351 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, positive: 138, positive conditional: 138, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 152, positive: 138, positive conditional: 17, positive unconditional: 121, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 152, positive: 138, positive conditional: 17, positive unconditional: 121, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 152, positive: 136, positive conditional: 17, positive unconditional: 119, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2342, Positive cache size: 2247, Positive conditional cache size: 8, Positive unconditional cache size: 2239, Negative cache size: 95, Negative conditional cache size: 3, Negative unconditional cache size: 92, Eliminated conditions: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 194.2ms, 51 PlacesBefore, 51 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 816 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 438 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 161, positive: 146, positive conditional: 146, 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: 161, positive: 146, positive conditional: 36, positive unconditional: 110, 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: 161, positive: 146, positive conditional: 36, positive unconditional: 110, 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: 9, positive: 7, positive conditional: 6, positive unconditional: 1, 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: 9, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 107, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 161, positive: 139, positive conditional: 30, positive unconditional: 109, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 9, unknown conditional: 6, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2351, Positive cache size: 2254, Positive conditional cache size: 14, Positive unconditional cache size: 2240, Negative cache size: 97, Negative conditional cache size: 3, Negative unconditional cache size: 94, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 298.2ms, 54 PlacesBefore, 54 PlacesAfterwards, 48 TransitionsBefore, 48 TransitionsAfterwards, 888 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 525 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 189, positive: 172, positive conditional: 172, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 189, positive: 172, positive conditional: 53, positive unconditional: 119, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 172, positive conditional: 53, positive unconditional: 119, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 16, positive conditional: 11, positive unconditional: 5, 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: 18, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 248, positive: 190, positive conditional: 190, positive unconditional: 0, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, positive: 156, positive conditional: 42, positive unconditional: 114, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 18, unknown conditional: 11, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 2369, Positive cache size: 2270, Positive conditional cache size: 25, Positive unconditional cache size: 2245, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 194.1ms, 59 PlacesBefore, 59 PlacesAfterwards, 58 TransitionsBefore, 58 TransitionsAfterwards, 1292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 529 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183, positive: 169, positive conditional: 169, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 183, positive: 169, positive conditional: 60, positive unconditional: 109, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 183, positive: 169, positive conditional: 60, positive unconditional: 109, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 183, positive: 165, positive conditional: 58, positive unconditional: 107, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2373, Positive cache size: 2274, Positive conditional cache size: 27, Positive unconditional cache size: 2247, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 288.5ms, 68 PlacesBefore, 68 PlacesAfterwards, 79 TransitionsBefore, 79 TransitionsAfterwards, 1616 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1208 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 606, positive: 580, positive conditional: 580, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 606, positive: 580, positive conditional: 314, positive unconditional: 266, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 606, positive: 580, positive conditional: 314, positive unconditional: 266, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 2, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, 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: 606, positive: 575, positive conditional: 312, positive unconditional: 263, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 5, unknown conditional: 2, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 2378, Positive cache size: 2279, Positive conditional cache size: 29, Positive unconditional cache size: 2250, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 56 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 197.9ms, 76 PlacesBefore, 76 PlacesAfterwards, 86 TransitionsBefore, 86 TransitionsAfterwards, 1950 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1246 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 532, positive: 508, positive conditional: 508, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 532, positive: 508, positive conditional: 336, positive unconditional: 172, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 532, positive: 508, positive conditional: 336, positive unconditional: 172, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 8, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, 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: 532, positive: 498, positive conditional: 328, positive unconditional: 170, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 10, unknown conditional: 8, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 2388, Positive cache size: 2289, Positive conditional cache size: 37, Positive unconditional cache size: 2252, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 207.2ms, 79 PlacesBefore, 79 PlacesAfterwards, 95 TransitionsBefore, 95 TransitionsAfterwards, 2320 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1491 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 400, positive: 373, positive conditional: 373, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 400, positive: 373, positive conditional: 202, positive unconditional: 171, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 400, positive: 373, positive conditional: 202, positive unconditional: 171, negative: 27, negative conditional: 0, negative unconditional: 27, 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: 400, positive: 373, positive conditional: 202, positive unconditional: 171, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2388, Positive cache size: 2289, Positive conditional cache size: 37, Positive unconditional cache size: 2252, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 159.9ms, 88 PlacesBefore, 88 PlacesAfterwards, 101 TransitionsBefore, 101 TransitionsAfterwards, 2492 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1567 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 343, positive: 317, positive conditional: 317, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 343, positive: 317, positive conditional: 168, positive unconditional: 149, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 343, positive: 317, positive conditional: 168, positive unconditional: 149, negative: 26, negative conditional: 0, negative unconditional: 26, 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: 343, positive: 317, positive conditional: 168, positive unconditional: 149, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2388, Positive cache size: 2289, Positive conditional cache size: 37, Positive unconditional cache size: 2252, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 52 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 283.7ms, 88 PlacesBefore, 88 PlacesAfterwards, 102 TransitionsBefore, 102 TransitionsAfterwards, 2538 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 672 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, positive: 125, positive conditional: 125, 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: 136, positive: 125, positive conditional: 89, positive unconditional: 36, 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: 136, positive: 125, positive conditional: 89, positive unconditional: 36, 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: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 136, positive: 122, positive conditional: 87, positive unconditional: 35, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 3, unknown conditional: 2, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2391, Positive cache size: 2292, Positive conditional cache size: 39, Positive unconditional cache size: 2253, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 337.8ms, 99 PlacesBefore, 97 PlacesAfterwards, 103 TransitionsBefore, 102 TransitionsAfterwards, 2482 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1409 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 390, positive: 368, positive conditional: 368, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 390, positive: 368, positive conditional: 274, positive unconditional: 94, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 390, positive: 368, positive conditional: 274, positive unconditional: 94, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 31, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 37, positive: 37, positive conditional: 0, positive unconditional: 37, 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: 390, positive: 331, positive conditional: 243, positive unconditional: 88, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 37, unknown conditional: 31, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 2428, Positive cache size: 2329, Positive conditional cache size: 70, Positive unconditional cache size: 2259, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 58 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 489.4ms, 97 PlacesBefore, 97 PlacesAfterwards, 119 TransitionsBefore, 119 TransitionsAfterwards, 2756 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): 2428, Positive cache size: 2329, Positive conditional cache size: 70, Positive unconditional cache size: 2259, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 849.3ms, 100 PlacesBefore, 99 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 2044 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): 2428, Positive cache size: 2329, Positive conditional cache size: 70, Positive unconditional cache size: 2259, Negative cache size: 99, Negative conditional cache size: 3, Negative unconditional cache size: 96, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L856] 0 pthread_t t1185; [L857] FCALL, FORK 0 pthread_create(&t1185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L858] 0 pthread_t t1186; [L859] FCALL, FORK 0 pthread_create(&t1186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 2 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L860] 0 pthread_t t1187; [L861] FCALL, FORK 0 pthread_create(&t1187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L862] 0 pthread_t t1188; [L863] FCALL, FORK 0 pthread_create(&t1188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L822] 4 z = 2 [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L792] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L762] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L812] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L834] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L834] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L835] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L835] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L836] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L837] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L838] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L838] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L869] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L869] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L870] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L871] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L871] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L872] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L872] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L873] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L873] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L876] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L877] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L878] 0 x$flush_delayed = weak$$choice2 [L879] 0 x$mem_tmp = x [L880] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L880] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L881] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L881] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L882] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L882] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L883] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L883] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L884] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L885] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L885] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L886] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L886] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L888] 0 x = x$flush_delayed ? x$mem_tmp : x [L889] 0 x$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_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 27363.4ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 7275.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8593.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 87 SDtfs, 61 SDslu, 40 SDs, 0 SdLazy, 537 SolverSat, 151 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 509.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 405.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1038occurred in iteration=15, InterpolantAutomatonStates: 85, 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: 40.7ms SsaConstructionTime, 485.7ms SatisfiabilityAnalysisTime, 817.1ms InterpolantComputationTime, 311 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 1905 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...