/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 16:14:48,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 16:14:48,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 16:14:48,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 16:14:48,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 16:14:48,824 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 16:14:48,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 16:14:48,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 16:14:48,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 16:14:48,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 16:14:48,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 16:14:48,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 16:14:48,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 16:14:48,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 16:14:48,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 16:14:48,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 16:14:48,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 16:14:48,837 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 16:14:48,838 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 16:14:48,839 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 16:14:48,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 16:14:48,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 16:14:48,841 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 16:14:48,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 16:14:48,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 16:14:48,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 16:14:48,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 16:14:48,844 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 16:14:48,844 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 16:14:48,845 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 16:14:48,845 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 16:14:48,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 16:14:48,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 16:14:48,846 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 16:14:48,847 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 16:14:48,847 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 16:14:48,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 16:14:48,847 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 16:14:48,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 16:14:48,848 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 16:14:48,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 16:14:48,849 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-06-11 16:14:48,862 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 16:14:48,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 16:14:48,863 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 16:14:48,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 16:14:48,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 16:14:48,864 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 16:14:48,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:14:48,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 16:14:48,865 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 16:14:48,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 16:14:48,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 16:14:48,866 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-06-11 16:14:48,866 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 16:14:48,866 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 16:14:48,866 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 16:14:49,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 16:14:49,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 16:14:49,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 16:14:49,125 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 16:14:49,127 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 16:14:49,127 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2021-06-11 16:14:49,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c484f01e4/e4811d2b08e84838a5b5f6bfae11fec2/FLAG16d0b2d89 [2021-06-11 16:14:49,568 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 16:14:49,573 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2021-06-11 16:14:49,585 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c484f01e4/e4811d2b08e84838a5b5f6bfae11fec2/FLAG16d0b2d89 [2021-06-11 16:14:49,593 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c484f01e4/e4811d2b08e84838a5b5f6bfae11fec2 [2021-06-11 16:14:49,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 16:14:49,596 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 16:14:49,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 16:14:49,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 16:14:49,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 16:14:49,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:14:49" (1/1) ... [2021-06-11 16:14:49,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d75f148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:49, skipping insertion in model container [2021-06-11 16:14:49,603 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 04:14:49" (1/1) ... [2021-06-11 16:14:49,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 16:14:49,638 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 16:14:49,762 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/safe017_pso.opt.i[949,962] [2021-06-11 16:14:49,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:14:49,922 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 16:14:49,928 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i[949,962] [2021-06-11 16:14:49,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 16:14:50,003 INFO L208 MainTranslator]: Completed translation [2021-06-11 16:14:50,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50 WrapperNode [2021-06-11 16:14:50,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 16:14:50,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 16:14:50,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 16:14:50,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 16:14:50,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,044 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 16:14:50,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 16:14:50,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 16:14:50,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 16:14:50,049 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,052 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,058 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... [2021-06-11 16:14:50,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 16:14:50,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 16:14:50,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 16:14:50,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 16:14:50,066 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 16:14:50,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 16:14:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 16:14:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 16:14:50,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 16:14:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 16:14:50,123 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 16:14:50,123 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 16:14:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 16:14:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 16:14:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 16:14:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 16:14:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 16:14:50,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 16:14:50,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 16:14:50,126 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 16:14:51,410 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 16:14:51,410 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 16:14:51,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:14:51 BoogieIcfgContainer [2021-06-11 16:14:51,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 16:14:51,413 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 16:14:51,413 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 16:14:51,414 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 16:14:51,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 04:14:49" (1/3) ... [2021-06-11 16:14:51,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee59661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:14:51, skipping insertion in model container [2021-06-11 16:14:51,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 04:14:50" (2/3) ... [2021-06-11 16:14:51,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ee59661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 04:14:51, skipping insertion in model container [2021-06-11 16:14:51,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 04:14:51" (3/3) ... [2021-06-11 16:14:51,416 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2021-06-11 16:14:51,420 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 16:14:51,423 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 16:14:51,423 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 16:14:51,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,444 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,448 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,452 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,456 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,457 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,458 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,459 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,459 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 16:14:51,461 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 16:14:51,473 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 16:14:51,485 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 16:14:51,485 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 16:14:51,485 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 16:14:51,485 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 16:14:51,485 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 16:14:51,485 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 16:14:51,485 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 16:14:51,485 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 16:14:51,491 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 95 transitions, 205 flow [2021-06-11 16:14:51,512 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-06-11 16:14:51,513 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:51,515 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-11 16:14:51,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 95 transitions, 205 flow [2021-06-11 16:14:51,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 92 transitions, 193 flow [2021-06-11 16:14:51,523 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:14:51,536 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 193 flow [2021-06-11 16:14:51,540 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 193 flow [2021-06-11 16:14:51,543 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 193 flow [2021-06-11 16:14:51,563 INFO L129 PetriNetUnfolder]: 2/92 cut-off events. [2021-06-11 16:14:51,563 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:14:51,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-06-11 16:14:51,566 INFO L151 LiptonReduction]: Number of co-enabled transitions 1602 [2021-06-11 16:14:51,611 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,618 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,680 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,681 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,688 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,689 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,704 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,730 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,741 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,759 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,760 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,826 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:51,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:51,832 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:51,851 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,853 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,875 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,876 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:51,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:51,999 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:52,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:52,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:52,116 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,126 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 16:14:52,127 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:14:52,148 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,484 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:52,553 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,553 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:52,554 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:52,597 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 16:14:52,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,676 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,745 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,849 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,850 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,867 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,868 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:52,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,968 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:52,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:52,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:52,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:53,047 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,048 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:53,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,068 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:53,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:53,256 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 16:14:53,613 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-06-11 16:14:53,736 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-06-11 16:14:53,744 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,751 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:53,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:14:53,757 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:53,761 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,762 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-06-11 16:14:53,762 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:14:53,764 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,767 INFO L147 QuantifierPusher]: treesize reduction 39, result has 69.0 percent of original size 87 [2021-06-11 16:14:53,768 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:53,769 INFO L142 QuantifierPusher]: treesize reduction 39, result has 75.6 percent of original size [2021-06-11 16:14:53,769 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 4, 2, 1] term [2021-06-11 16:14:53,770 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:14:53,771 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,772 INFO L147 QuantifierPusher]: treesize reduction 113, result has 30.7 percent of original size 50 [2021-06-11 16:14:53,773 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 4, 2, 1] term [2021-06-11 16:14:53,773 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 16:14:53,774 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,775 INFO L147 QuantifierPusher]: treesize reduction 176, result has 33.3 percent of original size 88 [2021-06-11 16:14:53,839 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:53,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:54,012 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:54,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:54,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:54,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,107 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:54,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,131 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:54,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,179 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:14:54,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:14:54,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:14:54,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,210 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:54,247 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,255 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 16:14:54,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:54,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:55,163 WARN L205 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 198 [2021-06-11 16:14:55,432 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 196 [2021-06-11 16:14:56,609 WARN L205 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 323 DAG size of output: 278 [2021-06-11 16:14:57,135 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2021-06-11 16:14:57,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:14:57,141 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:14:57,778 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 229 DAG size of output: 188 [2021-06-11 16:14:58,040 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 16:14:59,217 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 313 DAG size of output: 269 [2021-06-11 16:14:59,717 WARN L205 SmtUtils]: Spent 498.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-06-11 16:15:00,287 WARN L205 SmtUtils]: Spent 567.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-06-11 16:15:00,542 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-06-11 16:15:01,775 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-06-11 16:15:02,330 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-06-11 16:15:02,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:02,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:02,595 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,599 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:15:02,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,600 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:15:02,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 16:15:02,604 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:15:02,604 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:15:02,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,605 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:15:02,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 16:15:02,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 16:15:02,607 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:15:02,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 16:15:02,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 16:15:02,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,848 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:15:02,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:02,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:15:02,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:15:03,045 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:03,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:03,477 WARN L205 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 16:15:03,859 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-06-11 16:15:04,657 WARN L205 SmtUtils]: Spent 796.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-06-11 16:15:05,515 WARN L205 SmtUtils]: Spent 856.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-06-11 16:15:05,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:05,520 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:05,793 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-06-11 16:15:05,904 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-11 16:15:06,151 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 110 [2021-06-11 16:15:06,260 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-06-11 16:15:06,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:06,266 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 16:15:06,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:06,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:15:06,270 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:15:06,284 INFO L163 LiptonReduction]: Checked pairs total: 4098 [2021-06-11 16:15:06,285 INFO L165 LiptonReduction]: Total number of compositions: 86 [2021-06-11 16:15:06,286 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14763 [2021-06-11 16:15:06,294 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2021-06-11 16:15:06,294 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:15:06,295 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:06,295 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 16:15:06,295 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-06-11 16:15:06,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:06,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1056835, now seen corresponding path program 1 times [2021-06-11 16:15:06,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:06,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124201486] [2021-06-11 16:15:06,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:06,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:06,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:06,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:06,445 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124201486] [2021-06-11 16:15:06,445 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:06,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:15:06,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838007024] [2021-06-11 16:15:06,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:15:06,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:06,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:15:06,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:15:06,466 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2021-06-11 16:15:06,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:06,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:06,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2021-06-11 16:15:06,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:06,552 INFO L129 PetriNetUnfolder]: 69/165 cut-off events. [2021-06-11 16:15:06,552 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:15:06,553 INFO L84 FinitePrefix]: Finished finitePrefix Result has 293 conditions, 165 events. 69/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 797 event pairs, 13 based on Foata normal form. 10/152 useless extension candidates. Maximal degree in co-relation 283. Up to 89 conditions per place. [2021-06-11 16:15:06,555 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 9 selfloop transitions, 2 changer transitions 3/29 dead transitions. [2021-06-11 16:15:06,555 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 93 flow [2021-06-11 16:15:06,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:15:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:15:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2021-06-11 16:15:06,568 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8324125230202578 [2021-06-11 16:15:06,568 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2021-06-11 16:15:06,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2021-06-11 16:15:06,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:06,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2021-06-11 16:15:06,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:06,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:06,582 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:06,583 INFO L185 Difference]: Start difference. First operand has 36 places, 28 transitions, 65 flow. Second operand 3 states and 452 transitions. [2021-06-11 16:15:06,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 93 flow [2021-06-11 16:15:06,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 16:15:06,586 INFO L241 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2021-06-11 16:15:06,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=54, 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=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2021-06-11 16:15:06,588 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -3 predicate places. [2021-06-11 16:15:06,588 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:06,588 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 22 transitions, 54 flow [2021-06-11 16:15:06,589 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 22 transitions, 54 flow [2021-06-11 16:15:06,589 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2021-06-11 16:15:06,593 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-11 16:15:06,593 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:15:06,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 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/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 16:15:06,593 INFO L151 LiptonReduction]: Number of co-enabled transitions 226 [2021-06-11 16:15:06,707 INFO L163 LiptonReduction]: Checked pairs total: 234 [2021-06-11 16:15:06,707 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:06,707 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 119 [2021-06-11 16:15:06,708 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-06-11 16:15:06,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:06,708 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:06,709 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:06,709 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 16:15:06,709 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-06-11 16:15:06,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:06,710 INFO L82 PathProgramCache]: Analyzing trace with hash 294922873, now seen corresponding path program 1 times [2021-06-11 16:15:06,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:06,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251666259] [2021-06-11 16:15:06,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:06,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:06,835 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:06,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:06,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251666259] [2021-06-11 16:15:06,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:06,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:15:06,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910821308] [2021-06-11 16:15:06,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:15:06,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:06,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:15:06,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:15:06,840 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 181 [2021-06-11 16:15:06,840 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 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-06-11 16:15:06,840 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:06,840 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 181 [2021-06-11 16:15:06,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:06,847 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-11 16:15:06,847 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:15:06,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 1/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 16:15:06,847 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 1 selfloop transitions, 2 changer transitions 2/22 dead transitions. [2021-06-11 16:15:06,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 60 flow [2021-06-11 16:15:06,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:15:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:15:06,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2021-06-11 16:15:06,849 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8416206261510129 [2021-06-11 16:15:06,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 457 transitions. [2021-06-11 16:15:06,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 457 transitions. [2021-06-11 16:15:06,849 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:06,849 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 457 transitions. [2021-06-11 16:15:06,850 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-06-11 16:15:06,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:06,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:06,851 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 457 transitions. [2021-06-11 16:15:06,851 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 60 flow [2021-06-11 16:15:06,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:15:06,852 INFO L241 Difference]: Finished difference. Result has 32 places, 20 transitions, 54 flow [2021-06-11 16:15:06,852 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=20} [2021-06-11 16:15:06,852 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -4 predicate places. [2021-06-11 16:15:06,853 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:06,853 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 20 transitions, 54 flow [2021-06-11 16:15:06,853 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 20 transitions, 54 flow [2021-06-11 16:15:06,853 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 30 places, 20 transitions, 54 flow [2021-06-11 16:15:06,859 INFO L129 PetriNetUnfolder]: 0/20 cut-off events. [2021-06-11 16:15:06,859 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 16:15:06,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 20 events. 0/20 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-06-11 16:15:06,859 INFO L151 LiptonReduction]: Number of co-enabled transitions 188 [2021-06-11 16:15:07,037 INFO L163 LiptonReduction]: Checked pairs total: 209 [2021-06-11 16:15:07,037 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:07,038 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 185 [2021-06-11 16:15:07,038 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-06-11 16:15:07,039 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-06-11 16:15:07,039 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:07,039 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:07,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 16:15:07,039 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-06-11 16:15:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash 552155161, now seen corresponding path program 1 times [2021-06-11 16:15:07,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:07,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029383581] [2021-06-11 16:15:07,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:07,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:07,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:07,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029383581] [2021-06-11 16:15:07,141 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:07,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 16:15:07,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164271244] [2021-06-11 16:15:07,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 16:15:07,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:07,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 16:15:07,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 16:15:07,142 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 181 [2021-06-11 16:15:07,143 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,143 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:07,143 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 181 [2021-06-11 16:15:07,143 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:07,154 INFO L129 PetriNetUnfolder]: 7/45 cut-off events. [2021-06-11 16:15:07,155 INFO L130 PetriNetUnfolder]: For 7/17 co-relation queries the response was YES. [2021-06-11 16:15:07,155 INFO L84 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 45 events. 7/45 cut-off events. For 7/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 123 event pairs, 2 based on Foata normal form. 1/45 useless extension candidates. Maximal degree in co-relation 75. Up to 17 conditions per place. [2021-06-11 16:15:07,155 INFO L132 encePairwiseOnDemand]: 177/181 looper letters, 5 selfloop transitions, 3 changer transitions 0/23 dead transitions. [2021-06-11 16:15:07,155 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 23 transitions, 79 flow [2021-06-11 16:15:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 16:15:07,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 16:15:07,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2021-06-11 16:15:07,157 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8397790055248618 [2021-06-11 16:15:07,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2021-06-11 16:15:07,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2021-06-11 16:15:07,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:07,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2021-06-11 16:15:07,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,159 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 3 states and 456 transitions. [2021-06-11 16:15:07,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 23 transitions, 79 flow [2021-06-11 16:15:07,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 23 transitions, 73 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:15:07,160 INFO L241 Difference]: Finished difference. Result has 31 places, 22 transitions, 69 flow [2021-06-11 16:15:07,160 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2021-06-11 16:15:07,160 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2021-06-11 16:15:07,160 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:07,160 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 22 transitions, 69 flow [2021-06-11 16:15:07,161 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 22 transitions, 69 flow [2021-06-11 16:15:07,161 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 69 flow [2021-06-11 16:15:07,164 INFO L129 PetriNetUnfolder]: 3/30 cut-off events. [2021-06-11 16:15:07,164 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 16:15:07,164 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 30 events. 3/30 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 59 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 47. Up to 10 conditions per place. [2021-06-11 16:15:07,164 INFO L151 LiptonReduction]: Number of co-enabled transitions 214 [2021-06-11 16:15:07,207 INFO L163 LiptonReduction]: Checked pairs total: 169 [2021-06-11 16:15:07,207 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:07,207 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-06-11 16:15:07,208 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 69 flow [2021-06-11 16:15:07,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,208 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:07,209 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:07,209 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 16:15:07,209 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-06-11 16:15:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:07,209 INFO L82 PathProgramCache]: Analyzing trace with hash -46990682, now seen corresponding path program 1 times [2021-06-11 16:15:07,209 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:07,209 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043314883] [2021-06-11 16:15:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:07,258 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,259 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:15:07,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,267 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:15:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:07,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043314883] [2021-06-11 16:15:07,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:07,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:15:07,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348141832] [2021-06-11 16:15:07,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:15:07,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:07,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:15:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:15:07,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 181 [2021-06-11 16:15:07,275 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 69 flow. Second operand has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,275 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:07,275 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 181 [2021-06-11 16:15:07,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:07,328 INFO L129 PetriNetUnfolder]: 100/208 cut-off events. [2021-06-11 16:15:07,329 INFO L130 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2021-06-11 16:15:07,329 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 208 events. 100/208 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 883 event pairs, 27 based on Foata normal form. 4/194 useless extension candidates. Maximal degree in co-relation 435. Up to 148 conditions per place. [2021-06-11 16:15:07,330 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 10 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2021-06-11 16:15:07,330 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 117 flow [2021-06-11 16:15:07,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:15:07,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:15:07,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 530 transitions. [2021-06-11 16:15:07,332 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7320441988950276 [2021-06-11 16:15:07,332 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 530 transitions. [2021-06-11 16:15:07,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 530 transitions. [2021-06-11 16:15:07,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:07,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 530 transitions. [2021-06-11 16:15:07,333 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-06-11 16:15:07,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,335 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,335 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 69 flow. Second operand 4 states and 530 transitions. [2021-06-11 16:15:07,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 117 flow [2021-06-11 16:15:07,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 16:15:07,336 INFO L241 Difference]: Finished difference. Result has 35 places, 27 transitions, 107 flow [2021-06-11 16:15:07,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=107, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2021-06-11 16:15:07,336 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, -1 predicate places. [2021-06-11 16:15:07,336 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:07,336 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 107 flow [2021-06-11 16:15:07,336 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 107 flow [2021-06-11 16:15:07,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 107 flow [2021-06-11 16:15:07,344 INFO L129 PetriNetUnfolder]: 17/79 cut-off events. [2021-06-11 16:15:07,344 INFO L130 PetriNetUnfolder]: For 71/95 co-relation queries the response was YES. [2021-06-11 16:15:07,344 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 79 events. 17/79 cut-off events. For 71/95 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 335 event pairs, 6 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 169. Up to 31 conditions per place. [2021-06-11 16:15:07,346 INFO L151 LiptonReduction]: Number of co-enabled transitions 258 [2021-06-11 16:15:07,389 INFO L163 LiptonReduction]: Checked pairs total: 78 [2021-06-11 16:15:07,389 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:07,389 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-06-11 16:15:07,390 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 107 flow [2021-06-11 16:15:07,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 128.75) internal successors, (515), 4 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,391 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:07,391 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:07,391 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 16:15:07,391 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-06-11 16:15:07,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:07,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1988546210, now seen corresponding path program 1 times [2021-06-11 16:15:07,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:07,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114732912] [2021-06-11 16:15:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:07,420 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:07,423 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:07,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114732912] [2021-06-11 16:15:07,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:07,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 16:15:07,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800266976] [2021-06-11 16:15:07,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:15:07,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:07,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:15:07,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:15:07,427 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2021-06-11 16:15:07,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:07,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2021-06-11 16:15:07,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:07,462 INFO L129 PetriNetUnfolder]: 30/135 cut-off events. [2021-06-11 16:15:07,462 INFO L130 PetriNetUnfolder]: For 206/270 co-relation queries the response was YES. [2021-06-11 16:15:07,463 INFO L84 FinitePrefix]: Finished finitePrefix Result has 317 conditions, 135 events. 30/135 cut-off events. For 206/270 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 706 event pairs, 3 based on Foata normal form. 12/139 useless extension candidates. Maximal degree in co-relation 303. Up to 48 conditions per place. [2021-06-11 16:15:07,463 INFO L132 encePairwiseOnDemand]: 176/181 looper letters, 5 selfloop transitions, 4 changer transitions 1/30 dead transitions. [2021-06-11 16:15:07,463 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 30 transitions, 138 flow [2021-06-11 16:15:07,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:15:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:15:07,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2021-06-11 16:15:07,465 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8107734806629834 [2021-06-11 16:15:07,465 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 587 transitions. [2021-06-11 16:15:07,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 587 transitions. [2021-06-11 16:15:07,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:07,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 587 transitions. [2021-06-11 16:15:07,466 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-06-11 16:15:07,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,468 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,468 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 107 flow. Second operand 4 states and 587 transitions. [2021-06-11 16:15:07,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 30 transitions, 138 flow [2021-06-11 16:15:07,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 30 transitions, 138 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 16:15:07,470 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 120 flow [2021-06-11 16:15:07,470 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2021-06-11 16:15:07,470 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2021-06-11 16:15:07,470 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:07,470 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 120 flow [2021-06-11 16:15:07,471 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 120 flow [2021-06-11 16:15:07,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 120 flow [2021-06-11 16:15:07,479 INFO L129 PetriNetUnfolder]: 17/83 cut-off events. [2021-06-11 16:15:07,479 INFO L130 PetriNetUnfolder]: For 116/140 co-relation queries the response was YES. [2021-06-11 16:15:07,479 INFO L84 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 83 events. 17/83 cut-off events. For 116/140 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 364 event pairs, 6 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 192. Up to 32 conditions per place. [2021-06-11 16:15:07,480 INFO L151 LiptonReduction]: Number of co-enabled transitions 238 [2021-06-11 16:15:07,481 INFO L163 LiptonReduction]: Checked pairs total: 74 [2021-06-11 16:15:07,481 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:07,481 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11 [2021-06-11 16:15:07,484 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 120 flow [2021-06-11 16:15:07,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,484 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:07,484 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:07,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 16:15:07,484 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-06-11 16:15:07,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1778428466, now seen corresponding path program 2 times [2021-06-11 16:15:07,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:07,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139178965] [2021-06-11 16:15:07,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:07,558 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,558 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:15:07,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:15:07,575 INFO L142 QuantifierPusher]: treesize reduction 31, result has 40.4 percent of original size [2021-06-11 16:15:07,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 16:15:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:07,589 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139178965] [2021-06-11 16:15:07,589 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:07,589 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:15:07,589 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915704085] [2021-06-11 16:15:07,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:15:07,589 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:07,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:15:07,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:15:07,590 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 181 [2021-06-11 16:15:07,591 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 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-06-11 16:15:07,591 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:07,591 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 181 [2021-06-11 16:15:07,591 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:07,664 INFO L129 PetriNetUnfolder]: 100/220 cut-off events. [2021-06-11 16:15:07,664 INFO L130 PetriNetUnfolder]: For 432/464 co-relation queries the response was YES. [2021-06-11 16:15:07,665 INFO L84 FinitePrefix]: Finished finitePrefix Result has 644 conditions, 220 events. 100/220 cut-off events. For 432/464 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1006 event pairs, 28 based on Foata normal form. 11/218 useless extension candidates. Maximal degree in co-relation 627. Up to 135 conditions per place. [2021-06-11 16:15:07,666 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 12 selfloop transitions, 8 changer transitions 0/34 dead transitions. [2021-06-11 16:15:07,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 34 transitions, 180 flow [2021-06-11 16:15:07,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:15:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:15:07,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2021-06-11 16:15:07,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7762430939226519 [2021-06-11 16:15:07,668 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2021-06-11 16:15:07,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2021-06-11 16:15:07,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:07,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2021-06-11 16:15:07,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,671 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,671 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 120 flow. Second operand 4 states and 562 transitions. [2021-06-11 16:15:07,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 34 transitions, 180 flow [2021-06-11 16:15:07,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 34 transitions, 170 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-06-11 16:15:07,674 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 160 flow [2021-06-11 16:15:07,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-06-11 16:15:07,675 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2021-06-11 16:15:07,675 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:07,675 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 160 flow [2021-06-11 16:15:07,675 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 160 flow [2021-06-11 16:15:07,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 160 flow [2021-06-11 16:15:07,697 INFO L129 PetriNetUnfolder]: 75/182 cut-off events. [2021-06-11 16:15:07,698 INFO L130 PetriNetUnfolder]: For 288/298 co-relation queries the response was YES. [2021-06-11 16:15:07,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 182 events. 75/182 cut-off events. For 288/298 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 859 event pairs, 36 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 518. Up to 93 conditions per place. [2021-06-11 16:15:07,699 INFO L151 LiptonReduction]: Number of co-enabled transitions 238 [2021-06-11 16:15:07,702 INFO L163 LiptonReduction]: Checked pairs total: 42 [2021-06-11 16:15:07,702 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:07,702 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-06-11 16:15:07,703 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 160 flow [2021-06-11 16:15:07,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 136.8) internal successors, (684), 5 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-06-11 16:15:07,703 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:07,703 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:07,703 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 16:15:07,703 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-06-11 16:15:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash 2098868438, now seen corresponding path program 1 times [2021-06-11 16:15:07,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:07,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167238966] [2021-06-11 16:15:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:07,738 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:07,740 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,740 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:07,742 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,743 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:07,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167238966] [2021-06-11 16:15:07,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:07,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:15:07,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882083997] [2021-06-11 16:15:07,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:15:07,746 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:15:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:15:07,747 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 181 [2021-06-11 16:15:07,747 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:07,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 181 [2021-06-11 16:15:07,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:07,799 INFO L129 PetriNetUnfolder]: 105/293 cut-off events. [2021-06-11 16:15:07,799 INFO L130 PetriNetUnfolder]: For 924/989 co-relation queries the response was YES. [2021-06-11 16:15:07,799 INFO L84 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 293 events. 105/293 cut-off events. For 924/989 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1794 event pairs, 51 based on Foata normal form. 33/296 useless extension candidates. Maximal degree in co-relation 765. Up to 149 conditions per place. [2021-06-11 16:15:07,800 INFO L132 encePairwiseOnDemand]: 177/181 looper letters, 4 selfloop transitions, 4 changer transitions 1/33 dead transitions. [2021-06-11 16:15:07,800 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 33 transitions, 186 flow [2021-06-11 16:15:07,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:15:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:15:07,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2021-06-11 16:15:07,802 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8077348066298342 [2021-06-11 16:15:07,802 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2021-06-11 16:15:07,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2021-06-11 16:15:07,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:07,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2021-06-11 16:15:07,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.2) internal successors, (731), 5 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-06-11 16:15:07,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,805 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 160 flow. Second operand 5 states and 731 transitions. [2021-06-11 16:15:07,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 33 transitions, 186 flow [2021-06-11 16:15:07,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 178 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-06-11 16:15:07,809 INFO L241 Difference]: Finished difference. Result has 47 places, 32 transitions, 177 flow [2021-06-11 16:15:07,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=47, PETRI_TRANSITIONS=32} [2021-06-11 16:15:07,809 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2021-06-11 16:15:07,809 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:07,809 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 32 transitions, 177 flow [2021-06-11 16:15:07,809 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 32 transitions, 177 flow [2021-06-11 16:15:07,810 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 32 transitions, 177 flow [2021-06-11 16:15:07,832 INFO L129 PetriNetUnfolder]: 91/269 cut-off events. [2021-06-11 16:15:07,832 INFO L130 PetriNetUnfolder]: For 617/645 co-relation queries the response was YES. [2021-06-11 16:15:07,833 INFO L84 FinitePrefix]: Finished finitePrefix Result has 748 conditions, 269 events. 91/269 cut-off events. For 617/645 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1580 event pairs, 40 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 729. Up to 127 conditions per place. [2021-06-11 16:15:07,834 INFO L151 LiptonReduction]: Number of co-enabled transitions 240 [2021-06-11 16:15:07,838 INFO L163 LiptonReduction]: Checked pairs total: 44 [2021-06-11 16:15:07,838 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:07,838 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 29 [2021-06-11 16:15:07,838 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 177 flow [2021-06-11 16:15:07,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,839 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:07,839 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:07,839 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 16:15:07,839 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-06-11 16:15:07,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:07,839 INFO L82 PathProgramCache]: Analyzing trace with hash 269713586, now seen corresponding path program 1 times [2021-06-11 16:15:07,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:07,839 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787897400] [2021-06-11 16:15:07,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:07,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:15:07,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:15:07,894 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,894 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:15:07,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:07,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:15:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:07,906 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787897400] [2021-06-11 16:15:07,906 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:07,907 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:15:07,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066574977] [2021-06-11 16:15:07,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:15:07,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:15:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:15:07,908 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 181 [2021-06-11 16:15:07,909 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 32 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:07,909 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:07,909 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 181 [2021-06-11 16:15:07,909 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:08,003 INFO L129 PetriNetUnfolder]: 161/374 cut-off events. [2021-06-11 16:15:08,004 INFO L130 PetriNetUnfolder]: For 1011/1093 co-relation queries the response was YES. [2021-06-11 16:15:08,005 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 374 events. 161/374 cut-off events. For 1011/1093 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2149 event pairs, 26 based on Foata normal form. 7/366 useless extension candidates. Maximal degree in co-relation 1235. Up to 248 conditions per place. [2021-06-11 16:15:08,006 INFO L132 encePairwiseOnDemand]: 173/181 looper letters, 12 selfloop transitions, 11 changer transitions 1/39 dead transitions. [2021-06-11 16:15:08,006 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 257 flow [2021-06-11 16:15:08,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:15:08,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:15:08,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 681 transitions. [2021-06-11 16:15:08,008 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7524861878453039 [2021-06-11 16:15:08,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 681 transitions. [2021-06-11 16:15:08,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 681 transitions. [2021-06-11 16:15:08,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:08,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 681 transitions. [2021-06-11 16:15:08,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,010 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,010 INFO L185 Difference]: Start difference. First operand has 46 places, 32 transitions, 177 flow. Second operand 5 states and 681 transitions. [2021-06-11 16:15:08,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 257 flow [2021-06-11 16:15:08,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 248 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-11 16:15:08,012 INFO L241 Difference]: Finished difference. Result has 49 places, 35 transitions, 218 flow [2021-06-11 16:15:08,013 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=218, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2021-06-11 16:15:08,013 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2021-06-11 16:15:08,013 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:08,013 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 35 transitions, 218 flow [2021-06-11 16:15:08,013 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 35 transitions, 218 flow [2021-06-11 16:15:08,013 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 35 transitions, 218 flow [2021-06-11 16:15:08,040 INFO L129 PetriNetUnfolder]: 128/315 cut-off events. [2021-06-11 16:15:08,040 INFO L130 PetriNetUnfolder]: For 586/663 co-relation queries the response was YES. [2021-06-11 16:15:08,041 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 315 events. 128/315 cut-off events. For 586/663 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1815 event pairs, 50 based on Foata normal form. 1/284 useless extension candidates. Maximal degree in co-relation 1008. Up to 183 conditions per place. [2021-06-11 16:15:08,043 INFO L151 LiptonReduction]: Number of co-enabled transitions 250 [2021-06-11 16:15:08,046 INFO L163 LiptonReduction]: Checked pairs total: 72 [2021-06-11 16:15:08,046 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:08,046 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-06-11 16:15:08,046 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 218 flow [2021-06-11 16:15:08,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,047 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:08,047 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:08,047 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 16:15:08,047 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-06-11 16:15:08,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:08,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2099827516, now seen corresponding path program 1 times [2021-06-11 16:15:08,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:08,047 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513271817] [2021-06-11 16:15:08,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:08,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:15:08,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:15:08,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,096 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:15:08,105 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 16:15:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:08,112 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513271817] [2021-06-11 16:15:08,112 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:08,112 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:15:08,112 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032814615] [2021-06-11 16:15:08,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:15:08,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:08,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:15:08,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:15:08,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 181 [2021-06-11 16:15:08,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 218 flow. Second operand has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:08,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 181 [2021-06-11 16:15:08,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:08,235 INFO L129 PetriNetUnfolder]: 153/341 cut-off events. [2021-06-11 16:15:08,236 INFO L130 PetriNetUnfolder]: For 821/919 co-relation queries the response was YES. [2021-06-11 16:15:08,236 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 341 events. 153/341 cut-off events. For 821/919 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1806 event pairs, 42 based on Foata normal form. 19/342 useless extension candidates. Maximal degree in co-relation 1332. Up to 250 conditions per place. [2021-06-11 16:15:08,237 INFO L132 encePairwiseOnDemand]: 176/181 looper letters, 18 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2021-06-11 16:15:08,237 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 40 transitions, 298 flow [2021-06-11 16:15:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 16:15:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 16:15:08,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 513 transitions. [2021-06-11 16:15:08,240 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7085635359116023 [2021-06-11 16:15:08,240 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 513 transitions. [2021-06-11 16:15:08,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 513 transitions. [2021-06-11 16:15:08,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:08,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 513 transitions. [2021-06-11 16:15:08,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,243 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 181.0) internal successors, (905), 5 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,243 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 218 flow. Second operand 4 states and 513 transitions. [2021-06-11 16:15:08,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 40 transitions, 298 flow [2021-06-11 16:15:08,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 40 transitions, 272 flow, removed 4 selfloop flow, removed 3 redundant places. [2021-06-11 16:15:08,245 INFO L241 Difference]: Finished difference. Result has 50 places, 37 transitions, 227 flow [2021-06-11 16:15:08,245 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=227, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2021-06-11 16:15:08,245 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2021-06-11 16:15:08,245 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:08,245 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 37 transitions, 227 flow [2021-06-11 16:15:08,245 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 37 transitions, 227 flow [2021-06-11 16:15:08,245 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 37 transitions, 227 flow [2021-06-11 16:15:08,272 INFO L129 PetriNetUnfolder]: 127/316 cut-off events. [2021-06-11 16:15:08,272 INFO L130 PetriNetUnfolder]: For 797/901 co-relation queries the response was YES. [2021-06-11 16:15:08,273 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1100 conditions, 316 events. 127/316 cut-off events. For 797/901 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1848 event pairs, 58 based on Foata normal form. 6/294 useless extension candidates. Maximal degree in co-relation 1079. Up to 179 conditions per place. [2021-06-11 16:15:08,275 INFO L151 LiptonReduction]: Number of co-enabled transitions 256 [2021-06-11 16:15:08,278 INFO L163 LiptonReduction]: Checked pairs total: 78 [2021-06-11 16:15:08,278 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:08,278 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-06-11 16:15:08,279 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 227 flow [2021-06-11 16:15:08,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,279 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:08,279 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:08,279 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 16:15:08,279 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-06-11 16:15:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash 248318006, now seen corresponding path program 2 times [2021-06-11 16:15:08,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:08,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917983938] [2021-06-11 16:15:08,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:08,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 16:15:08,315 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 16:15:08,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 16:15:08,327 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.8 percent of original size [2021-06-11 16:15:08,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-11 16:15:08,341 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:15:08,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:08,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917983938] [2021-06-11 16:15:08,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:08,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:15:08,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076914217] [2021-06-11 16:15:08,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:15:08,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:08,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:15:08,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:15:08,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 181 [2021-06-11 16:15:08,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 227 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-06-11 16:15:08,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:08,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 181 [2021-06-11 16:15:08,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:08,433 INFO L129 PetriNetUnfolder]: 175/424 cut-off events. [2021-06-11 16:15:08,433 INFO L130 PetriNetUnfolder]: For 1229/1353 co-relation queries the response was YES. [2021-06-11 16:15:08,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1702 conditions, 424 events. 175/424 cut-off events. For 1229/1353 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2610 event pairs, 13 based on Foata normal form. 17/431 useless extension candidates. Maximal degree in co-relation 1679. Up to 236 conditions per place. [2021-06-11 16:15:08,435 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 19 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2021-06-11 16:15:08,435 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 44 transitions, 333 flow [2021-06-11 16:15:08,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:15:08,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:15:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2021-06-11 16:15:08,437 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7425414364640884 [2021-06-11 16:15:08,438 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2021-06-11 16:15:08,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2021-06-11 16:15:08,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:08,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2021-06-11 16:15:08,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,440 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,440 INFO L185 Difference]: Start difference. First operand has 50 places, 37 transitions, 227 flow. Second operand 5 states and 672 transitions. [2021-06-11 16:15:08,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 44 transitions, 333 flow [2021-06-11 16:15:08,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 44 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 16:15:08,442 INFO L241 Difference]: Finished difference. Result has 53 places, 40 transitions, 274 flow [2021-06-11 16:15:08,442 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=53, PETRI_TRANSITIONS=40} [2021-06-11 16:15:08,443 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 17 predicate places. [2021-06-11 16:15:08,443 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:08,443 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 40 transitions, 274 flow [2021-06-11 16:15:08,443 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 40 transitions, 274 flow [2021-06-11 16:15:08,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 40 transitions, 274 flow [2021-06-11 16:15:08,473 INFO L129 PetriNetUnfolder]: 148/358 cut-off events. [2021-06-11 16:15:08,473 INFO L130 PetriNetUnfolder]: For 1033/1139 co-relation queries the response was YES. [2021-06-11 16:15:08,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 358 events. 148/358 cut-off events. For 1033/1139 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2092 event pairs, 60 based on Foata normal form. 6/333 useless extension candidates. Maximal degree in co-relation 1414. Up to 212 conditions per place. [2021-06-11 16:15:08,476 INFO L151 LiptonReduction]: Number of co-enabled transitions 272 [2021-06-11 16:15:08,479 INFO L163 LiptonReduction]: Checked pairs total: 87 [2021-06-11 16:15:08,479 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:08,479 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-06-11 16:15:08,480 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 40 transitions, 274 flow [2021-06-11 16:15:08,480 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-06-11 16:15:08,480 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:08,480 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:08,480 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 16:15:08,480 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-06-11 16:15:08,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:08,480 INFO L82 PathProgramCache]: Analyzing trace with hash 671569972, now seen corresponding path program 3 times [2021-06-11 16:15:08,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:08,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053298846] [2021-06-11 16:15:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:08,507 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,508 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:15:08,515 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,516 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 16:15:08,531 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,532 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:15:08,540 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:15:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:08,550 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053298846] [2021-06-11 16:15:08,550 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:08,550 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:15:08,550 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879838595] [2021-06-11 16:15:08,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:15:08,550 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:15:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:15:08,551 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 181 [2021-06-11 16:15:08,552 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 40 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,552 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:08,552 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 181 [2021-06-11 16:15:08,552 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:08,665 INFO L129 PetriNetUnfolder]: 184/412 cut-off events. [2021-06-11 16:15:08,665 INFO L130 PetriNetUnfolder]: For 1614/1735 co-relation queries the response was YES. [2021-06-11 16:15:08,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 412 events. 184/412 cut-off events. For 1614/1735 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 2333 event pairs, 41 based on Foata normal form. 39/433 useless extension candidates. Maximal degree in co-relation 1958. Up to 262 conditions per place. [2021-06-11 16:15:08,668 INFO L132 encePairwiseOnDemand]: 173/181 looper letters, 17 selfloop transitions, 17 changer transitions 1/50 dead transitions. [2021-06-11 16:15:08,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 433 flow [2021-06-11 16:15:08,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:15:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:15:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2021-06-11 16:15:08,670 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7535911602209945 [2021-06-11 16:15:08,670 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2021-06-11 16:15:08,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2021-06-11 16:15:08,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:08,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2021-06-11 16:15:08,672 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,673 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,673 INFO L185 Difference]: Start difference. First operand has 53 places, 40 transitions, 274 flow. Second operand 5 states and 682 transitions. [2021-06-11 16:15:08,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 433 flow [2021-06-11 16:15:08,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 416 flow, removed 6 selfloop flow, removed 2 redundant places. [2021-06-11 16:15:08,676 INFO L241 Difference]: Finished difference. Result has 56 places, 45 transitions, 366 flow [2021-06-11 16:15:08,677 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2021-06-11 16:15:08,677 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 20 predicate places. [2021-06-11 16:15:08,677 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:08,677 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 45 transitions, 366 flow [2021-06-11 16:15:08,677 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 45 transitions, 366 flow [2021-06-11 16:15:08,677 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 45 transitions, 366 flow [2021-06-11 16:15:08,710 INFO L129 PetriNetUnfolder]: 151/364 cut-off events. [2021-06-11 16:15:08,710 INFO L130 PetriNetUnfolder]: For 1501/1648 co-relation queries the response was YES. [2021-06-11 16:15:08,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1693 conditions, 364 events. 151/364 cut-off events. For 1501/1648 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2154 event pairs, 32 based on Foata normal form. 9/337 useless extension candidates. Maximal degree in co-relation 1670. Up to 219 conditions per place. [2021-06-11 16:15:08,713 INFO L151 LiptonReduction]: Number of co-enabled transitions 292 [2021-06-11 16:15:08,716 INFO L163 LiptonReduction]: Checked pairs total: 102 [2021-06-11 16:15:08,717 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:08,717 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-06-11 16:15:08,719 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 366 flow [2021-06-11 16:15:08,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 132.83333333333334) internal successors, (797), 6 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,719 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:08,719 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:08,719 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 16:15:08,719 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-06-11 16:15:08,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:08,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1132330899, now seen corresponding path program 1 times [2021-06-11 16:15:08,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:08,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304964639] [2021-06-11 16:15:08,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:08,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:08,772 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:15:08,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:15:08,779 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:08,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:08,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304964639] [2021-06-11 16:15:08,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:08,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 16:15:08,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15089484] [2021-06-11 16:15:08,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 16:15:08,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:08,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 16:15:08,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 16:15:08,781 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 181 [2021-06-11 16:15:08,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:08,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 181 [2021-06-11 16:15:08,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:08,866 INFO L129 PetriNetUnfolder]: 310/708 cut-off events. [2021-06-11 16:15:08,866 INFO L130 PetriNetUnfolder]: For 2448/2759 co-relation queries the response was YES. [2021-06-11 16:15:08,868 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2698 conditions, 708 events. 310/708 cut-off events. For 2448/2759 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 4801 event pairs, 104 based on Foata normal form. 174/836 useless extension candidates. Maximal degree in co-relation 2673. Up to 338 conditions per place. [2021-06-11 16:15:08,870 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 10 selfloop transitions, 8 changer transitions 1/55 dead transitions. [2021-06-11 16:15:08,870 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 422 flow [2021-06-11 16:15:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:15:08,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:15:08,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2021-06-11 16:15:08,872 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7933701657458564 [2021-06-11 16:15:08,872 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2021-06-11 16:15:08,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2021-06-11 16:15:08,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:08,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2021-06-11 16:15:08,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,875 INFO L185 Difference]: Start difference. First operand has 56 places, 45 transitions, 366 flow. Second operand 5 states and 718 transitions. [2021-06-11 16:15:08,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 422 flow [2021-06-11 16:15:08,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 55 transitions, 400 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 16:15:08,879 INFO L241 Difference]: Finished difference. Result has 60 places, 51 transitions, 404 flow [2021-06-11 16:15:08,879 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=404, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2021-06-11 16:15:08,879 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2021-06-11 16:15:08,879 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:08,879 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 51 transitions, 404 flow [2021-06-11 16:15:08,879 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 51 transitions, 404 flow [2021-06-11 16:15:08,882 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 51 transitions, 404 flow [2021-06-11 16:15:08,926 INFO L129 PetriNetUnfolder]: 220/520 cut-off events. [2021-06-11 16:15:08,926 INFO L130 PetriNetUnfolder]: For 2309/2496 co-relation queries the response was YES. [2021-06-11 16:15:08,928 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2267 conditions, 520 events. 220/520 cut-off events. For 2309/2496 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3278 event pairs, 71 based on Foata normal form. 66/552 useless extension candidates. Maximal degree in co-relation 2241. Up to 231 conditions per place. [2021-06-11 16:15:08,931 INFO L151 LiptonReduction]: Number of co-enabled transitions 400 [2021-06-11 16:15:08,935 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:15:08,935 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:08,935 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 56 [2021-06-11 16:15:08,935 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 404 flow [2021-06-11 16:15:08,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,935 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:08,936 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:08,936 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 16:15:08,936 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-06-11 16:15:08,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:08,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1354724137, now seen corresponding path program 1 times [2021-06-11 16:15:08,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:08,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921809167] [2021-06-11 16:15:08,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:08,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:08,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:08,975 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:15:08,975 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:15:08,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:08,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:08,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:08,982 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921809167] [2021-06-11 16:15:08,982 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:08,982 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 16:15:08,982 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593963972] [2021-06-11 16:15:08,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 16:15:08,982 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:08,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 16:15:08,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 16:15:08,983 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 181 [2021-06-11 16:15:08,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:08,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:08,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 181 [2021-06-11 16:15:08,984 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:09,068 INFO L129 PetriNetUnfolder]: 112/349 cut-off events. [2021-06-11 16:15:09,069 INFO L130 PetriNetUnfolder]: For 1632/2178 co-relation queries the response was YES. [2021-06-11 16:15:09,070 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1564 conditions, 349 events. 112/349 cut-off events. For 1632/2178 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2298 event pairs, 15 based on Foata normal form. 251/581 useless extension candidates. Maximal degree in co-relation 1536. Up to 185 conditions per place. [2021-06-11 16:15:09,071 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 15 changer transitions 3/59 dead transitions. [2021-06-11 16:15:09,071 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 59 transitions, 490 flow [2021-06-11 16:15:09,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:15:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:15:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2021-06-11 16:15:09,073 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7932123125493291 [2021-06-11 16:15:09,073 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2021-06-11 16:15:09,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2021-06-11 16:15:09,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:09,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2021-06-11 16:15:09,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.57142857142858) internal successors, (1005), 7 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,076 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,077 INFO L185 Difference]: Start difference. First operand has 59 places, 51 transitions, 404 flow. Second operand 7 states and 1005 transitions. [2021-06-11 16:15:09,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 59 transitions, 490 flow [2021-06-11 16:15:09,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 59 transitions, 482 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-06-11 16:15:09,080 INFO L241 Difference]: Finished difference. Result has 66 places, 56 transitions, 477 flow [2021-06-11 16:15:09,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=477, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2021-06-11 16:15:09,081 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 30 predicate places. [2021-06-11 16:15:09,081 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:09,081 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 56 transitions, 477 flow [2021-06-11 16:15:09,082 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 56 transitions, 477 flow [2021-06-11 16:15:09,082 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 56 transitions, 477 flow [2021-06-11 16:15:09,108 INFO L129 PetriNetUnfolder]: 105/339 cut-off events. [2021-06-11 16:15:09,108 INFO L130 PetriNetUnfolder]: For 1626/1741 co-relation queries the response was YES. [2021-06-11 16:15:09,109 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1623 conditions, 339 events. 105/339 cut-off events. For 1626/1741 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2271 event pairs, 10 based on Foata normal form. 27/353 useless extension candidates. Maximal degree in co-relation 1594. Up to 174 conditions per place. [2021-06-11 16:15:09,111 INFO L151 LiptonReduction]: Number of co-enabled transitions 436 [2021-06-11 16:15:09,115 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:15:09,115 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:09,115 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 34 [2021-06-11 16:15:09,115 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 477 flow [2021-06-11 16:15:09,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,116 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:09,116 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:09,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 16:15:09,116 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-06-11 16:15:09,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:09,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1274710601, now seen corresponding path program 1 times [2021-06-11 16:15:09,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:09,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471238850] [2021-06-11 16:15:09,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:09,160 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:09,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:09,163 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:09,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:09,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:09,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 16:15:09,169 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 16:15:09,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 16:15:09,175 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:09,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:09,176 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471238850] [2021-06-11 16:15:09,176 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:09,176 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 16:15:09,176 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285940655] [2021-06-11 16:15:09,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 16:15:09,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:09,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 16:15:09,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 16:15:09,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 181 [2021-06-11 16:15:09,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 477 flow. Second operand has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:09,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 181 [2021-06-11 16:15:09,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:09,251 INFO L129 PetriNetUnfolder]: 84/292 cut-off events. [2021-06-11 16:15:09,252 INFO L130 PetriNetUnfolder]: For 1968/2620 co-relation queries the response was YES. [2021-06-11 16:15:09,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 292 events. 84/292 cut-off events. For 1968/2620 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 1983 event pairs, 5 based on Foata normal form. 229/504 useless extension candidates. Maximal degree in co-relation 1473. Up to 166 conditions per place. [2021-06-11 16:15:09,253 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 2 selfloop transitions, 19 changer transitions 14/60 dead transitions. [2021-06-11 16:15:09,254 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 60 transitions, 555 flow [2021-06-11 16:15:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 16:15:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 16:15:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2021-06-11 16:15:09,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7894413750767342 [2021-06-11 16:15:09,256 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2021-06-11 16:15:09,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2021-06-11 16:15:09,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:09,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2021-06-11 16:15:09,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.88888888888889) internal successors, (1286), 9 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,260 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 181.0) internal successors, (1810), 10 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,260 INFO L185 Difference]: Start difference. First operand has 66 places, 56 transitions, 477 flow. Second operand 9 states and 1286 transitions. [2021-06-11 16:15:09,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 60 transitions, 555 flow [2021-06-11 16:15:09,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 470 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-06-11 16:15:09,266 INFO L241 Difference]: Finished difference. Result has 73 places, 46 transitions, 377 flow [2021-06-11 16:15:09,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=377, PETRI_PLACES=73, PETRI_TRANSITIONS=46} [2021-06-11 16:15:09,266 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 37 predicate places. [2021-06-11 16:15:09,266 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:09,266 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 73 places, 46 transitions, 377 flow [2021-06-11 16:15:09,267 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 73 places, 46 transitions, 377 flow [2021-06-11 16:15:09,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 46 transitions, 377 flow [2021-06-11 16:15:09,276 INFO L129 PetriNetUnfolder]: 31/114 cut-off events. [2021-06-11 16:15:09,276 INFO L130 PetriNetUnfolder]: For 418/435 co-relation queries the response was YES. [2021-06-11 16:15:09,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 114 events. 31/114 cut-off events. For 418/435 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 569 event pairs, 0 based on Foata normal form. 4/114 useless extension candidates. Maximal degree in co-relation 481. Up to 30 conditions per place. [2021-06-11 16:15:09,277 INFO L151 LiptonReduction]: Number of co-enabled transitions 258 [2021-06-11 16:15:09,279 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:15:09,279 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:09,279 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-06-11 16:15:09,280 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 377 flow [2021-06-11 16:15:09,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,280 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:09,280 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:09,280 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 16:15:09,280 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-06-11 16:15:09,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:09,281 INFO L82 PathProgramCache]: Analyzing trace with hash 994796540, now seen corresponding path program 1 times [2021-06-11 16:15:09,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:09,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254944983] [2021-06-11 16:15:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:09,330 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-06-11 16:15:09,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 16:15:09,349 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.3 percent of original size [2021-06-11 16:15:09,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 16:15:09,380 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-06-11 16:15:09,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-06-11 16:15:09,407 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-06-11 16:15:09,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-06-11 16:15:09,443 INFO L142 QuantifierPusher]: treesize reduction 30, result has 59.5 percent of original size [2021-06-11 16:15:09,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 16:15:09,472 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:09,473 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:15:09,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:09,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 16:15:09,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:09,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254944983] [2021-06-11 16:15:09,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:09,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 16:15:09,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965164257] [2021-06-11 16:15:09,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 16:15:09,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:09,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 16:15:09,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-06-11 16:15:09,487 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 181 [2021-06-11 16:15:09,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 377 flow. Second operand has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:09,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 181 [2021-06-11 16:15:09,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:09,672 INFO L129 PetriNetUnfolder]: 57/204 cut-off events. [2021-06-11 16:15:09,672 INFO L130 PetriNetUnfolder]: For 1441/1601 co-relation queries the response was YES. [2021-06-11 16:15:09,673 INFO L84 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 204 events. 57/204 cut-off events. For 1441/1601 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 1228 event pairs, 0 based on Foata normal form. 30/219 useless extension candidates. Maximal degree in co-relation 915. Up to 70 conditions per place. [2021-06-11 16:15:09,673 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 15 selfloop transitions, 7 changer transitions 7/56 dead transitions. [2021-06-11 16:15:09,673 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 56 transitions, 547 flow [2021-06-11 16:15:09,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 16:15:09,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 16:15:09,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2021-06-11 16:15:09,676 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7024467245461721 [2021-06-11 16:15:09,676 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2021-06-11 16:15:09,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2021-06-11 16:15:09,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:09,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2021-06-11 16:15:09,677 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.14285714285714) internal successors, (890), 7 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,679 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,679 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,679 INFO L185 Difference]: Start difference. First operand has 70 places, 46 transitions, 377 flow. Second operand 7 states and 890 transitions. [2021-06-11 16:15:09,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 56 transitions, 547 flow [2021-06-11 16:15:09,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 56 transitions, 435 flow, removed 28 selfloop flow, removed 15 redundant places. [2021-06-11 16:15:09,683 INFO L241 Difference]: Finished difference. Result has 65 places, 46 transitions, 328 flow [2021-06-11 16:15:09,683 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=328, PETRI_PLACES=65, PETRI_TRANSITIONS=46} [2021-06-11 16:15:09,683 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 29 predicate places. [2021-06-11 16:15:09,683 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:09,683 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 46 transitions, 328 flow [2021-06-11 16:15:09,683 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 46 transitions, 328 flow [2021-06-11 16:15:09,683 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 46 transitions, 328 flow [2021-06-11 16:15:09,693 INFO L129 PetriNetUnfolder]: 38/140 cut-off events. [2021-06-11 16:15:09,693 INFO L130 PetriNetUnfolder]: For 261/271 co-relation queries the response was YES. [2021-06-11 16:15:09,693 INFO L84 FinitePrefix]: Finished finitePrefix Result has 524 conditions, 140 events. 38/140 cut-off events. For 261/271 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 741 event pairs, 1 based on Foata normal form. 7/142 useless extension candidates. Maximal degree in co-relation 500. Up to 45 conditions per place. [2021-06-11 16:15:09,694 INFO L151 LiptonReduction]: Number of co-enabled transitions 236 [2021-06-11 16:15:09,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:09,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 16:15:09,799 INFO L163 LiptonReduction]: Checked pairs total: 5 [2021-06-11 16:15:09,799 INFO L165 LiptonReduction]: Total number of compositions: 1 [2021-06-11 16:15:09,799 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-06-11 16:15:09,800 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 45 transitions, 326 flow [2021-06-11 16:15:09,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 125.0) internal successors, (1000), 8 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:09,800 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:09,800 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:09,800 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 16:15:09,800 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-06-11 16:15:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1367492510, now seen corresponding path program 2 times [2021-06-11 16:15:09,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:09,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377402796] [2021-06-11 16:15:09,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 16:15:09,848 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-06-11 16:15:09,849 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 16:15:09,871 INFO L142 QuantifierPusher]: treesize reduction 11, result has 88.3 percent of original size [2021-06-11 16:15:09,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 83 [2021-06-11 16:15:09,905 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-06-11 16:15:09,906 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-06-11 16:15:09,934 INFO L142 QuantifierPusher]: treesize reduction 38, result has 64.8 percent of original size [2021-06-11 16:15:09,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-06-11 16:15:09,971 INFO L142 QuantifierPusher]: treesize reduction 38, result has 65.8 percent of original size [2021-06-11 16:15:09,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-06-11 16:15:10,010 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:10,010 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 16:15:10,021 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 16:15:10,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 16:15:10,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 16:15:10,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377402796] [2021-06-11 16:15:10,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 16:15:10,036 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 16:15:10,036 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319433625] [2021-06-11 16:15:10,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 16:15:10,036 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 16:15:10,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 16:15:10,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-11 16:15:10,038 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-06-11 16:15:10,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 45 transitions, 326 flow. Second operand has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:10,038 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 16:15:10,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-06-11 16:15:10,039 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 16:15:10,139 INFO L129 PetriNetUnfolder]: 45/161 cut-off events. [2021-06-11 16:15:10,139 INFO L130 PetriNetUnfolder]: For 447/489 co-relation queries the response was YES. [2021-06-11 16:15:10,140 INFO L84 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 161 events. 45/161 cut-off events. For 447/489 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 899 event pairs, 0 based on Foata normal form. 15/166 useless extension candidates. Maximal degree in co-relation 601. Up to 55 conditions per place. [2021-06-11 16:15:10,140 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 10 selfloop transitions, 8 changer transitions 4/47 dead transitions. [2021-06-11 16:15:10,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 47 transitions, 388 flow [2021-06-11 16:15:10,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 16:15:10,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 16:15:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 628 transitions. [2021-06-11 16:15:10,142 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6901098901098901 [2021-06-11 16:15:10,142 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 628 transitions. [2021-06-11 16:15:10,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 628 transitions. [2021-06-11 16:15:10,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 16:15:10,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 628 transitions. [2021-06-11 16:15:10,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:10,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:10,145 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:10,145 INFO L185 Difference]: Start difference. First operand has 62 places, 45 transitions, 326 flow. Second operand 5 states and 628 transitions. [2021-06-11 16:15:10,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 47 transitions, 388 flow [2021-06-11 16:15:10,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 47 transitions, 370 flow, removed 5 selfloop flow, removed 5 redundant places. [2021-06-11 16:15:10,147 INFO L241 Difference]: Finished difference. Result has 62 places, 42 transitions, 311 flow [2021-06-11 16:15:10,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=311, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2021-06-11 16:15:10,148 INFO L343 CegarLoopForPetriNet]: 36 programPoint places, 26 predicate places. [2021-06-11 16:15:10,148 INFO L173 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-06-11 16:15:10,148 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 42 transitions, 311 flow [2021-06-11 16:15:10,148 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 42 transitions, 311 flow [2021-06-11 16:15:10,148 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 42 transitions, 311 flow [2021-06-11 16:15:10,156 INFO L129 PetriNetUnfolder]: 24/116 cut-off events. [2021-06-11 16:15:10,157 INFO L130 PetriNetUnfolder]: For 252/264 co-relation queries the response was YES. [2021-06-11 16:15:10,157 INFO L84 FinitePrefix]: Finished finitePrefix Result has 441 conditions, 116 events. 24/116 cut-off events. For 252/264 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 606 event pairs, 2 based on Foata normal form. 6/119 useless extension candidates. Maximal degree in co-relation 417. Up to 30 conditions per place. [2021-06-11 16:15:10,158 INFO L151 LiptonReduction]: Number of co-enabled transitions 146 [2021-06-11 16:15:10,160 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 16:15:10,160 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 16:15:10,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-06-11 16:15:10,160 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 311 flow [2021-06-11 16:15:10,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 123.88888888888889) internal successors, (1115), 9 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 16:15:10,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 16:15:10,161 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 16:15:10,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 16:15:10,161 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-06-11 16:15:10,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 16:15:10,161 INFO L82 PathProgramCache]: Analyzing trace with hash -767651108, now seen corresponding path program 1 times [2021-06-11 16:15:10,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 16:15:10,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716631605] [2021-06-11 16:15:10,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 16:15:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:15:10,194 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:15:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 16:15:10,220 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 16:15:10,248 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 16:15:10,249 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 16:15:10,249 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 16:15:10,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 04:15:10 BasicIcfg [2021-06-11 16:15:10,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 16:15:10,331 INFO L168 Benchmark]: Toolchain (without parser) took 20735.15 ms. Allocated memory was 369.1 MB in the beginning and 861.9 MB in the end (delta: 492.8 MB). Free memory was 332.0 MB in the beginning and 823.3 MB in the end (delta: -491.3 MB). Peak memory consumption was 410.3 MB. Max. memory is 16.0 GB. [2021-06-11 16:15:10,331 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 369.1 MB. Free memory was 350.5 MB in the beginning and 350.4 MB in the end (delta: 76.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 16:15:10,331 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.10 ms. Allocated memory is still 369.1 MB. Free memory was 331.8 MB in the beginning and 328.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. [2021-06-11 16:15:10,332 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.49 ms. Allocated memory is still 369.1 MB. Free memory was 328.0 MB in the beginning and 324.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:15:10,332 INFO L168 Benchmark]: Boogie Preprocessor took 20.48 ms. Allocated memory is still 369.1 MB. Free memory was 324.9 MB in the beginning and 322.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:15:10,332 INFO L168 Benchmark]: RCFGBuilder took 1346.49 ms. Allocated memory is still 369.1 MB. Free memory was 322.8 MB in the beginning and 290.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 174.6 MB. Max. memory is 16.0 GB. [2021-06-11 16:15:10,332 INFO L168 Benchmark]: TraceAbstraction took 18918.15 ms. Allocated memory was 369.1 MB in the beginning and 861.9 MB in the end (delta: 492.8 MB). Free memory was 290.8 MB in the beginning and 823.3 MB in the end (delta: -532.5 MB). Peak memory consumption was 367.1 MB. Max. memory is 16.0 GB. [2021-06-11 16:15:10,332 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 369.1 MB. Free memory was 350.5 MB in the beginning and 350.4 MB in the end (delta: 76.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 407.10 ms. Allocated memory is still 369.1 MB. Free memory was 331.8 MB in the beginning and 328.0 MB in the end (delta: 3.9 MB). Peak memory consumption was 7.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 38.49 ms. Allocated memory is still 369.1 MB. Free memory was 328.0 MB in the beginning and 324.9 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 20.48 ms. Allocated memory is still 369.1 MB. Free memory was 324.9 MB in the beginning and 322.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1346.49 ms. Allocated memory is still 369.1 MB. Free memory was 322.8 MB in the beginning and 290.8 MB in the end (delta: 32.0 MB). Peak memory consumption was 174.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18918.15 ms. Allocated memory was 369.1 MB in the beginning and 861.9 MB in the end (delta: 492.8 MB). Free memory was 290.8 MB in the beginning and 823.3 MB in the end (delta: -532.5 MB). Peak memory consumption was 367.1 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14744.9ms, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 28 TransitionsAfterwards, 1602 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 86 TotalNumberOfCompositions, 4098 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2109, positive: 1977, positive conditional: 1977, positive unconditional: 0, negative: 132, negative conditional: 132, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2109, positive: 1977, positive conditional: 0, positive unconditional: 1977, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2109, positive: 1977, positive conditional: 0, positive unconditional: 1977, negative: 132, negative conditional: 0, negative unconditional: 132, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1382, positive: 1333, positive conditional: 0, positive unconditional: 1333, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1382, positive: 1302, positive conditional: 0, positive unconditional: 1302, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 80, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 586, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 516, negative conditional: 0, negative unconditional: 516, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2109, positive: 644, positive conditional: 0, positive unconditional: 644, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 1382, unknown conditional: 0, unknown unconditional: 1382] , Statistics on independence cache: Total cache size (in pairs): 1382, Positive cache size: 1333, Positive conditional cache size: 0, Positive unconditional cache size: 1333, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.2ms, 33 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 226 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 234 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 93, positive: 75, positive conditional: 75, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 93, positive: 75, positive conditional: 2, positive unconditional: 73, negative: 18, negative conditional: 4, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 93, positive: 75, positive conditional: 2, positive unconditional: 73, negative: 18, negative conditional: 4, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17, positive: 10, positive conditional: 2, positive unconditional: 8, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 4, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 110, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 110, negative conditional: 53, negative unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 93, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 17, unknown conditional: 6, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1399, Positive cache size: 1343, Positive conditional cache size: 2, Positive unconditional cache size: 1341, Negative cache size: 56, Negative conditional cache size: 4, Negative unconditional cache size: 52, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 184.5ms, 32 PlacesBefore, 30 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 188 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 209 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 17, negative conditional: 17, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 7, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 176, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 176, negative conditional: 0, negative unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 1413, Positive cache size: 1350, Positive conditional cache size: 2, Positive unconditional cache size: 1348, Negative cache size: 63, Negative conditional cache size: 4, Negative unconditional cache size: 59, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.6ms, 31 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 169 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 13, negative conditional: 13, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 87, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1419, Positive cache size: 1354, Positive conditional cache size: 2, Positive unconditional cache size: 1352, Negative cache size: 65, Negative conditional cache size: 4, Negative unconditional cache size: 61, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.3ms, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 19, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 19, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 41, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 19, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1422, Positive cache size: 1354, Positive conditional cache size: 2, Positive unconditional cache size: 1352, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 1 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 10.7ms, 39 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 74 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 13, positive conditional: 0, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1422, Positive cache size: 1354, Positive conditional cache size: 2, Positive unconditional cache size: 1352, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.8ms, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1422, Positive cache size: 1354, Positive conditional cache size: 2, Positive unconditional cache size: 1352, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.7ms, 47 PlacesBefore, 46 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 240 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 44 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1422, Positive cache size: 1354, Positive conditional cache size: 2, Positive unconditional cache size: 1352, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.8ms, 49 PlacesBefore, 49 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1423, Positive cache size: 1355, Positive conditional cache size: 2, Positive unconditional cache size: 1353, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.1ms, 50 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 27, positive: 24, positive conditional: 12, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 24, positive conditional: 12, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 4, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 18, positive conditional: 8, positive unconditional: 10, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 6, unknown conditional: 4, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1429, Positive cache size: 1361, Positive conditional cache size: 6, Positive unconditional cache size: 1355, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.2ms, 53 PlacesBefore, 53 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 272 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 87 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 21, positive: 18, positive conditional: 9, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 21, positive: 18, positive conditional: 9, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 21, positive: 17, positive conditional: 9, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1430, Positive cache size: 1362, Positive conditional cache size: 6, Positive unconditional cache size: 1356, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.4ms, 56 PlacesBefore, 56 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 292 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 36, positive: 33, positive conditional: 33, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 36, positive: 33, positive conditional: 21, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 36, positive: 33, positive conditional: 21, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 1, 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: 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: 36, positive: 31, positive conditional: 20, positive unconditional: 11, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 2, unknown conditional: 1, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1432, Positive cache size: 1364, Positive conditional cache size: 7, Positive unconditional cache size: 1357, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 6 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.3ms, 60 PlacesBefore, 59 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 400 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1432, Positive cache size: 1364, Positive conditional cache size: 7, Positive unconditional cache size: 1357, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 33.3ms, 66 PlacesBefore, 66 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 436 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1432, Positive cache size: 1364, Positive conditional cache size: 7, Positive unconditional cache size: 1357, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.9ms, 73 PlacesBefore, 70 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 258 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1432, Positive cache size: 1364, Positive conditional cache size: 7, Positive unconditional cache size: 1357, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 115.8ms, 65 PlacesBefore, 62 PlacesAfterwards, 46 TransitionsBefore, 45 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 5 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 4, positive conditional: 4, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1433, Positive cache size: 1365, Positive conditional cache size: 8, Positive unconditional cache size: 1357, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.8ms, 62 PlacesBefore, 62 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1433, Positive cache size: 1365, Positive conditional cache size: 8, Positive unconditional cache size: 1357, Negative cache size: 68, Negative conditional cache size: 4, Negative unconditional cache size: 64, Eliminated conditions: 0 - 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; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2186; [L814] FCALL, FORK 0 pthread_create(&t2186, ((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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2187; [L816] FCALL, FORK 0 pthread_create(&t2187, ((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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L817] 0 pthread_t t2188; [L818] FCALL, FORK 0 pthread_create(&t2188, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$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=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18767.0ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1471.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 14807.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 69 SDtfs, 25 SDslu, 28 SDs, 0 SdLazy, 410 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 400.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 670.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=477occurred in iteration=13, InterpolantAutomatonStates: 78, 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: 37.7ms SsaConstructionTime, 318.1ms SatisfiabilityAnalysisTime, 1056.8ms InterpolantComputationTime, 227 NumberOfCodeBlocks, 227 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 192 ConstructedInterpolants, 0 QuantifiedInterpolants, 2028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...