/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:52:37,616 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:52:37,619 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:52:37,652 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:52:37,652 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:52:37,653 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:52:37,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:52:37,662 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:52:37,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:52:37,668 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:52:37,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:52:37,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:52:37,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:52:37,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:52:37,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:52:37,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:52:37,673 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:52:37,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:52:37,675 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:52:37,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:52:37,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:52:37,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:52:37,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:52:37,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:52:37,695 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:52:37,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:52:37,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:52:37,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:52:37,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:52:37,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:52:37,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:52:37,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:52:37,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:52:37,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:52:37,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:52:37,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:52:37,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:52:37,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:52:37,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:52:37,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:52:37,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:52:37,708 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:52:37,743 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:52:37,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:52:37,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:52:37,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:52:37,747 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:52:37,747 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:52:37,747 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:52:37,747 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:52:37,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:52:37,748 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:52:37,748 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:52:37,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:52:37,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:52:37,749 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:52:37,749 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:52:37,749 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:52:37,749 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:52:37,749 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:52:37,749 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:52:37,750 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:52:37,750 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:52:37,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:52:37,750 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:52:37,750 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:52:37,750 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:52:37,750 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:52:37,750 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:52:37,751 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:52:37,751 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:52:37,751 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-03-25 14:52:38,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:52:38,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:52:38,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:52:38,074 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:52:38,074 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:52:38,079 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2021-03-25 14:52:38,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ccb8aa4/b3c3b8d2ee1e4c2d871eb7aa3635e31d/FLAGf717643d5 [2021-03-25 14:52:38,683 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:52:38,683 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i [2021-03-25 14:52:38,700 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ccb8aa4/b3c3b8d2ee1e4c2d871eb7aa3635e31d/FLAGf717643d5 [2021-03-25 14:52:39,131 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ccb8aa4/b3c3b8d2ee1e4c2d871eb7aa3635e31d [2021-03-25 14:52:39,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:52:39,134 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:52:39,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:52:39,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:52:39,141 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:52:39,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b83a7c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39, skipping insertion in model container [2021-03-25 14:52:39,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:52:39,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:52:39,286 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/safe011_pso.oepc.i[950,963] [2021-03-25 14:52:39,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:52:39,483 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:52:39,491 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.oepc.i[950,963] [2021-03-25 14:52:39,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:52:39,596 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:52:39,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39 WrapperNode [2021-03-25 14:52:39,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:52:39,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:52:39,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:52:39,600 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:52:39,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,652 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:52:39,659 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:52:39,659 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:52:39,659 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:52:39,666 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,691 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... [2021-03-25 14:52:39,697 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:52:39,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:52:39,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:52:39,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:52:39,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:52:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:52:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:52:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:52:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:52:39,766 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:52:39,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:52:39,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:52:39,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:52:39,767 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:52:39,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:52:39,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:52:39,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:52:39,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:52:39,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:52:39,769 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:52:41,492 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:52:41,493 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:52:41,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:52:41 BoogieIcfgContainer [2021-03-25 14:52:41,495 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:52:41,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:52:41,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:52:41,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:52:41,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:52:39" (1/3) ... [2021-03-25 14:52:41,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4099faf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:52:41, skipping insertion in model container [2021-03-25 14:52:41,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:52:39" (2/3) ... [2021-03-25 14:52:41,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4099faf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:52:41, skipping insertion in model container [2021-03-25 14:52:41,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:52:41" (3/3) ... [2021-03-25 14:52:41,502 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_pso.oepc.i [2021-03-25 14:52:41,508 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:52:41,511 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:52:41,512 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:52:41,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,545 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,548 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,548 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,550 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,556 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,557 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,559 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,559 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,559 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:52:41,560 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:52:41,574 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:52:41,590 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:52:41,590 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:52:41,590 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:52:41,590 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:52:41,590 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:52:41,590 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:52:41,590 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:52:41,591 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:52:41,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 14:52:41,628 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 14:52:41,629 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:41,632 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:52:41,632 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-25 14:52:41,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-25 14:52:41,637 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:41,647 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 14:52:41,649 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-25 14:52:41,650 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-25 14:52:41,665 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-25 14:52:41,666 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:41,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-25 14:52:41,668 INFO L142 LiptonReduction]: Number of co-enabled transitions 1694 [2021-03-25 14:52:43,392 WARN L205 SmtUtils]: Spent 752.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2021-03-25 14:52:43,742 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 14:52:45,219 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 14:52:45,781 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 14:52:46,000 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:52:46,394 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:52:46,521 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:52:47,546 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:52:47,853 WARN L205 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 14:52:48,493 WARN L205 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:52:49,124 WARN L205 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:52:49,351 INFO L154 LiptonReduction]: Checked pairs total: 3065 [2021-03-25 14:52:49,352 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-25 14:52:49,353 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7717 [2021-03-25 14:52:49,361 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2021-03-25 14:52:49,362 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:49,362 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:49,362 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:49,363 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:49,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:49,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1571617397, now seen corresponding path program 1 times [2021-03-25 14:52:49,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:49,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154122607] [2021-03-25 14:52:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:49,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:49,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:49,596 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:49,596 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:49,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:49,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154122607] [2021-03-25 14:52:49,602 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:49,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:49,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663987486] [2021-03-25 14:52:49,609 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:49,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:49,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:49,621 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 161 [2021-03-25 14:52:49,623 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:49,623 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:49,624 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 161 [2021-03-25 14:52:49,625 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:49,708 INFO L129 PetriNetUnfolder]: 69/200 cut-off events. [2021-03-25 14:52:49,708 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:49,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 328 conditions, 200 events. 69/200 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 953 event pairs, 54 based on Foata normal form. 11/193 useless extension candidates. Maximal degree in co-relation 309. Up to 89 conditions per place. [2021-03-25 14:52:49,711 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-25 14:52:49,711 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-25 14:52:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2021-03-25 14:52:49,723 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8964803312629399 [2021-03-25 14:52:49,724 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2021-03-25 14:52:49,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2021-03-25 14:52:49,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:49,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2021-03-25 14:52:49,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:49,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:49,740 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:49,742 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 433 transitions. [2021-03-25 14:52:49,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-25 14:52:49,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:52:49,746 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-25 14:52:49,747 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-25 14:52:49,748 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 14:52:49,748 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:49,748 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:52:49,749 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:52:49,749 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-25 14:52:49,753 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:52:49,754 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:49,754 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 39 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:52:49,754 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-25 14:52:50,490 WARN L205 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:52:50,823 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:52:52,042 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 266 DAG size of output: 265 [2021-03-25 14:52:52,617 WARN L205 SmtUtils]: Spent 573.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:52:53,020 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-25 14:52:53,177 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2021-03-25 14:52:53,228 INFO L154 LiptonReduction]: Checked pairs total: 942 [2021-03-25 14:52:53,228 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-25 14:52:53,228 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3480 [2021-03-25 14:52:53,229 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-25 14:52:53,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:53,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:53,230 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:53,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:52:53,230 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:53,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:53,231 INFO L82 PathProgramCache]: Analyzing trace with hash -72729481, now seen corresponding path program 1 times [2021-03-25 14:52:53,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:53,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646792319] [2021-03-25 14:52:53,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:53,338 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:53,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:53,339 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:53,339 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:53,346 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:52:53,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:52:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:53,351 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646792319] [2021-03-25 14:52:53,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:53,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:53,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866849435] [2021-03-25 14:52:53,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:53,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:53,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:53,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:53,354 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 169 [2021-03-25 14:52:53,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:53,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:53,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 169 [2021-03-25 14:52:53,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:53,370 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:52:53,370 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:53,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 78 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-03-25 14:52:53,371 INFO L132 encePairwiseOnDemand]: 165/169 looper letters, 3 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2021-03-25 14:52:53,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 26 transitions, 74 flow [2021-03-25 14:52:53,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:53,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:53,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2021-03-25 14:52:53,375 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8599605522682445 [2021-03-25 14:52:53,375 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 436 transitions. [2021-03-25 14:52:53,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 436 transitions. [2021-03-25 14:52:53,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:53,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 436 transitions. [2021-03-25 14:52:53,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:53,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:53,378 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:53,378 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 436 transitions. [2021-03-25 14:52:53,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 26 transitions, 74 flow [2021-03-25 14:52:53,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 26 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:53,379 INFO L241 Difference]: Finished difference. Result has 34 places, 26 transitions, 73 flow [2021-03-25 14:52:53,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2021-03-25 14:52:53,380 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-25 14:52:53,380 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:53,380 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-25 14:52:53,381 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 26 transitions, 73 flow [2021-03-25 14:52:53,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 26 transitions, 73 flow [2021-03-25 14:52:53,385 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:52:53,385 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:52:53,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 36 events. 3/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-03-25 14:52:53,386 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-25 14:52:53,917 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 14:52:54,054 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:52:54,382 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 14:52:54,509 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 14:52:54,513 INFO L154 LiptonReduction]: Checked pairs total: 792 [2021-03-25 14:52:54,513 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:52:54,514 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1134 [2021-03-25 14:52:54,514 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2021-03-25 14:52:54,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,515 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:54,515 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:54,515 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:52:54,515 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash -999718679, now seen corresponding path program 1 times [2021-03-25 14:52:54,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:54,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237701102] [2021-03-25 14:52:54,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:54,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:54,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:54,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:54,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237701102] [2021-03-25 14:52:54,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:54,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:52:54,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955248916] [2021-03-25 14:52:54,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:54,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:54,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:54,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:54,621 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 171 [2021-03-25 14:52:54,622 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,622 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:54,622 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 171 [2021-03-25 14:52:54,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:54,639 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-25 14:52:54,639 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 14:52:54,639 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 34 events. 3/34 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2021-03-25 14:52:54,640 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-03-25 14:52:54,640 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 75 flow [2021-03-25 14:52:54,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:54,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-03-25 14:52:54,642 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8908382066276803 [2021-03-25 14:52:54,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-03-25 14:52:54,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-03-25 14:52:54,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:54,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-03-25 14:52:54,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,646 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,646 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 457 transitions. [2021-03-25 14:52:54,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 75 flow [2021-03-25 14:52:54,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:54,647 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2021-03-25 14:52:54,647 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-03-25 14:52:54,648 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-25 14:52:54,648 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:54,648 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-25 14:52:54,648 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 74 flow [2021-03-25 14:52:54,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 74 flow [2021-03-25 14:52:54,653 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-25 14:52:54,653 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 14:52:54,653 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 80 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-25 14:52:54,654 INFO L142 LiptonReduction]: Number of co-enabled transitions 268 [2021-03-25 14:52:54,655 INFO L154 LiptonReduction]: Checked pairs total: 250 [2021-03-25 14:52:54,655 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:54,656 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 14:52:54,656 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2021-03-25 14:52:54,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,657 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:54,657 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:54,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:52:54,657 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:54,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:54,658 INFO L82 PathProgramCache]: Analyzing trace with hash 476868744, now seen corresponding path program 1 times [2021-03-25 14:52:54,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:54,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660435214] [2021-03-25 14:52:54,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:54,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:54,721 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:54,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:54,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:54,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:54,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:54,729 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660435214] [2021-03-25 14:52:54,730 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:54,730 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:52:54,730 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896334063] [2021-03-25 14:52:54,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:54,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:54,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:54,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:54,732 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 171 [2021-03-25 14:52:54,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 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-03-25 14:52:54,733 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:54,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 171 [2021-03-25 14:52:54,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:54,756 INFO L129 PetriNetUnfolder]: 2/43 cut-off events. [2021-03-25 14:52:54,756 INFO L130 PetriNetUnfolder]: For 18/21 co-relation queries the response was YES. [2021-03-25 14:52:54,757 INFO L84 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 43 events. 2/43 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 139 event pairs, 0 based on Foata normal form. 4/45 useless extension candidates. Maximal degree in co-relation 69. Up to 8 conditions per place. [2021-03-25 14:52:54,757 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-25 14:52:54,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 89 flow [2021-03-25 14:52:54,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:54,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2021-03-25 14:52:54,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8581871345029239 [2021-03-25 14:52:54,759 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2021-03-25 14:52:54,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2021-03-25 14:52:54,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:54,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2021-03-25 14:52:54,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.75) internal successors, (587), 4 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,762 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,763 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 4 states and 587 transitions. [2021-03-25 14:52:54,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 89 flow [2021-03-25 14:52:54,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 25 transitions, 83 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:54,764 INFO L241 Difference]: Finished difference. Result has 37 places, 25 transitions, 89 flow [2021-03-25 14:52:54,764 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=89, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2021-03-25 14:52:54,764 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -11 predicate places. [2021-03-25 14:52:54,764 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:54,764 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 25 transitions, 89 flow [2021-03-25 14:52:54,765 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 25 transitions, 89 flow [2021-03-25 14:52:54,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 25 transitions, 89 flow [2021-03-25 14:52:54,770 INFO L129 PetriNetUnfolder]: 2/43 cut-off events. [2021-03-25 14:52:54,770 INFO L130 PetriNetUnfolder]: For 19/28 co-relation queries the response was YES. [2021-03-25 14:52:54,770 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 43 events. 2/43 cut-off events. For 19/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 138 event pairs, 0 based on Foata normal form. 1/42 useless extension candidates. Maximal degree in co-relation 74. Up to 8 conditions per place. [2021-03-25 14:52:54,771 INFO L142 LiptonReduction]: Number of co-enabled transitions 278 [2021-03-25 14:52:54,773 INFO L154 LiptonReduction]: Checked pairs total: 258 [2021-03-25 14:52:54,773 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:54,773 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 14:52:54,774 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 89 flow [2021-03-25 14:52:54,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 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-03-25 14:52:54,774 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:54,774 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:54,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:52:54,775 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1062075708, now seen corresponding path program 1 times [2021-03-25 14:52:54,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:54,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951399887] [2021-03-25 14:52:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:54,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:54,871 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:54,880 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:54,881 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:54,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:54,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951399887] [2021-03-25 14:52:54,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:54,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:52:54,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959957833] [2021-03-25 14:52:54,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:52:54,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:54,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:52:54,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:52:54,886 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 171 [2021-03-25 14:52:54,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:54,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 171 [2021-03-25 14:52:54,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:54,962 INFO L129 PetriNetUnfolder]: 154/326 cut-off events. [2021-03-25 14:52:54,962 INFO L130 PetriNetUnfolder]: For 331/386 co-relation queries the response was YES. [2021-03-25 14:52:54,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 326 events. 154/326 cut-off events. For 331/386 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1710 event pairs, 116 based on Foata normal form. 10/310 useless extension candidates. Maximal degree in co-relation 692. Up to 244 conditions per place. [2021-03-25 14:52:54,967 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 9 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-25 14:52:54,967 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 121 flow [2021-03-25 14:52:54,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:52:54,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:52:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2021-03-25 14:52:54,969 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8031189083820662 [2021-03-25 14:52:54,969 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2021-03-25 14:52:54,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2021-03-25 14:52:54,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:54,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2021-03-25 14:52:54,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,972 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:54,972 INFO L185 Difference]: Start difference. First operand has 37 places, 25 transitions, 89 flow. Second operand 3 states and 412 transitions. [2021-03-25 14:52:54,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 121 flow [2021-03-25 14:52:54,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 117 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:54,976 INFO L241 Difference]: Finished difference. Result has 38 places, 27 transitions, 104 flow [2021-03-25 14:52:54,976 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2021-03-25 14:52:54,976 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -10 predicate places. [2021-03-25 14:52:54,976 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:54,976 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 27 transitions, 104 flow [2021-03-25 14:52:54,977 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 27 transitions, 104 flow [2021-03-25 14:52:54,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 27 transitions, 104 flow [2021-03-25 14:52:54,984 INFO L129 PetriNetUnfolder]: 10/65 cut-off events. [2021-03-25 14:52:54,985 INFO L130 PetriNetUnfolder]: For 66/80 co-relation queries the response was YES. [2021-03-25 14:52:54,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 65 events. 10/65 cut-off events. For 66/80 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 257 event pairs, 2 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 132. Up to 17 conditions per place. [2021-03-25 14:52:54,986 INFO L142 LiptonReduction]: Number of co-enabled transitions 300 [2021-03-25 14:52:55,088 INFO L154 LiptonReduction]: Checked pairs total: 178 [2021-03-25 14:52:55,088 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:55,088 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 112 [2021-03-25 14:52:55,089 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 104 flow [2021-03-25 14:52:55,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,090 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:55,090 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:55,090 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:52:55,090 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:55,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:55,091 INFO L82 PathProgramCache]: Analyzing trace with hash -2054710621, now seen corresponding path program 1 times [2021-03-25 14:52:55,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:55,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061325715] [2021-03-25 14:52:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:55,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:52:55,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 14:52:55,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,216 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:52:55,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:55,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061325715] [2021-03-25 14:52:55,230 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:55,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:55,230 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076416956] [2021-03-25 14:52:55,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:55,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:55,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:55,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:55,232 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 171 [2021-03-25 14:52:55,233 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 104 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,233 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:55,233 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 171 [2021-03-25 14:52:55,233 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:55,331 INFO L129 PetriNetUnfolder]: 162/331 cut-off events. [2021-03-25 14:52:55,332 INFO L130 PetriNetUnfolder]: For 513/580 co-relation queries the response was YES. [2021-03-25 14:52:55,333 INFO L84 FinitePrefix]: Finished finitePrefix Result has 828 conditions, 331 events. 162/331 cut-off events. For 513/580 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1659 event pairs, 50 based on Foata normal form. 17/327 useless extension candidates. Maximal degree in co-relation 813. Up to 257 conditions per place. [2021-03-25 14:52:55,335 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 10 selfloop transitions, 8 changer transitions 0/35 dead transitions. [2021-03-25 14:52:55,335 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 164 flow [2021-03-25 14:52:55,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:55,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2021-03-25 14:52:55,337 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7733918128654971 [2021-03-25 14:52:55,337 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2021-03-25 14:52:55,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2021-03-25 14:52:55,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:55,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2021-03-25 14:52:55,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,341 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,342 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 104 flow. Second operand 4 states and 529 transitions. [2021-03-25 14:52:55,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 164 flow [2021-03-25 14:52:55,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 159 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:55,344 INFO L241 Difference]: Finished difference. Result has 42 places, 34 transitions, 160 flow [2021-03-25 14:52:55,344 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2021-03-25 14:52:55,344 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -6 predicate places. [2021-03-25 14:52:55,345 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:55,345 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 34 transitions, 160 flow [2021-03-25 14:52:55,345 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 34 transitions, 160 flow [2021-03-25 14:52:55,345 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 160 flow [2021-03-25 14:52:55,383 INFO L129 PetriNetUnfolder]: 42/173 cut-off events. [2021-03-25 14:52:55,383 INFO L130 PetriNetUnfolder]: For 232/274 co-relation queries the response was YES. [2021-03-25 14:52:55,384 INFO L84 FinitePrefix]: Finished finitePrefix Result has 429 conditions, 173 events. 42/173 cut-off events. For 232/274 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 997 event pairs, 8 based on Foata normal form. 5/167 useless extension candidates. Maximal degree in co-relation 413. Up to 50 conditions per place. [2021-03-25 14:52:55,385 INFO L142 LiptonReduction]: Number of co-enabled transitions 382 [2021-03-25 14:52:55,429 INFO L154 LiptonReduction]: Checked pairs total: 106 [2021-03-25 14:52:55,429 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:55,429 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 84 [2021-03-25 14:52:55,434 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 160 flow [2021-03-25 14:52:55,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,435 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:55,435 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:55,435 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:52:55,435 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:55,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:55,436 INFO L82 PathProgramCache]: Analyzing trace with hash -366050313, now seen corresponding path program 1 times [2021-03-25 14:52:55,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:55,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440326880] [2021-03-25 14:52:55,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:55,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:52:55,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:52:55,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,545 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:55,556 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440326880] [2021-03-25 14:52:55,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:55,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:55,556 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817465582] [2021-03-25 14:52:55,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:55,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:55,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:55,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:55,558 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 171 [2021-03-25 14:52:55,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 160 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:55,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 171 [2021-03-25 14:52:55,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:55,673 INFO L129 PetriNetUnfolder]: 160/338 cut-off events. [2021-03-25 14:52:55,673 INFO L130 PetriNetUnfolder]: For 752/911 co-relation queries the response was YES. [2021-03-25 14:52:55,675 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 338 events. 160/338 cut-off events. For 752/911 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1721 event pairs, 52 based on Foata normal form. 31/348 useless extension candidates. Maximal degree in co-relation 1002. Up to 212 conditions per place. [2021-03-25 14:52:55,676 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 15 selfloop transitions, 9 changer transitions 0/41 dead transitions. [2021-03-25 14:52:55,676 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 41 transitions, 232 flow [2021-03-25 14:52:55,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:55,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:55,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2021-03-25 14:52:55,678 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7748538011695907 [2021-03-25 14:52:55,679 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2021-03-25 14:52:55,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2021-03-25 14:52:55,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:55,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2021-03-25 14:52:55,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,682 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,682 INFO L185 Difference]: Start difference. First operand has 42 places, 34 transitions, 160 flow. Second operand 4 states and 530 transitions. [2021-03-25 14:52:55,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 41 transitions, 232 flow [2021-03-25 14:52:55,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 230 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 14:52:55,685 INFO L241 Difference]: Finished difference. Result has 47 places, 37 transitions, 207 flow [2021-03-25 14:52:55,685 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=207, PETRI_PLACES=47, PETRI_TRANSITIONS=37} [2021-03-25 14:52:55,685 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2021-03-25 14:52:55,685 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:55,685 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 37 transitions, 207 flow [2021-03-25 14:52:55,686 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 37 transitions, 207 flow [2021-03-25 14:52:55,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 207 flow [2021-03-25 14:52:55,720 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1026] L834-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_453 256) 0)) (.cse19 (= (mod v_~z$r_buff0_thd0~0_316 256) 0)) (.cse20 (= (mod v_~z$r_buff1_thd0~0_255 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_96 256) 0)) (.cse12 (and .cse19 .cse20)) (.cse13 (and .cse18 .cse19)) (.cse7 (not .cse19)) (.cse17 (= (mod v_~z$w_buff0_used~0_558 256) 0))) (let ((.cse4 (not .cse17)) (.cse5 (or .cse7 (not .cse20))) (.cse8 (or .cse17 .cse19)) (.cse6 (or (not .cse18) .cse7)) (.cse3 (or .cse17 .cse12 .cse13)) (.cse0 (not .cse2))) (and (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start_main_#t~nondet33_57| v_~weak$$choice2~0_96) (= v_~z$mem_tmp~0_44 v_~z~0_278) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~x~0_59 2) (= 2 |v_ULTIMATE.start_main_#t~ite35_79|) (= v_~__unbuffered_p2_EAX~0_46 1))) 1 0) 0) 0 1)) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~ite39_109| |v_ULTIMATE.start_main_#t~ite39_110|))) (or (and .cse0 (= v_~z$w_buff1~0_197 v_~z$w_buff1~0_196) .cse1 (= |v_ULTIMATE.start_main_#t~ite40_104| |v_ULTIMATE.start_main_#t~ite40_103|)) (and (= v_~z$w_buff1~0_196 |v_ULTIMATE.start_main_#t~ite40_104|) .cse2 (or (and .cse3 .cse1 (= v_~z$w_buff1~0_197 |v_ULTIMATE.start_main_#t~ite40_104|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite39_110| |v_ULTIMATE.start_main_#t~ite40_104|) .cse5 .cse6 (= v_~z$w_buff1~0_197 |v_ULTIMATE.start_main_#t~ite39_110|)))))) (or (and (or (and (= v_~z$w_buff0~0_207 |v_ULTIMATE.start_main_#t~ite34_86|) .cse7) (and .cse8 (= v_~z$w_buff1~0_197 |v_ULTIMATE.start_main_#t~ite34_86|))) .cse4 .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite35_79|)) (and (= v_~z~0_278 |v_ULTIMATE.start_main_#t~ite35_79|) .cse3 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite34_85|))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite36_109| |v_ULTIMATE.start_main_#t~ite36_110|))) (or (and (= v_~z$w_buff0~0_206 |v_ULTIMATE.start_main_#t~ite37_106|) .cse2 (or (and (= v_~z$w_buff0~0_207 |v_ULTIMATE.start_main_#t~ite37_106|) .cse9 .cse3) (and .cse4 .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite36_110| |v_ULTIMATE.start_main_#t~ite37_106|) (= v_~z$w_buff0~0_207 |v_ULTIMATE.start_main_#t~ite36_110|)))) (and .cse0 (= v_~z$w_buff0~0_207 v_~z$w_buff0~0_206) .cse9 (= |v_ULTIMATE.start_main_#t~ite37_106| |v_ULTIMATE.start_main_#t~ite37_105|)))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite45_98| |v_ULTIMATE.start_main_#t~ite45_97|))) (or (and .cse0 .cse10 (= |v_ULTIMATE.start_main_#t~ite46_94| |v_ULTIMATE.start_main_#t~ite46_93|) (= v_~z$w_buff1_used~0_453 v_~z$w_buff1_used~0_452)) (and (let ((.cse11 (= (mod v_~z$w_buff0_used~0_557 256) 0))) (or (and .cse5 .cse6 (not .cse11) (= |v_ULTIMATE.start_main_#t~ite45_98| |v_ULTIMATE.start_main_#t~ite46_94|) (= |v_ULTIMATE.start_main_#t~ite45_98| 0)) (and (or .cse12 .cse13 .cse11) (= v_~z$w_buff1_used~0_453 |v_ULTIMATE.start_main_#t~ite46_94|) .cse10))) .cse2 (= v_~z$w_buff1_used~0_452 |v_ULTIMATE.start_main_#t~ite46_94|)))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite48_108| |v_ULTIMATE.start_main_#t~ite48_107|))) (or (and .cse14 (= v_~z$r_buff0_thd0~0_315 |v_ULTIMATE.start_main_#t~ite49_102|) .cse2 (= v_~z$r_buff0_thd0~0_316 |v_ULTIMATE.start_main_#t~ite49_102|)) (and .cse14 .cse0 (= v_~z$r_buff0_thd0~0_316 v_~z$r_buff0_thd0~0_315) (= |v_ULTIMATE.start_main_#t~ite49_102| |v_ULTIMATE.start_main_#t~ite49_101|)))) (= v_~z$flush_delayed~0_74 0) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite42_117|))) (or (and .cse0 (= v_~z$w_buff0_used~0_558 v_~z$w_buff0_used~0_557) (= |v_ULTIMATE.start_main_#t~ite43_114| |v_ULTIMATE.start_main_#t~ite43_113|) .cse15) (and (or (and .cse4 .cse5 (or (and (= |v_ULTIMATE.start_main_#t~ite42_118| 0) .cse7) (and .cse8 (= v_~z$w_buff0_used~0_558 |v_ULTIMATE.start_main_#t~ite42_118|))) .cse6 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite43_114|)) (and .cse3 .cse15 (= v_~z$w_buff0_used~0_558 |v_ULTIMATE.start_main_#t~ite43_114|))) .cse2 (= v_~z$w_buff0_used~0_557 |v_ULTIMATE.start_main_#t~ite43_114|)))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite51_104| |v_ULTIMATE.start_main_#t~ite51_103|))) (or (and (= |v_ULTIMATE.start_main_#t~ite52_99| |v_ULTIMATE.start_main_#t~ite52_100|) .cse16 .cse0 (= v_~z$r_buff1_thd0~0_255 v_~z$r_buff1_thd0~0_254)) (and .cse16 (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite52_100|) .cse2 (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite52_100|)))) (or (and (= v_~z~0_277 |v_ULTIMATE.start_main_#t~ite35_79|) .cse2) (and .cse0 (= v_~z$mem_tmp~0_44 v_~z~0_277))) (= |v_ULTIMATE.start_main_#t~nondet32_47| v_~weak$$choice0~0_23))))) InVars {ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_47|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_109|, ~z$w_buff0~0=v_~z$w_buff0~0_207, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_453, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_93|, ~z$w_buff1~0=v_~z$w_buff1~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_109|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_101|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_107|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_105|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_117|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_97|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_85|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_99|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_316, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_103|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_103|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z~0=v_~z~0_278, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_46|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_56|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_92|, ~z$w_buff1~0=v_~z$w_buff1~0_196, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_100|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_106|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_112|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_116|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_96|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_98|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_315, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_102|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|, ~z$mem_tmp~0=v_~z$mem_tmp~0_44, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_557, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_108|, ~z$w_buff0~0=v_~z$w_buff0~0_206, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_452, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_78|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_108|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_74, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_104|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_50|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_84|, ~weak$$choice0~0=v_~weak$$choice0~0_23, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_56|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_102|, ~z~0=v_~z~0_277, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~x~0=v_~x~0_59} AuxVars[|v_ULTIMATE.start_main_#t~ite45_98|, |v_ULTIMATE.start_main_#t~ite42_118|, |v_ULTIMATE.start_main_#t~ite52_100|, |v_ULTIMATE.start_main_#t~ite46_94|, |v_ULTIMATE.start_main_#t~ite43_114|, |v_ULTIMATE.start_main_#t~ite34_86|, |v_ULTIMATE.start_main_#t~ite35_79|, |v_ULTIMATE.start_main_#t~ite49_102|, |v_ULTIMATE.start_main_#t~ite36_110|, |v_ULTIMATE.start_main_#t~ite40_104|, |v_ULTIMATE.start_main_#t~ite48_108|, |v_ULTIMATE.start_main_#t~ite39_110|, |v_ULTIMATE.start_main_#t~ite51_104|, |v_ULTIMATE.start_main_#t~ite37_106|] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][25], [Black: 129#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0)), Black: 127#(= ~__unbuffered_p2_EAX~0 0), 100#L794true, P2Thread1of1ForFork1InUse, Black: 135#(and (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$w_buff1~0 ~z$w_buff0~0)), 138#true, P0Thread1of1ForFork2InUse, 43#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P1Thread1of1ForFork0InUse, 13#L781true, Black: 140#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0)), Black: 141#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 146#true, 85#L761true, Black: 115#(= ~x~0 0), Black: 149#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 121#(= ~__unbuffered_p2_EAX~0 0), Black: 152#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1)))]) [2021-03-25 14:52:55,720 INFO L384 tUnfolder$Statistics]: this new event has 17 ancestors and is cut-off event [2021-03-25 14:52:55,720 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 14:52:55,720 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 14:52:55,720 INFO L387 tUnfolder$Statistics]: existing Event has 17 ancestors and is cut-off event [2021-03-25 14:52:55,722 INFO L382 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1026] L834-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse18 (= (mod v_~z$w_buff1_used~0_453 256) 0)) (.cse19 (= (mod v_~z$r_buff0_thd0~0_316 256) 0)) (.cse20 (= (mod v_~z$r_buff1_thd0~0_255 256) 0))) (let ((.cse2 (= (mod v_~weak$$choice2~0_96 256) 0)) (.cse12 (and .cse19 .cse20)) (.cse13 (and .cse18 .cse19)) (.cse7 (not .cse19)) (.cse17 (= (mod v_~z$w_buff0_used~0_558 256) 0))) (let ((.cse4 (not .cse17)) (.cse5 (or .cse7 (not .cse20))) (.cse8 (or .cse17 .cse19)) (.cse6 (or (not .cse18) .cse7)) (.cse3 (or .cse17 .cse12 .cse13)) (.cse0 (not .cse2))) (and (= (mod v_~main$tmp_guard1~0_36 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= |v_ULTIMATE.start_main_#t~nondet33_57| v_~weak$$choice2~0_96) (= v_~z$mem_tmp~0_44 v_~z~0_278) (= v_~main$tmp_guard1~0_36 (ite (= (ite (not (and (= v_~x~0_59 2) (= 2 |v_ULTIMATE.start_main_#t~ite35_79|) (= v_~__unbuffered_p2_EAX~0_46 1))) 1 0) 0) 0 1)) (let ((.cse1 (= |v_ULTIMATE.start_main_#t~ite39_109| |v_ULTIMATE.start_main_#t~ite39_110|))) (or (and .cse0 (= v_~z$w_buff1~0_197 v_~z$w_buff1~0_196) .cse1 (= |v_ULTIMATE.start_main_#t~ite40_104| |v_ULTIMATE.start_main_#t~ite40_103|)) (and (= v_~z$w_buff1~0_196 |v_ULTIMATE.start_main_#t~ite40_104|) .cse2 (or (and .cse3 .cse1 (= v_~z$w_buff1~0_197 |v_ULTIMATE.start_main_#t~ite40_104|)) (and .cse4 (= |v_ULTIMATE.start_main_#t~ite39_110| |v_ULTIMATE.start_main_#t~ite40_104|) .cse5 .cse6 (= v_~z$w_buff1~0_197 |v_ULTIMATE.start_main_#t~ite39_110|)))))) (or (and (or (and (= v_~z$w_buff0~0_207 |v_ULTIMATE.start_main_#t~ite34_86|) .cse7) (and .cse8 (= v_~z$w_buff1~0_197 |v_ULTIMATE.start_main_#t~ite34_86|))) .cse4 .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite35_79|)) (and (= v_~z~0_278 |v_ULTIMATE.start_main_#t~ite35_79|) .cse3 (= |v_ULTIMATE.start_main_#t~ite34_86| |v_ULTIMATE.start_main_#t~ite34_85|))) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (let ((.cse9 (= |v_ULTIMATE.start_main_#t~ite36_109| |v_ULTIMATE.start_main_#t~ite36_110|))) (or (and (= v_~z$w_buff0~0_206 |v_ULTIMATE.start_main_#t~ite37_106|) .cse2 (or (and (= v_~z$w_buff0~0_207 |v_ULTIMATE.start_main_#t~ite37_106|) .cse9 .cse3) (and .cse4 .cse5 .cse6 (= |v_ULTIMATE.start_main_#t~ite36_110| |v_ULTIMATE.start_main_#t~ite37_106|) (= v_~z$w_buff0~0_207 |v_ULTIMATE.start_main_#t~ite36_110|)))) (and .cse0 (= v_~z$w_buff0~0_207 v_~z$w_buff0~0_206) .cse9 (= |v_ULTIMATE.start_main_#t~ite37_106| |v_ULTIMATE.start_main_#t~ite37_105|)))) (let ((.cse10 (= |v_ULTIMATE.start_main_#t~ite45_98| |v_ULTIMATE.start_main_#t~ite45_97|))) (or (and .cse0 .cse10 (= |v_ULTIMATE.start_main_#t~ite46_94| |v_ULTIMATE.start_main_#t~ite46_93|) (= v_~z$w_buff1_used~0_453 v_~z$w_buff1_used~0_452)) (and (let ((.cse11 (= (mod v_~z$w_buff0_used~0_557 256) 0))) (or (and .cse5 .cse6 (not .cse11) (= |v_ULTIMATE.start_main_#t~ite45_98| |v_ULTIMATE.start_main_#t~ite46_94|) (= |v_ULTIMATE.start_main_#t~ite45_98| 0)) (and (or .cse12 .cse13 .cse11) (= v_~z$w_buff1_used~0_453 |v_ULTIMATE.start_main_#t~ite46_94|) .cse10))) .cse2 (= v_~z$w_buff1_used~0_452 |v_ULTIMATE.start_main_#t~ite46_94|)))) (let ((.cse14 (= |v_ULTIMATE.start_main_#t~ite48_108| |v_ULTIMATE.start_main_#t~ite48_107|))) (or (and .cse14 (= v_~z$r_buff0_thd0~0_315 |v_ULTIMATE.start_main_#t~ite49_102|) .cse2 (= v_~z$r_buff0_thd0~0_316 |v_ULTIMATE.start_main_#t~ite49_102|)) (and .cse14 .cse0 (= v_~z$r_buff0_thd0~0_316 v_~z$r_buff0_thd0~0_315) (= |v_ULTIMATE.start_main_#t~ite49_102| |v_ULTIMATE.start_main_#t~ite49_101|)))) (= v_~z$flush_delayed~0_74 0) (let ((.cse15 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite42_117|))) (or (and .cse0 (= v_~z$w_buff0_used~0_558 v_~z$w_buff0_used~0_557) (= |v_ULTIMATE.start_main_#t~ite43_114| |v_ULTIMATE.start_main_#t~ite43_113|) .cse15) (and (or (and .cse4 .cse5 (or (and (= |v_ULTIMATE.start_main_#t~ite42_118| 0) .cse7) (and .cse8 (= v_~z$w_buff0_used~0_558 |v_ULTIMATE.start_main_#t~ite42_118|))) .cse6 (= |v_ULTIMATE.start_main_#t~ite42_118| |v_ULTIMATE.start_main_#t~ite43_114|)) (and .cse3 .cse15 (= v_~z$w_buff0_used~0_558 |v_ULTIMATE.start_main_#t~ite43_114|))) .cse2 (= v_~z$w_buff0_used~0_557 |v_ULTIMATE.start_main_#t~ite43_114|)))) (let ((.cse16 (= |v_ULTIMATE.start_main_#t~ite51_104| |v_ULTIMATE.start_main_#t~ite51_103|))) (or (and (= |v_ULTIMATE.start_main_#t~ite52_99| |v_ULTIMATE.start_main_#t~ite52_100|) .cse16 .cse0 (= v_~z$r_buff1_thd0~0_255 v_~z$r_buff1_thd0~0_254)) (and .cse16 (= v_~z$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite52_100|) .cse2 (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite52_100|)))) (or (and (= v_~z~0_277 |v_ULTIMATE.start_main_#t~ite35_79|) .cse2) (and .cse0 (= v_~z$mem_tmp~0_44 v_~z~0_277))) (= |v_ULTIMATE.start_main_#t~nondet32_47| v_~weak$$choice0~0_23))))) InVars {ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_47|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_57|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_558, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_109|, ~z$w_buff0~0=v_~z$w_buff0~0_207, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_453, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_93|, ~z$w_buff1~0=v_~z$w_buff1~0_197, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_109|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_101|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_107|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_105|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_113|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_117|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_97|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_85|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_99|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_316, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_103|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_103|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ~z~0=v_~z~0_278, ~x~0=v_~x~0_59} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_46|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_56|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_56|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_92|, ~z$w_buff1~0=v_~z$w_buff1~0_196, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_100|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_106|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_112|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_116|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_96|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_52|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_98|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_315, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_102|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_254, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_46, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|, ~z$mem_tmp~0=v_~z$mem_tmp~0_44, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_557, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_108|, ~z$w_buff0~0=v_~z$w_buff0~0_206, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_452, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_78|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_108|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~z$flush_delayed~0=v_~z$flush_delayed~0_74, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_104|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_50|, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_62|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_84|, ~weak$$choice0~0=v_~weak$$choice0~0_23, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_56|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_102|, ~z~0=v_~z~0_277, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~x~0=v_~x~0_59} AuxVars[|v_ULTIMATE.start_main_#t~ite45_98|, |v_ULTIMATE.start_main_#t~ite42_118|, |v_ULTIMATE.start_main_#t~ite52_100|, |v_ULTIMATE.start_main_#t~ite46_94|, |v_ULTIMATE.start_main_#t~ite43_114|, |v_ULTIMATE.start_main_#t~ite34_86|, |v_ULTIMATE.start_main_#t~ite35_79|, |v_ULTIMATE.start_main_#t~ite49_102|, |v_ULTIMATE.start_main_#t~ite36_110|, |v_ULTIMATE.start_main_#t~ite40_104|, |v_ULTIMATE.start_main_#t~ite48_108|, |v_ULTIMATE.start_main_#t~ite39_110|, |v_ULTIMATE.start_main_#t~ite51_104|, |v_ULTIMATE.start_main_#t~ite37_106|] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_#t~nondet33, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ~z$mem_tmp~0, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$w_buff0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite53, ULTIMATE.start_main_#t~ite34, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0, ~weak$$choice2~0][25], [Black: 129#(and (= ~__unbuffered_p2_EAX~0 0) (= ~y~0 0)), Black: 127#(= ~__unbuffered_p2_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 135#(and (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0) (= ~z$w_buff1~0 ~z$w_buff0~0)), 138#true, P0Thread1of1ForFork2InUse, 43#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P1Thread1of1ForFork0InUse, 13#L781true, Black: 140#(and (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$w_buff0~0 ~z~0)), Black: 141#(and (= ~z$w_buff1~0 ~z~0) (= ~z$r_buff0_thd0~0 0) (= ~z~0 0) (= ~z$w_buff0~0 2) (= ~z$r_buff1_thd0~0 0)), 146#true, 85#L761true, Black: 115#(= ~x~0 0), Black: 149#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z~0 1) (= ~z$r_buff1_thd0~0 0)), Black: 121#(= ~__unbuffered_p2_EAX~0 0), Black: 152#(and (= ~z$w_buff1~0 0) (= ~z$r_buff0_thd0~0 0) (= ~z$w_buff0~0 0) (= ~z$r_buff1_thd0~0 0) (or (= ~z~0 0) (= ~z~0 1))), 30#L801true]) [2021-03-25 14:52:55,722 INFO L384 tUnfolder$Statistics]: this new event has 18 ancestors and is cut-off event [2021-03-25 14:52:55,722 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:52:55,722 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:52:55,722 INFO L387 tUnfolder$Statistics]: existing Event has 18 ancestors and is cut-off event [2021-03-25 14:52:55,723 INFO L129 PetriNetUnfolder]: 99/271 cut-off events. [2021-03-25 14:52:55,723 INFO L130 PetriNetUnfolder]: For 1384/1455 co-relation queries the response was YES. [2021-03-25 14:52:55,725 INFO L84 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 271 events. 99/271 cut-off events. For 1384/1455 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1582 event pairs, 30 based on Foata normal form. 8/248 useless extension candidates. Maximal degree in co-relation 909. Up to 113 conditions per place. [2021-03-25 14:52:55,732 INFO L142 LiptonReduction]: Number of co-enabled transitions 404 [2021-03-25 14:52:55,746 INFO L154 LiptonReduction]: Checked pairs total: 26 [2021-03-25 14:52:55,748 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:55,748 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63 [2021-03-25 14:52:55,749 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 37 transitions, 207 flow [2021-03-25 14:52:55,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,749 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:55,750 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:55,750 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:52:55,750 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:55,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:55,750 INFO L82 PathProgramCache]: Analyzing trace with hash -96734031, now seen corresponding path program 2 times [2021-03-25 14:52:55,750 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:55,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206981638] [2021-03-25 14:52:55,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:55,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:52:55,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,865 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:52:55,877 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:55,878 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 14:52:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:55,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206981638] [2021-03-25 14:52:55,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:55,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:55,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391317046] [2021-03-25 14:52:55,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:55,894 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:55,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:55,898 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 171 [2021-03-25 14:52:55,899 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 37 transitions, 207 flow. Second operand has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:55,899 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:55,899 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 171 [2021-03-25 14:52:55,899 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:56,023 INFO L129 PetriNetUnfolder]: 160/344 cut-off events. [2021-03-25 14:52:56,023 INFO L130 PetriNetUnfolder]: For 1208/1423 co-relation queries the response was YES. [2021-03-25 14:52:56,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 344 events. 160/344 cut-off events. For 1208/1423 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 1795 event pairs, 23 based on Foata normal form. 46/370 useless extension candidates. Maximal degree in co-relation 1202. Up to 244 conditions per place. [2021-03-25 14:52:56,027 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 15 selfloop transitions, 11 changer transitions 0/43 dead transitions. [2021-03-25 14:52:56,027 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 43 transitions, 289 flow [2021-03-25 14:52:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2021-03-25 14:52:56,033 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7733918128654971 [2021-03-25 14:52:56,033 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2021-03-25 14:52:56,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2021-03-25 14:52:56,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:56,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2021-03-25 14:52:56,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,036 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,036 INFO L185 Difference]: Start difference. First operand has 47 places, 37 transitions, 207 flow. Second operand 4 states and 529 transitions. [2021-03-25 14:52:56,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 43 transitions, 289 flow [2021-03-25 14:52:56,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 43 transitions, 280 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:56,041 INFO L241 Difference]: Finished difference. Result has 50 places, 40 transitions, 252 flow [2021-03-25 14:52:56,041 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2021-03-25 14:52:56,041 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2021-03-25 14:52:56,041 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:56,041 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 40 transitions, 252 flow [2021-03-25 14:52:56,042 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 40 transitions, 252 flow [2021-03-25 14:52:56,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 40 transitions, 252 flow [2021-03-25 14:52:56,082 INFO L129 PetriNetUnfolder]: 106/290 cut-off events. [2021-03-25 14:52:56,082 INFO L130 PetriNetUnfolder]: For 1742/1869 co-relation queries the response was YES. [2021-03-25 14:52:56,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 290 events. 106/290 cut-off events. For 1742/1869 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1684 event pairs, 21 based on Foata normal form. 13/287 useless extension candidates. Maximal degree in co-relation 1056. Up to 129 conditions per place. [2021-03-25 14:52:56,086 INFO L142 LiptonReduction]: Number of co-enabled transitions 434 [2021-03-25 14:52:56,098 INFO L154 LiptonReduction]: Checked pairs total: 88 [2021-03-25 14:52:56,098 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:56,098 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-03-25 14:52:56,099 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 252 flow [2021-03-25 14:52:56,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 128.8) internal successors, (644), 5 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,100 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:56,100 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:56,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:52:56,100 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:56,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:56,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1605520622, now seen corresponding path program 1 times [2021-03-25 14:52:56,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:56,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490870535] [2021-03-25 14:52:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:56,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:52:56,190 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-25 14:52:56,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-25 14:52:56,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:52:56,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:56,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:56,236 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490870535] [2021-03-25 14:52:56,236 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:56,236 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:56,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498952696] [2021-03-25 14:52:56,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:52:56,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:56,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:52:56,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:52:56,238 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 171 [2021-03-25 14:52:56,239 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 252 flow. Second operand has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,239 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:56,239 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 171 [2021-03-25 14:52:56,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:56,354 INFO L129 PetriNetUnfolder]: 156/333 cut-off events. [2021-03-25 14:52:56,355 INFO L130 PetriNetUnfolder]: For 1597/1899 co-relation queries the response was YES. [2021-03-25 14:52:56,356 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 333 events. 156/333 cut-off events. For 1597/1899 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1724 event pairs, 42 based on Foata normal form. 53/367 useless extension candidates. Maximal degree in co-relation 1301. Up to 223 conditions per place. [2021-03-25 14:52:56,358 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 17 selfloop transitions, 11 changer transitions 0/45 dead transitions. [2021-03-25 14:52:56,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 338 flow [2021-03-25 14:52:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:52:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:52:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2021-03-25 14:52:56,360 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7324561403508771 [2021-03-25 14:52:56,360 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2021-03-25 14:52:56,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2021-03-25 14:52:56,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:56,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2021-03-25 14:52:56,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,363 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,363 INFO L185 Difference]: Start difference. First operand has 50 places, 40 transitions, 252 flow. Second operand 4 states and 501 transitions. [2021-03-25 14:52:56,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 338 flow [2021-03-25 14:52:56,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 45 transitions, 310 flow, removed 7 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:56,367 INFO L241 Difference]: Finished difference. Result has 52 places, 42 transitions, 274 flow [2021-03-25 14:52:56,367 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=274, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2021-03-25 14:52:56,367 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-25 14:52:56,367 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:56,368 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 42 transitions, 274 flow [2021-03-25 14:52:56,368 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 42 transitions, 274 flow [2021-03-25 14:52:56,368 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 42 transitions, 274 flow [2021-03-25 14:52:56,403 INFO L129 PetriNetUnfolder]: 110/293 cut-off events. [2021-03-25 14:52:56,404 INFO L130 PetriNetUnfolder]: For 1707/1814 co-relation queries the response was YES. [2021-03-25 14:52:56,405 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 293 events. 110/293 cut-off events. For 1707/1814 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1673 event pairs, 27 based on Foata normal form. 20/298 useless extension candidates. Maximal degree in co-relation 1050. Up to 129 conditions per place. [2021-03-25 14:52:56,407 INFO L142 LiptonReduction]: Number of co-enabled transitions 450 [2021-03-25 14:52:56,423 INFO L154 LiptonReduction]: Checked pairs total: 86 [2021-03-25 14:52:56,423 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:56,423 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-03-25 14:52:56,424 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 274 flow [2021-03-25 14:52:56,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,424 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:56,424 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:56,424 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:52:56,425 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:56,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:56,425 INFO L82 PathProgramCache]: Analyzing trace with hash 2041124548, now seen corresponding path program 1 times [2021-03-25 14:52:56,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:56,425 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765604953] [2021-03-25 14:52:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:56,499 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:52:56,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:56,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:52:56,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:52:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:56,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765604953] [2021-03-25 14:52:56,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:56,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:56,540 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385454451] [2021-03-25 14:52:56,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:52:56,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:52:56,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:52:56,542 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 171 [2021-03-25 14:52:56,543 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:56,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 171 [2021-03-25 14:52:56,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:56,709 INFO L129 PetriNetUnfolder]: 187/410 cut-off events. [2021-03-25 14:52:56,709 INFO L130 PetriNetUnfolder]: For 1717/2051 co-relation queries the response was YES. [2021-03-25 14:52:56,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1562 conditions, 410 events. 187/410 cut-off events. For 1717/2051 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 2292 event pairs, 40 based on Foata normal form. 50/441 useless extension candidates. Maximal degree in co-relation 1537. Up to 218 conditions per place. [2021-03-25 14:52:56,713 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 20 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2021-03-25 14:52:56,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 49 transitions, 376 flow [2021-03-25 14:52:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:56,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:56,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2021-03-25 14:52:56,716 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7684210526315789 [2021-03-25 14:52:56,716 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2021-03-25 14:52:56,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2021-03-25 14:52:56,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:56,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2021-03-25 14:52:56,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,719 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,719 INFO L185 Difference]: Start difference. First operand has 52 places, 42 transitions, 274 flow. Second operand 5 states and 657 transitions. [2021-03-25 14:52:56,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 49 transitions, 376 flow [2021-03-25 14:52:56,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 49 transitions, 360 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:56,726 INFO L241 Difference]: Finished difference. Result has 55 places, 45 transitions, 315 flow [2021-03-25 14:52:56,726 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2021-03-25 14:52:56,726 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2021-03-25 14:52:56,727 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:56,727 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 45 transitions, 315 flow [2021-03-25 14:52:56,727 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 45 transitions, 315 flow [2021-03-25 14:52:56,727 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 45 transitions, 315 flow [2021-03-25 14:52:56,777 INFO L129 PetriNetUnfolder]: 143/369 cut-off events. [2021-03-25 14:52:56,778 INFO L130 PetriNetUnfolder]: For 2047/2161 co-relation queries the response was YES. [2021-03-25 14:52:56,779 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 369 events. 143/369 cut-off events. For 2047/2161 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2221 event pairs, 10 based on Foata normal form. 18/372 useless extension candidates. Maximal degree in co-relation 1453. Up to 164 conditions per place. [2021-03-25 14:52:56,783 INFO L142 LiptonReduction]: Number of co-enabled transitions 490 [2021-03-25 14:52:56,817 INFO L154 LiptonReduction]: Checked pairs total: 95 [2021-03-25 14:52:56,817 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:56,817 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 90 [2021-03-25 14:52:56,817 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 315 flow [2021-03-25 14:52:56,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,818 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:56,818 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:56,818 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:52:56,818 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:56,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:56,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1873262400, now seen corresponding path program 2 times [2021-03-25 14:52:56,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:56,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133004063] [2021-03-25 14:52:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:56,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:52:56,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,891 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:52:56,891 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,895 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:56,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:56,910 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:56,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:56,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133004063] [2021-03-25 14:52:56,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:56,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:56,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858127303] [2021-03-25 14:52:56,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:52:56,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:56,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:52:56,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:52:56,920 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 171 [2021-03-25 14:52:56,921 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:56,921 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:56,921 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 171 [2021-03-25 14:52:56,921 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:57,050 INFO L129 PetriNetUnfolder]: 202/439 cut-off events. [2021-03-25 14:52:57,050 INFO L130 PetriNetUnfolder]: For 2266/2676 co-relation queries the response was YES. [2021-03-25 14:52:57,052 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 439 events. 202/439 cut-off events. For 2266/2676 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2481 event pairs, 49 based on Foata normal form. 48/467 useless extension candidates. Maximal degree in co-relation 1855. Up to 272 conditions per place. [2021-03-25 14:52:57,055 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 24 selfloop transitions, 15 changer transitions 0/56 dead transitions. [2021-03-25 14:52:57,055 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 56 transitions, 463 flow [2021-03-25 14:52:57,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2021-03-25 14:52:57,057 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7906432748538011 [2021-03-25 14:52:57,057 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2021-03-25 14:52:57,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2021-03-25 14:52:57,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:57,058 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2021-03-25 14:52:57,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,062 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,062 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,062 INFO L185 Difference]: Start difference. First operand has 55 places, 45 transitions, 315 flow. Second operand 5 states and 676 transitions. [2021-03-25 14:52:57,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 56 transitions, 463 flow [2021-03-25 14:52:57,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 444 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-03-25 14:52:57,067 INFO L241 Difference]: Finished difference. Result has 59 places, 53 transitions, 403 flow [2021-03-25 14:52:57,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=403, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2021-03-25 14:52:57,068 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 11 predicate places. [2021-03-25 14:52:57,068 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:57,068 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 53 transitions, 403 flow [2021-03-25 14:52:57,068 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 53 transitions, 403 flow [2021-03-25 14:52:57,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 53 transitions, 403 flow [2021-03-25 14:52:57,123 INFO L129 PetriNetUnfolder]: 194/431 cut-off events. [2021-03-25 14:52:57,123 INFO L130 PetriNetUnfolder]: For 2990/3132 co-relation queries the response was YES. [2021-03-25 14:52:57,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 431 events. 194/431 cut-off events. For 2990/3132 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2508 event pairs, 22 based on Foata normal form. 19/426 useless extension candidates. Maximal degree in co-relation 1825. Up to 191 conditions per place. [2021-03-25 14:52:57,129 INFO L142 LiptonReduction]: Number of co-enabled transitions 540 [2021-03-25 14:52:57,180 INFO L154 LiptonReduction]: Checked pairs total: 242 [2021-03-25 14:52:57,180 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:57,180 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 112 [2021-03-25 14:52:57,181 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 403 flow [2021-03-25 14:52:57,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,182 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:57,182 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:57,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:52:57,182 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:57,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:57,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1939805760, now seen corresponding path program 3 times [2021-03-25 14:52:57,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:57,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634932647] [2021-03-25 14:52:57,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:57,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:52:57,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:52:57,239 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:52:57,256 INFO L142 QuantifierPusher]: treesize reduction 4, result has 86.2 percent of original size [2021-03-25 14:52:57,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:52:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:57,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634932647] [2021-03-25 14:52:57,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:57,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:57,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43709268] [2021-03-25 14:52:57,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:52:57,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:52:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:52:57,278 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 171 [2021-03-25 14:52:57,278 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,278 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:57,278 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 171 [2021-03-25 14:52:57,279 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:57,415 INFO L129 PetriNetUnfolder]: 212/457 cut-off events. [2021-03-25 14:52:57,415 INFO L130 PetriNetUnfolder]: For 3240/3662 co-relation queries the response was YES. [2021-03-25 14:52:57,417 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2218 conditions, 457 events. 212/457 cut-off events. For 3240/3662 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 2578 event pairs, 49 based on Foata normal form. 51/489 useless extension candidates. Maximal degree in co-relation 2190. Up to 281 conditions per place. [2021-03-25 14:52:57,420 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 24 selfloop transitions, 18 changer transitions 0/59 dead transitions. [2021-03-25 14:52:57,420 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 545 flow [2021-03-25 14:52:57,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:52:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:52:57,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 810 transitions. [2021-03-25 14:52:57,423 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7894736842105263 [2021-03-25 14:52:57,423 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 810 transitions. [2021-03-25 14:52:57,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 810 transitions. [2021-03-25 14:52:57,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:57,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 810 transitions. [2021-03-25 14:52:57,425 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.0) internal successors, (810), 6 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,427 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 171.0) internal successors, (1197), 7 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,427 INFO L185 Difference]: Start difference. First operand has 59 places, 53 transitions, 403 flow. Second operand 6 states and 810 transitions. [2021-03-25 14:52:57,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 545 flow [2021-03-25 14:52:57,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 514 flow, removed 11 selfloop flow, removed 1 redundant places. [2021-03-25 14:52:57,434 INFO L241 Difference]: Finished difference. Result has 64 places, 56 transitions, 450 flow [2021-03-25 14:52:57,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=450, PETRI_PLACES=64, PETRI_TRANSITIONS=56} [2021-03-25 14:52:57,435 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 16 predicate places. [2021-03-25 14:52:57,435 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:57,435 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 56 transitions, 450 flow [2021-03-25 14:52:57,435 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 56 transitions, 450 flow [2021-03-25 14:52:57,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 56 transitions, 450 flow [2021-03-25 14:52:57,490 INFO L129 PetriNetUnfolder]: 201/438 cut-off events. [2021-03-25 14:52:57,490 INFO L130 PetriNetUnfolder]: For 3734/3871 co-relation queries the response was YES. [2021-03-25 14:52:57,492 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1998 conditions, 438 events. 201/438 cut-off events. For 3734/3871 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2530 event pairs, 23 based on Foata normal form. 17/434 useless extension candidates. Maximal degree in co-relation 1970. Up to 186 conditions per place. [2021-03-25 14:52:57,497 INFO L142 LiptonReduction]: Number of co-enabled transitions 560 [2021-03-25 14:52:57,548 INFO L154 LiptonReduction]: Checked pairs total: 333 [2021-03-25 14:52:57,548 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:57,549 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 114 [2021-03-25 14:52:57,550 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 56 transitions, 450 flow [2021-03-25 14:52:57,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,550 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:57,551 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:57,551 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:52:57,551 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:57,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1938937140, now seen corresponding path program 4 times [2021-03-25 14:52:57,551 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:57,551 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717193824] [2021-03-25 14:52:57,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:57,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:57,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:52:57,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:57,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:52:57,616 INFO L142 QuantifierPusher]: treesize reduction 25, result has 45.7 percent of original size [2021-03-25 14:52:57,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-25 14:52:57,637 INFO L142 QuantifierPusher]: treesize reduction 45, result has 35.7 percent of original size [2021-03-25 14:52:57,637 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 14:52:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:57,654 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717193824] [2021-03-25 14:52:57,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:57,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:52:57,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767494201] [2021-03-25 14:52:57,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:52:57,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:57,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:52:57,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:52:57,656 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 171 [2021-03-25 14:52:57,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 56 transitions, 450 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:57,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 171 [2021-03-25 14:52:57,657 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:57,814 INFO L129 PetriNetUnfolder]: 238/507 cut-off events. [2021-03-25 14:52:57,814 INFO L130 PetriNetUnfolder]: For 4537/4951 co-relation queries the response was YES. [2021-03-25 14:52:57,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 507 events. 238/507 cut-off events. For 4537/4951 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 2956 event pairs, 31 based on Foata normal form. 88/582 useless extension candidates. Maximal degree in co-relation 2518. Up to 297 conditions per place. [2021-03-25 14:52:57,819 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 28 selfloop transitions, 26 changer transitions 0/71 dead transitions. [2021-03-25 14:52:57,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 71 transitions, 696 flow [2021-03-25 14:52:57,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:57,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:57,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2021-03-25 14:52:57,822 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.791812865497076 [2021-03-25 14:52:57,822 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2021-03-25 14:52:57,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2021-03-25 14:52:57,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:57,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2021-03-25 14:52:57,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,826 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,826 INFO L185 Difference]: Start difference. First operand has 64 places, 56 transitions, 450 flow. Second operand 5 states and 677 transitions. [2021-03-25 14:52:57,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 71 transitions, 696 flow [2021-03-25 14:52:57,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 640 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-03-25 14:52:57,836 INFO L241 Difference]: Finished difference. Result has 65 places, 66 transitions, 571 flow [2021-03-25 14:52:57,836 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=571, PETRI_PLACES=65, PETRI_TRANSITIONS=66} [2021-03-25 14:52:57,836 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 17 predicate places. [2021-03-25 14:52:57,836 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:57,836 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 66 transitions, 571 flow [2021-03-25 14:52:57,836 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 66 transitions, 571 flow [2021-03-25 14:52:57,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 66 transitions, 571 flow [2021-03-25 14:52:57,942 INFO L129 PetriNetUnfolder]: 226/512 cut-off events. [2021-03-25 14:52:57,942 INFO L130 PetriNetUnfolder]: For 3648/3844 co-relation queries the response was YES. [2021-03-25 14:52:57,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2405 conditions, 512 events. 226/512 cut-off events. For 3648/3844 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 3119 event pairs, 5 based on Foata normal form. 23/523 useless extension candidates. Maximal degree in co-relation 2376. Up to 268 conditions per place. [2021-03-25 14:52:57,949 INFO L142 LiptonReduction]: Number of co-enabled transitions 640 [2021-03-25 14:52:57,992 INFO L154 LiptonReduction]: Checked pairs total: 561 [2021-03-25 14:52:57,992 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:52:57,992 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 156 [2021-03-25 14:52:57,993 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 66 transitions, 571 flow [2021-03-25 14:52:57,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:57,993 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:52:57,993 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:52:57,993 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:52:57,993 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:52:57,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:52:57,994 INFO L82 PathProgramCache]: Analyzing trace with hash -550311158, now seen corresponding path program 1 times [2021-03-25 14:52:57,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:52:57,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704142314] [2021-03-25 14:52:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:52:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:52:58,036 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:58,036 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:52:58,041 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:52:58,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:52:58,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:52:58,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:52:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:52:58,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704142314] [2021-03-25 14:52:58,048 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:52:58,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:52:58,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661902237] [2021-03-25 14:52:58,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:52:58,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:52:58,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:52:58,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:52:58,050 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 171 [2021-03-25 14:52:58,050 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 66 transitions, 571 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,051 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:52:58,051 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 171 [2021-03-25 14:52:58,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:52:58,182 INFO L129 PetriNetUnfolder]: 379/818 cut-off events. [2021-03-25 14:52:58,182 INFO L130 PetriNetUnfolder]: For 5650/6091 co-relation queries the response was YES. [2021-03-25 14:52:58,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3292 conditions, 818 events. 379/818 cut-off events. For 5650/6091 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 5678 event pairs, 99 based on Foata normal form. 227/916 useless extension candidates. Maximal degree in co-relation 3261. Up to 413 conditions per place. [2021-03-25 14:52:58,191 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 13 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2021-03-25 14:52:58,191 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 589 flow [2021-03-25 14:52:58,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:52:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:52:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2021-03-25 14:52:58,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.847953216374269 [2021-03-25 14:52:58,193 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2021-03-25 14:52:58,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2021-03-25 14:52:58,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:52:58,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2021-03-25 14:52:58,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,197 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:52:58,197 INFO L185 Difference]: Start difference. First operand has 65 places, 66 transitions, 571 flow. Second operand 5 states and 725 transitions. [2021-03-25 14:52:58,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 589 flow [2021-03-25 14:52:58,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 71 transitions, 534 flow, removed 12 selfloop flow, removed 3 redundant places. [2021-03-25 14:52:58,211 INFO L241 Difference]: Finished difference. Result has 69 places, 67 transitions, 542 flow [2021-03-25 14:52:58,212 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=542, PETRI_PLACES=69, PETRI_TRANSITIONS=67} [2021-03-25 14:52:58,212 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 21 predicate places. [2021-03-25 14:52:58,212 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:52:58,212 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 67 transitions, 542 flow [2021-03-25 14:52:58,212 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 67 transitions, 542 flow [2021-03-25 14:52:58,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 67 transitions, 542 flow [2021-03-25 14:52:58,304 INFO L129 PetriNetUnfolder]: 332/730 cut-off events. [2021-03-25 14:52:58,304 INFO L130 PetriNetUnfolder]: For 5035/5301 co-relation queries the response was YES. [2021-03-25 14:52:58,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3294 conditions, 730 events. 332/730 cut-off events. For 5035/5301 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 4872 event pairs, 64 based on Foata normal form. 86/777 useless extension candidates. Maximal degree in co-relation 3262. Up to 322 conditions per place. [2021-03-25 14:52:58,315 INFO L142 LiptonReduction]: Number of co-enabled transitions 700 [2021-03-25 14:52:59,079 WARN L205 SmtUtils]: Spent 757.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 180 [2021-03-25 14:52:59,295 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-03-25 14:53:00,653 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 334 DAG size of output: 258 [2021-03-25 14:53:01,127 WARN L205 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-25 14:53:01,144 INFO L154 LiptonReduction]: Checked pairs total: 3 [2021-03-25 14:53:01,144 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:53:01,144 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2932 [2021-03-25 14:53:01,145 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 67 transitions, 566 flow [2021-03-25 14:53:01,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,145 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:01,145 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:01,145 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:53:01,145 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2130044274, now seen corresponding path program 1 times [2021-03-25 14:53:01,146 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:01,146 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602406910] [2021-03-25 14:53:01,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:01,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:01,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:01,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:01,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:01,191 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:53:01,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:53:01,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:01,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:01,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602406910] [2021-03-25 14:53:01,199 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:01,199 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:53:01,199 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607481855] [2021-03-25 14:53:01,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:53:01,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:01,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:53:01,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:53:01,200 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 172 [2021-03-25 14:53:01,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 67 transitions, 566 flow. Second operand has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:01,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 172 [2021-03-25 14:53:01,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:01,327 INFO L129 PetriNetUnfolder]: 222/579 cut-off events. [2021-03-25 14:53:01,327 INFO L130 PetriNetUnfolder]: For 3214/4411 co-relation queries the response was YES. [2021-03-25 14:53:01,331 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2406 conditions, 579 events. 222/579 cut-off events. For 3214/4411 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 4034 event pairs, 12 based on Foata normal form. 397/908 useless extension candidates. Maximal degree in co-relation 2372. Up to 286 conditions per place. [2021-03-25 14:53:01,333 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 9 selfloop transitions, 15 changer transitions 3/72 dead transitions. [2021-03-25 14:53:01,334 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 72 transitions, 603 flow [2021-03-25 14:53:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:53:01,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:53:01,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1015 transitions. [2021-03-25 14:53:01,336 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8430232558139535 [2021-03-25 14:53:01,336 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1015 transitions. [2021-03-25 14:53:01,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1015 transitions. [2021-03-25 14:53:01,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:01,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1015 transitions. [2021-03-25 14:53:01,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 145.0) internal successors, (1015), 7 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,341 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 172.0) internal successors, (1376), 8 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,341 INFO L185 Difference]: Start difference. First operand has 69 places, 67 transitions, 566 flow. Second operand 7 states and 1015 transitions. [2021-03-25 14:53:01,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 72 transitions, 603 flow [2021-03-25 14:53:01,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 72 transitions, 578 flow, removed 4 selfloop flow, removed 4 redundant places. [2021-03-25 14:53:01,348 INFO L241 Difference]: Finished difference. Result has 73 places, 67 transitions, 565 flow [2021-03-25 14:53:01,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=565, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2021-03-25 14:53:01,349 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 25 predicate places. [2021-03-25 14:53:01,349 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:01,349 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 67 transitions, 565 flow [2021-03-25 14:53:01,349 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 67 transitions, 565 flow [2021-03-25 14:53:01,350 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 73 places, 67 transitions, 565 flow [2021-03-25 14:53:01,399 INFO L129 PetriNetUnfolder]: 147/449 cut-off events. [2021-03-25 14:53:01,399 INFO L130 PetriNetUnfolder]: For 2332/2486 co-relation queries the response was YES. [2021-03-25 14:53:01,402 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2072 conditions, 449 events. 147/449 cut-off events. For 2332/2486 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3179 event pairs, 9 based on Foata normal form. 53/492 useless extension candidates. Maximal degree in co-relation 2038. Up to 202 conditions per place. [2021-03-25 14:53:01,407 INFO L142 LiptonReduction]: Number of co-enabled transitions 744 [2021-03-25 14:53:01,414 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:53:01,414 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:01,414 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 65 [2021-03-25 14:53:01,416 INFO L480 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 565 flow [2021-03-25 14:53:01,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 141.8) internal successors, (709), 5 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,417 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:01,417 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:01,417 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:53:01,417 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:01,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:01,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1566133978, now seen corresponding path program 1 times [2021-03-25 14:53:01,417 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:01,418 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070780157] [2021-03-25 14:53:01,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:01,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:01,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:01,471 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:01,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:01,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:01,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:53:01,480 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:53:01,482 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:53:01,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:01,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:53:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:01,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070780157] [2021-03-25 14:53:01,491 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:01,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:53:01,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644830250] [2021-03-25 14:53:01,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:53:01,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:53:01,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:53:01,493 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 172 [2021-03-25 14:53:01,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 565 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:01,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 172 [2021-03-25 14:53:01,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:01,648 INFO L129 PetriNetUnfolder]: 189/514 cut-off events. [2021-03-25 14:53:01,648 INFO L130 PetriNetUnfolder]: For 3220/4810 co-relation queries the response was YES. [2021-03-25 14:53:01,651 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 514 events. 189/514 cut-off events. For 3220/4810 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 3601 event pairs, 2 based on Foata normal form. 362/810 useless extension candidates. Maximal degree in co-relation 2332. Up to 268 conditions per place. [2021-03-25 14:53:01,654 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 5 selfloop transitions, 19 changer transitions 4/73 dead transitions. [2021-03-25 14:53:01,654 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 643 flow [2021-03-25 14:53:01,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:53:01,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:53:01,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1299 transitions. [2021-03-25 14:53:01,657 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391472868217055 [2021-03-25 14:53:01,657 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1299 transitions. [2021-03-25 14:53:01,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1299 transitions. [2021-03-25 14:53:01,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:01,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1299 transitions. [2021-03-25 14:53:01,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 144.33333333333334) internal successors, (1299), 9 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,664 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 172.0) internal successors, (1720), 10 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:01,664 INFO L185 Difference]: Start difference. First operand has 73 places, 67 transitions, 565 flow. Second operand 9 states and 1299 transitions. [2021-03-25 14:53:01,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 643 flow [2021-03-25 14:53:01,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 73 transitions, 575 flow, removed 23 selfloop flow, removed 5 redundant places. [2021-03-25 14:53:01,675 INFO L241 Difference]: Finished difference. Result has 79 places, 67 transitions, 544 flow [2021-03-25 14:53:01,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=544, PETRI_PLACES=79, PETRI_TRANSITIONS=67} [2021-03-25 14:53:01,676 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 31 predicate places. [2021-03-25 14:53:01,676 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:01,676 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 67 transitions, 544 flow [2021-03-25 14:53:01,676 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 67 transitions, 544 flow [2021-03-25 14:53:01,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 544 flow [2021-03-25 14:53:01,714 INFO L129 PetriNetUnfolder]: 113/384 cut-off events. [2021-03-25 14:53:01,715 INFO L130 PetriNetUnfolder]: For 1425/1539 co-relation queries the response was YES. [2021-03-25 14:53:01,717 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1639 conditions, 384 events. 113/384 cut-off events. For 1425/1539 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 2844 event pairs, 0 based on Foata normal form. 41/418 useless extension candidates. Maximal degree in co-relation 1604. Up to 85 conditions per place. [2021-03-25 14:53:01,720 INFO L142 LiptonReduction]: Number of co-enabled transitions 726 [2021-03-25 14:53:02,064 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:53:02,202 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:53:02,856 WARN L205 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 246 DAG size of output: 192 [2021-03-25 14:53:03,091 WARN L205 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 14:53:04,524 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 346 DAG size of output: 270 [2021-03-25 14:53:05,086 WARN L205 SmtUtils]: Spent 559.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-25 14:53:05,097 INFO L154 LiptonReduction]: Checked pairs total: 80 [2021-03-25 14:53:05,097 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:53:05,097 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3421 [2021-03-25 14:53:05,097 INFO L480 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 514 flow [2021-03-25 14:53:05,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,098 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:05,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-03-25 14:53:05,098 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-25 14:53:05,098 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:05,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:05,098 INFO L82 PathProgramCache]: Analyzing trace with hash 103848111, now seen corresponding path program 1 times [2021-03-25 14:53:05,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:05,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449036963] [2021-03-25 14:53:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:53:05,157 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 14:53:05,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 14:53:05,184 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-25 14:53:05,186 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-25 14:53:05,229 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.2 percent of original size [2021-03-25 14:53:05,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-03-25 14:53:05,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:53:05,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 14:53:05,320 INFO L142 QuantifierPusher]: treesize reduction 4, result has 88.2 percent of original size [2021-03-25 14:53:05,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 14:53:05,365 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-25 14:53:05,366 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:53:05,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:53:05,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449036963] [2021-03-25 14:53:05,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:53:05,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:53:05,380 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339144318] [2021-03-25 14:53:05,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-25 14:53:05,380 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:53:05,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-25 14:53:05,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-25 14:53:05,382 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 174 [2021-03-25 14:53:05,383 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 514 flow. Second operand has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,383 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:53:05,383 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 174 [2021-03-25 14:53:05,383 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:53:05,607 INFO L129 PetriNetUnfolder]: 99/290 cut-off events. [2021-03-25 14:53:05,607 INFO L130 PetriNetUnfolder]: For 2675/2948 co-relation queries the response was YES. [2021-03-25 14:53:05,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1384 conditions, 290 events. 99/290 cut-off events. For 2675/2948 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1725 event pairs, 0 based on Foata normal form. 94/378 useless extension candidates. Maximal degree in co-relation 1347. Up to 101 conditions per place. [2021-03-25 14:53:05,610 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 19 selfloop transitions, 18 changer transitions 5/64 dead transitions. [2021-03-25 14:53:05,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 64 transitions, 621 flow [2021-03-25 14:53:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:53:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:53:05,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2021-03-25 14:53:05,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7167487684729064 [2021-03-25 14:53:05,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2021-03-25 14:53:05,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2021-03-25 14:53:05,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:53:05,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2021-03-25 14:53:05,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,629 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,629 INFO L185 Difference]: Start difference. First operand has 76 places, 62 transitions, 514 flow. Second operand 7 states and 873 transitions. [2021-03-25 14:53:05,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 64 transitions, 621 flow [2021-03-25 14:53:05,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 571 flow, removed 16 selfloop flow, removed 10 redundant places. [2021-03-25 14:53:05,636 INFO L241 Difference]: Finished difference. Result has 67 places, 54 transitions, 445 flow [2021-03-25 14:53:05,636 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=445, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2021-03-25 14:53:05,637 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 19 predicate places. [2021-03-25 14:53:05,637 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:53:05,637 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 54 transitions, 445 flow [2021-03-25 14:53:05,637 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 54 transitions, 445 flow [2021-03-25 14:53:05,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 54 transitions, 445 flow [2021-03-25 14:53:05,662 INFO L129 PetriNetUnfolder]: 76/233 cut-off events. [2021-03-25 14:53:05,662 INFO L130 PetriNetUnfolder]: For 953/1004 co-relation queries the response was YES. [2021-03-25 14:53:05,663 INFO L84 FinitePrefix]: Finished finitePrefix Result has 977 conditions, 233 events. 76/233 cut-off events. For 953/1004 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1346 event pairs, 0 based on Foata normal form. 14/243 useless extension candidates. Maximal degree in co-relation 947. Up to 85 conditions per place. [2021-03-25 14:53:05,665 INFO L142 LiptonReduction]: Number of co-enabled transitions 368 [2021-03-25 14:53:05,672 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-25 14:53:05,672 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:53:05,672 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 14:53:05,672 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 445 flow [2021-03-25 14:53:05,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 123.0) internal successors, (984), 8 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:53:05,673 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:53:05,673 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:53:05,673 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-25 14:53:05,673 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:53:05,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:53:05,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1448242881, now seen corresponding path program 1 times [2021-03-25 14:53:05,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:53:05,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975937404] [2021-03-25 14:53:05,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:53:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:53:05,714 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:53:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:53:05,748 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:53:05,785 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:53:05,785 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:53:05,786 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-03-25 14:53:05,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:53:05 BasicIcfg [2021-03-25 14:53:05,877 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:53:05,878 INFO L168 Benchmark]: Toolchain (without parser) took 26744.38 ms. Allocated memory was 255.9 MB in the beginning and 836.8 MB in the end (delta: 580.9 MB). Free memory was 233.0 MB in the beginning and 447.8 MB in the end (delta: -214.8 MB). Peak memory consumption was 364.6 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:05,878 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:53:05,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.88 ms. Allocated memory was 255.9 MB in the beginning and 400.6 MB in the end (delta: 144.7 MB). Free memory was 232.6 MB in the beginning and 360.8 MB in the end (delta: -128.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:05,879 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.04 ms. Allocated memory is still 400.6 MB. Free memory was 360.8 MB in the beginning and 358.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:05,879 INFO L168 Benchmark]: Boogie Preprocessor took 38.05 ms. Allocated memory is still 400.6 MB. Free memory was 358.0 MB in the beginning and 355.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:05,879 INFO L168 Benchmark]: RCFGBuilder took 1795.91 ms. Allocated memory is still 400.6 MB. Free memory was 355.7 MB in the beginning and 226.0 MB in the end (delta: 129.7 MB). Peak memory consumption was 131.7 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:05,879 INFO L168 Benchmark]: TraceAbstraction took 24379.93 ms. Allocated memory was 400.6 MB in the beginning and 836.8 MB in the end (delta: 436.2 MB). Free memory was 226.0 MB in the beginning and 447.8 MB in the end (delta: -221.8 MB). Peak memory consumption was 214.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:53:05,886 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 255.9 MB. Free memory is still 237.4 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 463.88 ms. Allocated memory was 255.9 MB in the beginning and 400.6 MB in the end (delta: 144.7 MB). Free memory was 232.6 MB in the beginning and 360.8 MB in the end (delta: -128.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 53.04 ms. Allocated memory is still 400.6 MB. Free memory was 360.8 MB in the beginning and 358.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 38.05 ms. Allocated memory is still 400.6 MB. Free memory was 358.0 MB in the beginning and 355.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1795.91 ms. Allocated memory is still 400.6 MB. Free memory was 355.7 MB in the beginning and 226.0 MB in the end (delta: 129.7 MB). Peak memory consumption was 131.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24379.93 ms. Allocated memory was 400.6 MB in the beginning and 836.8 MB in the end (delta: 436.2 MB). Free memory was 226.0 MB in the beginning and 447.8 MB in the end (delta: -221.8 MB). Peak memory consumption was 214.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7702.5ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 3065 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1546, positive: 1462, positive conditional: 0, positive unconditional: 1462, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1105, positive: 1070, positive conditional: 0, positive unconditional: 1070, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1105, positive: 1070, positive conditional: 0, positive unconditional: 1070, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1105, positive: 1064, positive conditional: 0, positive unconditional: 1064, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 380, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 365, negative conditional: 0, negative unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1546, positive: 392, positive conditional: 0, positive unconditional: 392, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 1105, unknown conditional: 0, unknown unconditional: 1105] , Statistics on independence cache: Total cache size (in pairs): 160, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3479.4ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 3 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 942 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 26, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 26, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 26, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 203, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 203, negative conditional: 0, negative unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 26, unknown conditional: 0, unknown unconditional: 26] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1132.7ms, 34 PlacesBefore, 32 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 792 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, positive: 135, positive conditional: 0, positive unconditional: 135, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 268 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 250 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 59, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 59, positive: 42, positive conditional: 0, positive unconditional: 42, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.1ms, 37 PlacesBefore, 37 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 258 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 54, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.8ms, 38 PlacesBefore, 38 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 178 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 100, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 100, negative conditional: 0, negative unconditional: 100, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 36, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 178, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 84.4ms, 42 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 106 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 57, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 35, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 57, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 62.4ms, 47 PlacesBefore, 47 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 404 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 26 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 150, Positive conditional cache size: 0, Positive unconditional cache size: 150, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.7ms, 50 PlacesBefore, 50 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 434 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 88 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.1ms, 52 PlacesBefore, 52 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 450 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 86 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 29, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 89.9ms, 55 PlacesBefore, 55 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 490 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 95 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 28, positive conditional: 0, positive unconditional: 28, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 112.0ms, 59 PlacesBefore, 59 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 540 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 242 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 86, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 86, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 185, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 113.3ms, 64 PlacesBefore, 64 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 560 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 333 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 155, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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: 155, positive: 139, positive conditional: 0, positive unconditional: 139, 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): 187, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 155.7ms, 65 PlacesBefore, 65 PlacesAfterwards, 66 TransitionsBefore, 66 TransitionsAfterwards, 640 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 561 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 240, positive: 220, positive conditional: 0, positive unconditional: 220, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 240, positive: 220, positive conditional: 0, positive unconditional: 220, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 187, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2931.9ms, 69 PlacesBefore, 69 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 3 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.4ms, 73 PlacesBefore, 73 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 744 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 183, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3420.7ms, 79 PlacesBefore, 76 PlacesAfterwards, 67 TransitionsBefore, 62 TransitionsAfterwards, 726 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 80 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 80, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 80, positive: 80, positive conditional: 0, positive unconditional: 80, 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): 153, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.8ms, 67 PlacesBefore, 67 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2031; [L819] FCALL, FORK 0 pthread_create(&t2031, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2032; [L821] FCALL, FORK 0 pthread_create(&t2032, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2033; [L823] FCALL, FORK 0 pthread_create(&t2033, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24199.5ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2252.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7768.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 71 SDtfs, 37 SDslu, 21 SDs, 0 SdLazy, 488 SolverSat, 111 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 580.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 755.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=571occurred in iteration=13, InterpolantAutomatonStates: 81, 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: 62.8ms SsaConstructionTime, 454.0ms SatisfiabilityAnalysisTime, 1416.8ms InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 228 ConstructedInterpolants, 0 QuantifiedInterpolants, 2113 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...