/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:15:33,958 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:15:33,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:15:33,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:15:33,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:15:33,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:15:33,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:15:33,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:15:33,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:15:34,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:15:34,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:15:34,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:15:34,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:15:34,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:15:34,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:15:34,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:15:34,010 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:15:34,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:15:34,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:15:34,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:15:34,019 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:15:34,020 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:15:34,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:15:34,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:15:34,026 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:15:34,026 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:15:34,026 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:15:34,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:15:34,028 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:15:34,028 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:15:34,028 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:15:34,029 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:15:34,030 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:15:34,030 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:15:34,031 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:15:34,031 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:15:34,031 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:15:34,032 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:15:34,032 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:15:34,032 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:15:34,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:15:34,035 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-03-26 10:15:34,063 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:15:34,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:15:34,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:15:34,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:15:34,066 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:15:34,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:15:34,066 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:15:34,066 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:15:34,066 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:15:34,066 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:15:34,067 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:15:34,067 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:15:34,067 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:15:34,067 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:15:34,067 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:15:34,068 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:15:34,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:15:34,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:15:34,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:15:34,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:15:34,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:15:34,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:15:34,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:15:34,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:15:34,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:15:34,069 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:15:34,069 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:15:34,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:15:34,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:15:34,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:15:34,069 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:15:34,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:15:34,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:15:34,344 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:15:34,345 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:15:34,345 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:15:34,346 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2021-03-26 10:15:34,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c2d3aadf/083a59eac4f645de8c3c25f239f64fe8/FLAG0bcbdad2c [2021-03-26 10:15:34,824 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:15:34,825 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i [2021-03-26 10:15:34,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c2d3aadf/083a59eac4f645de8c3c25f239f64fe8/FLAG0bcbdad2c [2021-03-26 10:15:34,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c2d3aadf/083a59eac4f645de8c3c25f239f64fe8 [2021-03-26 10:15:34,845 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:15:34,846 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:15:34,847 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:15:34,847 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:15:34,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:15:34,850 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:15:34" (1/1) ... [2021-03-26 10:15:34,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46265896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:34, skipping insertion in model container [2021-03-26 10:15:34,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:15:34" (1/1) ... [2021-03-26 10:15:34,857 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:15:34,881 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:15:35,030 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i[948,961] [2021-03-26 10:15:35,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:15:35,201 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:15:35,211 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_tso.opt.i[948,961] [2021-03-26 10:15:35,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:15:35,289 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:15:35,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35 WrapperNode [2021-03-26 10:15:35,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:15:35,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:15:35,290 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:15:35,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:15:35,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,330 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:15:35,331 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:15:35,331 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:15:35,331 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:15:35,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... [2021-03-26 10:15:35,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:15:35,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:15:35,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:15:35,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:15:35,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:15:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:15:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:15:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:15:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:15:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:15:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:15:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:15:35,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:15:35,403 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:15:36,641 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:15:36,641 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:15:36,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:15:36 BoogieIcfgContainer [2021-03-26 10:15:36,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:15:36,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:15:36,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:15:36,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:15:36,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:15:34" (1/3) ... [2021-03-26 10:15:36,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@928f4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:15:36, skipping insertion in model container [2021-03-26 10:15:36,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:15:35" (2/3) ... [2021-03-26 10:15:36,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@928f4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:15:36, skipping insertion in model container [2021-03-26 10:15:36,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:15:36" (3/3) ... [2021-03-26 10:15:36,646 INFO L111 eAbstractionObserver]: Analyzing ICFG mix057_tso.opt.i [2021-03-26 10:15:36,650 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:15:36,653 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:15:36,653 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,675 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,676 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,679 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,679 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,680 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,681 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,682 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,684 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,684 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,685 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,685 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,686 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,686 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,687 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,688 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,691 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,691 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,691 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,695 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,696 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,696 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:15:36,697 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:15:36,709 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-26 10:15:36,727 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:15:36,727 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:15:36,727 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:15:36,727 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:15:36,727 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:15:36,727 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:15:36,727 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:15:36,727 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:15:36,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 10:15:36,775 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 10:15:36,775 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:36,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 10:15:36,778 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 112 transitions, 244 flow [2021-03-26 10:15:36,781 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 108 transitions, 228 flow [2021-03-26 10:15:36,782 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:36,789 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 10:15:36,791 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 108 transitions, 228 flow [2021-03-26 10:15:36,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 228 flow [2021-03-26 10:15:36,805 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2021-03-26 10:15:36,805 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:36,806 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2021-03-26 10:15:36,808 INFO L142 LiptonReduction]: Number of co-enabled transitions 2406 [2021-03-26 10:15:37,858 WARN L205 SmtUtils]: Spent 706.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:15:38,157 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-26 10:15:39,428 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:15:39,961 WARN L205 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:15:40,848 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:15:41,203 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:15:41,336 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:15:42,569 WARN L205 SmtUtils]: Spent 275.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:15:42,832 WARN L205 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:15:43,405 WARN L205 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:15:43,987 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:15:44,363 INFO L154 LiptonReduction]: Checked pairs total: 4010 [2021-03-26 10:15:44,363 INFO L156 LiptonReduction]: Total number of compositions: 75 [2021-03-26 10:15:44,364 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7583 [2021-03-26 10:15:44,372 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-26 10:15:44,372 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:44,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:44,373 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:44,373 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1880455195, now seen corresponding path program 1 times [2021-03-26 10:15:44,380 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:44,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816485124] [2021-03-26 10:15:44,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:44,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:44,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:44,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:44,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:44,576 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816485124] [2021-03-26 10:15:44,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:44,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:44,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391366401] [2021-03-26 10:15:44,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:44,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:44,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:44,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:44,591 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2021-03-26 10:15:44,592 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:44,592 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:44,593 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2021-03-26 10:15:44,593 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:44,646 INFO L129 PetriNetUnfolder]: 23/98 cut-off events. [2021-03-26 10:15:44,646 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:44,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 98 events. 23/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 340 event pairs, 3 based on Foata normal form. 6/97 useless extension candidates. Maximal degree in co-relation 140. Up to 37 conditions per place. [2021-03-26 10:15:44,648 INFO L132 encePairwiseOnDemand]: 183/187 looper letters, 7 selfloop transitions, 2 changer transitions 5/43 dead transitions. [2021-03-26 10:15:44,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 43 transitions, 120 flow [2021-03-26 10:15:44,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:44,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2021-03-26 10:15:44,664 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2021-03-26 10:15:44,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 506 transitions. [2021-03-26 10:15:44,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 506 transitions. [2021-03-26 10:15:44,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:44,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 506 transitions. [2021-03-26 10:15:44,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:44,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:44,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:44,680 INFO L185 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 3 states and 506 transitions. [2021-03-26 10:15:44,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 43 transitions, 120 flow [2021-03-26 10:15:44,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 43 transitions, 116 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:44,683 INFO L241 Difference]: Finished difference. Result has 50 places, 35 transitions, 82 flow [2021-03-26 10:15:44,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2021-03-26 10:15:44,685 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -4 predicate places. [2021-03-26 10:15:44,685 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:44,685 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 35 transitions, 82 flow [2021-03-26 10:15:44,686 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 35 transitions, 82 flow [2021-03-26 10:15:44,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 35 transitions, 82 flow [2021-03-26 10:15:44,690 INFO L129 PetriNetUnfolder]: 0/35 cut-off events. [2021-03-26 10:15:44,690 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:44,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 35 events. 0/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:15:44,691 INFO L142 LiptonReduction]: Number of co-enabled transitions 362 [2021-03-26 10:15:44,985 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:15:45,108 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-26 10:15:45,768 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:15:46,055 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-26 10:15:46,619 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:15:47,168 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:15:47,759 INFO L154 LiptonReduction]: Checked pairs total: 1154 [2021-03-26 10:15:47,759 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 10:15:47,759 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3074 [2021-03-26 10:15:47,760 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 66 flow [2021-03-26 10:15:47,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:47,761 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:47,761 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:47,761 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:15:47,761 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:47,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:47,761 INFO L82 PathProgramCache]: Analyzing trace with hash 157805214, now seen corresponding path program 1 times [2021-03-26 10:15:47,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:47,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223548564] [2021-03-26 10:15:47,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:47,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:47,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:47,869 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:15:47,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:15:47,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:47,872 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223548564] [2021-03-26 10:15:47,872 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:47,872 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:47,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598921641] [2021-03-26 10:15:47,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:47,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:47,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:47,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:47,875 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 195 [2021-03-26 10:15:47,875 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:47,875 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:47,875 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 195 [2021-03-26 10:15:47,875 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:47,888 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-26 10:15:47,888 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:47,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/36 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-26 10:15:47,889 INFO L132 encePairwiseOnDemand]: 191/195 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 10:15:47,889 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 82 flow [2021-03-26 10:15:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:47,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2021-03-26 10:15:47,891 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8683760683760684 [2021-03-26 10:15:47,891 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2021-03-26 10:15:47,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2021-03-26 10:15:47,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:47,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2021-03-26 10:15:47,893 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:47,894 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:47,894 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:47,895 INFO L185 Difference]: Start difference. First operand has 38 places, 27 transitions, 66 flow. Second operand 3 states and 508 transitions. [2021-03-26 10:15:47,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 82 flow [2021-03-26 10:15:47,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:15:47,895 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 81 flow [2021-03-26 10:15:47,896 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 10:15:47,896 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2021-03-26 10:15:47,896 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:47,896 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 10:15:47,896 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 81 flow [2021-03-26 10:15:47,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 81 flow [2021-03-26 10:15:47,900 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 10:15:47,900 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:15:47,900 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 35 events. 3/35 cut-off events. For 0/0 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/33 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-03-26 10:15:47,901 INFO L142 LiptonReduction]: Number of co-enabled transitions 356 [2021-03-26 10:15:48,325 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 10:15:48,485 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:15:48,768 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-26 10:15:48,895 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-26 10:15:48,898 INFO L154 LiptonReduction]: Checked pairs total: 996 [2021-03-26 10:15:48,898 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:15:48,898 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1002 [2021-03-26 10:15:48,899 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2021-03-26 10:15:48,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:48,900 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:48,900 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:48,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:15:48,900 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:48,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:48,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1377057789, now seen corresponding path program 1 times [2021-03-26 10:15:48,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:48,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541393482] [2021-03-26 10:15:48,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:48,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:48,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:48,951 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541393482] [2021-03-26 10:15:48,951 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:48,951 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:15:48,951 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357143172] [2021-03-26 10:15:48,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:48,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:48,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:48,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-26 10:15:48,953 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:48,953 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:48,953 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-26 10:15:48,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:48,968 INFO L129 PetriNetUnfolder]: 10/58 cut-off events. [2021-03-26 10:15:48,968 INFO L130 PetriNetUnfolder]: For 10/16 co-relation queries the response was YES. [2021-03-26 10:15:48,968 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 58 events. 10/58 cut-off events. For 10/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 174 event pairs, 3 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 96. Up to 19 conditions per place. [2021-03-26 10:15:48,968 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 10:15:48,968 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 29 transitions, 93 flow [2021-03-26 10:15:48,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:48,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:48,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2021-03-26 10:15:48,970 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8849407783417935 [2021-03-26 10:15:48,970 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 523 transitions. [2021-03-26 10:15:48,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 523 transitions. [2021-03-26 10:15:48,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:48,971 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 523 transitions. [2021-03-26 10:15:48,972 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:48,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:48,973 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:48,973 INFO L185 Difference]: Start difference. First operand has 37 places, 27 transitions, 77 flow. Second operand 3 states and 523 transitions. [2021-03-26 10:15:48,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 29 transitions, 93 flow [2021-03-26 10:15:48,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 29 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:48,974 INFO L241 Difference]: Finished difference. Result has 39 places, 29 transitions, 93 flow [2021-03-26 10:15:48,974 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2021-03-26 10:15:48,974 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -15 predicate places. [2021-03-26 10:15:48,974 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:48,974 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 29 transitions, 93 flow [2021-03-26 10:15:48,975 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 29 transitions, 93 flow [2021-03-26 10:15:48,975 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 29 transitions, 93 flow [2021-03-26 10:15:48,984 INFO L129 PetriNetUnfolder]: 7/45 cut-off events. [2021-03-26 10:15:48,984 INFO L130 PetriNetUnfolder]: For 7/9 co-relation queries the response was YES. [2021-03-26 10:15:48,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 45 events. 7/45 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 123 event pairs, 3 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 78. Up to 15 conditions per place. [2021-03-26 10:15:48,986 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 10:15:48,999 INFO L154 LiptonReduction]: Checked pairs total: 280 [2021-03-26 10:15:48,999 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:48,999 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-26 10:15:49,002 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 93 flow [2021-03-26 10:15:49,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:49,003 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:49,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:15:49,003 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:49,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:49,004 INFO L82 PathProgramCache]: Analyzing trace with hash 370417324, now seen corresponding path program 1 times [2021-03-26 10:15:49,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:49,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215416123] [2021-03-26 10:15:49,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:49,056 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:49,059 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:49,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:49,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215416123] [2021-03-26 10:15:49,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:49,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:49,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529645100] [2021-03-26 10:15:49,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:49,062 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:49,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:49,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:49,062 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-26 10:15:49,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:49,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-26 10:15:49,063 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:49,078 INFO L129 PetriNetUnfolder]: 4/52 cut-off events. [2021-03-26 10:15:49,078 INFO L130 PetriNetUnfolder]: For 26/61 co-relation queries the response was YES. [2021-03-26 10:15:49,079 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 52 events. 4/52 cut-off events. For 26/61 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 179 event pairs, 1 based on Foata normal form. 4/52 useless extension candidates. Maximal degree in co-relation 99. Up to 15 conditions per place. [2021-03-26 10:15:49,080 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 3 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2021-03-26 10:15:49,080 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 105 flow [2021-03-26 10:15:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2021-03-26 10:15:49,082 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2021-03-26 10:15:49,082 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2021-03-26 10:15:49,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2021-03-26 10:15:49,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:49,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2021-03-26 10:15:49,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,085 INFO L185 Difference]: Start difference. First operand has 39 places, 29 transitions, 93 flow. Second operand 3 states and 522 transitions. [2021-03-26 10:15:49,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 105 flow [2021-03-26 10:15:49,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:49,086 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 101 flow [2021-03-26 10:15:49,086 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-26 10:15:49,086 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -13 predicate places. [2021-03-26 10:15:49,086 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:49,087 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 101 flow [2021-03-26 10:15:49,087 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 101 flow [2021-03-26 10:15:49,087 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 101 flow [2021-03-26 10:15:49,094 INFO L129 PetriNetUnfolder]: 4/45 cut-off events. [2021-03-26 10:15:49,094 INFO L130 PetriNetUnfolder]: For 27/43 co-relation queries the response was YES. [2021-03-26 10:15:49,096 INFO L84 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 45 events. 4/45 cut-off events. For 27/43 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 127 event pairs, 2 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 81. Up to 13 conditions per place. [2021-03-26 10:15:49,097 INFO L142 LiptonReduction]: Number of co-enabled transitions 394 [2021-03-26 10:15:49,099 INFO L154 LiptonReduction]: Checked pairs total: 316 [2021-03-26 10:15:49,099 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:49,099 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-26 10:15:49,103 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 101 flow [2021-03-26 10:15:49,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,104 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:49,104 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:49,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:15:49,104 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:49,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:49,104 INFO L82 PathProgramCache]: Analyzing trace with hash -921273539, now seen corresponding path program 1 times [2021-03-26 10:15:49,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:49,104 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523536221] [2021-03-26 10:15:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:49,170 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:15:49,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,181 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:49,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:49,183 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523536221] [2021-03-26 10:15:49,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:49,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:15:49,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138221698] [2021-03-26 10:15:49,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:49,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:49,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:49,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:49,184 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 197 [2021-03-26 10:15:49,185 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,185 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:49,185 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 197 [2021-03-26 10:15:49,185 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:49,247 INFO L129 PetriNetUnfolder]: 109/279 cut-off events. [2021-03-26 10:15:49,247 INFO L130 PetriNetUnfolder]: For 318/442 co-relation queries the response was YES. [2021-03-26 10:15:49,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 656 conditions, 279 events. 109/279 cut-off events. For 318/442 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1557 event pairs, 68 based on Foata normal form. 3/246 useless extension candidates. Maximal degree in co-relation 643. Up to 165 conditions per place. [2021-03-26 10:15:49,249 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 7 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2021-03-26 10:15:49,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 32 transitions, 127 flow [2021-03-26 10:15:49,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:49,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2021-03-26 10:15:49,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8206429780033841 [2021-03-26 10:15:49,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2021-03-26 10:15:49,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2021-03-26 10:15:49,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:49,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2021-03-26 10:15:49,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,253 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,253 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 101 flow. Second operand 3 states and 485 transitions. [2021-03-26 10:15:49,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 32 transitions, 127 flow [2021-03-26 10:15:49,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 122 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:49,254 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 115 flow [2021-03-26 10:15:49,255 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 10:15:49,255 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2021-03-26 10:15:49,255 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:49,255 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 115 flow [2021-03-26 10:15:49,255 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 115 flow [2021-03-26 10:15:49,255 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 31 transitions, 115 flow [2021-03-26 10:15:49,263 INFO L129 PetriNetUnfolder]: 15/89 cut-off events. [2021-03-26 10:15:49,263 INFO L130 PetriNetUnfolder]: For 102/132 co-relation queries the response was YES. [2021-03-26 10:15:49,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 89 events. 15/89 cut-off events. For 102/132 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 396 event pairs, 7 based on Foata normal form. 0/76 useless extension candidates. Maximal degree in co-relation 191. Up to 29 conditions per place. [2021-03-26 10:15:49,264 INFO L142 LiptonReduction]: Number of co-enabled transitions 428 [2021-03-26 10:15:49,292 INFO L154 LiptonReduction]: Checked pairs total: 260 [2021-03-26 10:15:49,293 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:49,293 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 38 [2021-03-26 10:15:49,294 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 115 flow [2021-03-26 10:15:49,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,295 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:49,295 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:49,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:15:49,295 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:49,295 INFO L82 PathProgramCache]: Analyzing trace with hash -583256081, now seen corresponding path program 1 times [2021-03-26 10:15:49,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:49,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608915882] [2021-03-26 10:15:49,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:49,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:49,364 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:49,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,373 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:15:49,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:15:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:49,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608915882] [2021-03-26 10:15:49,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:49,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:49,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468904278] [2021-03-26 10:15:49,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:49,392 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:49,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:49,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:49,393 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 197 [2021-03-26 10:15:49,394 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 115 flow. Second operand has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,394 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:49,394 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 197 [2021-03-26 10:15:49,394 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:49,473 INFO L129 PetriNetUnfolder]: 75/226 cut-off events. [2021-03-26 10:15:49,473 INFO L130 PetriNetUnfolder]: For 600/702 co-relation queries the response was YES. [2021-03-26 10:15:49,473 INFO L84 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 226 events. 75/226 cut-off events. For 600/702 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1244 event pairs, 11 based on Foata normal form. 20/226 useless extension candidates. Maximal degree in co-relation 532. Up to 81 conditions per place. [2021-03-26 10:15:49,474 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 9 selfloop transitions, 9 changer transitions 0/40 dead transitions. [2021-03-26 10:15:49,474 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 173 flow [2021-03-26 10:15:49,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:49,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 800 transitions. [2021-03-26 10:15:49,476 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8121827411167513 [2021-03-26 10:15:49,476 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 800 transitions. [2021-03-26 10:15:49,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 800 transitions. [2021-03-26 10:15:49,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:49,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 800 transitions. [2021-03-26 10:15:49,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,480 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,480 INFO L185 Difference]: Start difference. First operand has 43 places, 31 transitions, 115 flow. Second operand 5 states and 800 transitions. [2021-03-26 10:15:49,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 173 flow [2021-03-26 10:15:49,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:49,484 INFO L241 Difference]: Finished difference. Result has 49 places, 36 transitions, 171 flow [2021-03-26 10:15:49,484 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=171, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2021-03-26 10:15:49,484 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2021-03-26 10:15:49,484 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:49,484 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 171 flow [2021-03-26 10:15:49,484 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 171 flow [2021-03-26 10:15:49,485 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 171 flow [2021-03-26 10:15:49,498 INFO L129 PetriNetUnfolder]: 40/156 cut-off events. [2021-03-26 10:15:49,498 INFO L130 PetriNetUnfolder]: For 624/666 co-relation queries the response was YES. [2021-03-26 10:15:49,499 INFO L84 FinitePrefix]: Finished finitePrefix Result has 465 conditions, 156 events. 40/156 cut-off events. For 624/666 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 807 event pairs, 15 based on Foata normal form. 2/143 useless extension candidates. Maximal degree in co-relation 448. Up to 50 conditions per place. [2021-03-26 10:15:49,500 INFO L142 LiptonReduction]: Number of co-enabled transitions 510 [2021-03-26 10:15:49,503 INFO L154 LiptonReduction]: Checked pairs total: 214 [2021-03-26 10:15:49,504 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:49,504 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-26 10:15:49,507 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 171 flow [2021-03-26 10:15:49,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 156.8) internal successors, (784), 5 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,507 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:49,507 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:49,507 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:15:49,507 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:49,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:49,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1783911245, now seen corresponding path program 1 times [2021-03-26 10:15:49,508 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:49,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961712114] [2021-03-26 10:15:49,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:49,585 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:49,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,590 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:49,590 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,591 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:49,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 10:15:49,614 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,615 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-26 10:15:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:49,627 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961712114] [2021-03-26 10:15:49,627 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:49,627 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:49,627 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066786502] [2021-03-26 10:15:49,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:49,628 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:49,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:49,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:49,629 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 197 [2021-03-26 10:15:49,629 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 171 flow. Second operand has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,629 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:49,629 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 197 [2021-03-26 10:15:49,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:49,727 INFO L129 PetriNetUnfolder]: 98/283 cut-off events. [2021-03-26 10:15:49,727 INFO L130 PetriNetUnfolder]: For 949/1013 co-relation queries the response was YES. [2021-03-26 10:15:49,728 INFO L84 FinitePrefix]: Finished finitePrefix Result has 975 conditions, 283 events. 98/283 cut-off events. For 949/1013 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1644 event pairs, 18 based on Foata normal form. 6/267 useless extension candidates. Maximal degree in co-relation 956. Up to 141 conditions per place. [2021-03-26 10:15:49,729 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 10 selfloop transitions, 13 changer transitions 0/45 dead transitions. [2021-03-26 10:15:49,730 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 271 flow [2021-03-26 10:15:49,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:49,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 796 transitions. [2021-03-26 10:15:49,732 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8081218274111676 [2021-03-26 10:15:49,732 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 796 transitions. [2021-03-26 10:15:49,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 796 transitions. [2021-03-26 10:15:49,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:49,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 796 transitions. [2021-03-26 10:15:49,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.2) internal successors, (796), 5 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,735 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,735 INFO L185 Difference]: Start difference. First operand has 49 places, 36 transitions, 171 flow. Second operand 5 states and 796 transitions. [2021-03-26 10:15:49,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 271 flow [2021-03-26 10:15:49,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 262 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:49,738 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 261 flow [2021-03-26 10:15:49,738 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-26 10:15:49,739 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2021-03-26 10:15:49,739 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:49,739 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 261 flow [2021-03-26 10:15:49,739 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 261 flow [2021-03-26 10:15:49,739 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 261 flow [2021-03-26 10:15:49,763 INFO L129 PetriNetUnfolder]: 65/202 cut-off events. [2021-03-26 10:15:49,763 INFO L130 PetriNetUnfolder]: For 1108/1160 co-relation queries the response was YES. [2021-03-26 10:15:49,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 753 conditions, 202 events. 65/202 cut-off events. For 1108/1160 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1064 event pairs, 16 based on Foata normal form. 3/182 useless extension candidates. Maximal degree in co-relation 733. Up to 79 conditions per place. [2021-03-26 10:15:49,765 INFO L142 LiptonReduction]: Number of co-enabled transitions 632 [2021-03-26 10:15:49,773 INFO L154 LiptonReduction]: Checked pairs total: 313 [2021-03-26 10:15:49,773 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:49,774 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-26 10:15:49,774 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 261 flow [2021-03-26 10:15:49,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 157.0) internal successors, (942), 6 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,775 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:49,775 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:49,775 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:15:49,775 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:49,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:49,775 INFO L82 PathProgramCache]: Analyzing trace with hash -660944230, now seen corresponding path program 1 times [2021-03-26 10:15:49,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:49,776 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836799387] [2021-03-26 10:15:49,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:49,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:49,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:49,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:49,827 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836799387] [2021-03-26 10:15:49,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:49,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:15:49,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258698156] [2021-03-26 10:15:49,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:15:49,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:49,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:15:49,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:15:49,828 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 197 [2021-03-26 10:15:49,829 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 261 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:49,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 197 [2021-03-26 10:15:49,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:49,870 INFO L129 PetriNetUnfolder]: 73/268 cut-off events. [2021-03-26 10:15:49,870 INFO L130 PetriNetUnfolder]: For 2207/2508 co-relation queries the response was YES. [2021-03-26 10:15:49,871 INFO L84 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 268 events. 73/268 cut-off events. For 2207/2508 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1692 event pairs, 9 based on Foata normal form. 13/263 useless extension candidates. Maximal degree in co-relation 922. Up to 99 conditions per place. [2021-03-26 10:15:49,872 INFO L132 encePairwiseOnDemand]: 194/197 looper letters, 4 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2021-03-26 10:15:49,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 43 transitions, 275 flow [2021-03-26 10:15:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:15:49,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:15:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2021-03-26 10:15:49,874 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883248730964467 [2021-03-26 10:15:49,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 522 transitions. [2021-03-26 10:15:49,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions. [2021-03-26 10:15:49,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:49,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions. [2021-03-26 10:15:49,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,876 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,876 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 261 flow. Second operand 3 states and 522 transitions. [2021-03-26 10:15:49,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 43 transitions, 275 flow [2021-03-26 10:15:49,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 43 transitions, 264 flow, removed 5 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:49,880 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 263 flow [2021-03-26 10:15:49,881 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=263, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2021-03-26 10:15:49,881 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2021-03-26 10:15:49,881 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:49,881 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 263 flow [2021-03-26 10:15:49,881 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 263 flow [2021-03-26 10:15:49,881 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 263 flow [2021-03-26 10:15:49,910 INFO L129 PetriNetUnfolder]: 73/265 cut-off events. [2021-03-26 10:15:49,910 INFO L130 PetriNetUnfolder]: For 1620/1758 co-relation queries the response was YES. [2021-03-26 10:15:49,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 265 events. 73/265 cut-off events. For 1620/1758 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1647 event pairs, 12 based on Foata normal form. 4/250 useless extension candidates. Maximal degree in co-relation 869. Up to 99 conditions per place. [2021-03-26 10:15:49,913 INFO L142 LiptonReduction]: Number of co-enabled transitions 632 [2021-03-26 10:15:49,926 INFO L154 LiptonReduction]: Checked pairs total: 421 [2021-03-26 10:15:49,926 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:49,926 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 45 [2021-03-26 10:15:49,927 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 263 flow [2021-03-26 10:15:49,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:49,927 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:49,927 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:49,928 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:15:49,928 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:49,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1842192471, now seen corresponding path program 1 times [2021-03-26 10:15:49,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:49,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333024369] [2021-03-26 10:15:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:49,967 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:49,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:49,968 INFO L142 QuantifierPusher]: treesize reduction 9, result has 57.1 percent of original size [2021-03-26 10:15:49,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 10:15:49,976 INFO L142 QuantifierPusher]: treesize reduction 26, result has 51.9 percent of original size [2021-03-26 10:15:49,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:15:49,989 INFO L142 QuantifierPusher]: treesize reduction 26, result has 54.4 percent of original size [2021-03-26 10:15:49,990 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-03-26 10:15:50,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:50,003 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333024369] [2021-03-26 10:15:50,003 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:50,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:50,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9677620] [2021-03-26 10:15:50,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:50,004 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:50,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:50,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:50,004 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 197 [2021-03-26 10:15:50,005 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:50,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 197 [2021-03-26 10:15:50,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:50,088 INFO L129 PetriNetUnfolder]: 103/378 cut-off events. [2021-03-26 10:15:50,089 INFO L130 PetriNetUnfolder]: For 2625/2832 co-relation queries the response was YES. [2021-03-26 10:15:50,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1507 conditions, 378 events. 103/378 cut-off events. For 2625/2832 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2605 event pairs, 10 based on Foata normal form. 11/363 useless extension candidates. Maximal degree in co-relation 1484. Up to 151 conditions per place. [2021-03-26 10:15:50,091 INFO L132 encePairwiseOnDemand]: 190/197 looper letters, 17 selfloop transitions, 17 changer transitions 0/56 dead transitions. [2021-03-26 10:15:50,091 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 56 transitions, 428 flow [2021-03-26 10:15:50,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:50,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 799 transitions. [2021-03-26 10:15:50,093 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8111675126903554 [2021-03-26 10:15:50,093 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 799 transitions. [2021-03-26 10:15:50,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 799 transitions. [2021-03-26 10:15:50,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:50,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 799 transitions. [2021-03-26 10:15:50,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.8) internal successors, (799), 5 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,096 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,096 INFO L185 Difference]: Start difference. First operand has 56 places, 43 transitions, 263 flow. Second operand 5 states and 799 transitions. [2021-03-26 10:15:50,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 56 transitions, 428 flow [2021-03-26 10:15:50,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 423 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:50,100 INFO L241 Difference]: Finished difference. Result has 62 places, 52 transitions, 399 flow [2021-03-26 10:15:50,100 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2021-03-26 10:15:50,100 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 8 predicate places. [2021-03-26 10:15:50,100 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:50,100 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 62 places, 52 transitions, 399 flow [2021-03-26 10:15:50,100 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 62 places, 52 transitions, 399 flow [2021-03-26 10:15:50,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 62 places, 52 transitions, 399 flow [2021-03-26 10:15:50,134 INFO L129 PetriNetUnfolder]: 100/368 cut-off events. [2021-03-26 10:15:50,134 INFO L130 PetriNetUnfolder]: For 2407/2553 co-relation queries the response was YES. [2021-03-26 10:15:50,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 368 events. 100/368 cut-off events. For 2407/2553 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2590 event pairs, 12 based on Foata normal form. 4/346 useless extension candidates. Maximal degree in co-relation 1497. Up to 148 conditions per place. [2021-03-26 10:15:50,138 INFO L142 LiptonReduction]: Number of co-enabled transitions 796 [2021-03-26 10:15:50,297 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:15:50,633 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 10:15:50,756 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:15:50,806 INFO L154 LiptonReduction]: Checked pairs total: 1379 [2021-03-26 10:15:50,806 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:15:50,806 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 706 [2021-03-26 10:15:50,806 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 402 flow [2021-03-26 10:15:50,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,807 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:50,807 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:50,807 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:15:50,807 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:50,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:50,807 INFO L82 PathProgramCache]: Analyzing trace with hash -420530629, now seen corresponding path program 2 times [2021-03-26 10:15:50,807 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:50,807 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795991149] [2021-03-26 10:15:50,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:50,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:50,838 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:50,842 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:50,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:50,847 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:50,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:50,848 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:50,848 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:15:50,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:50,854 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795991149] [2021-03-26 10:15:50,854 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:50,854 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:50,854 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771249314] [2021-03-26 10:15:50,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:50,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:50,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:50,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:50,856 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 198 [2021-03-26 10:15:50,856 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 402 flow. Second operand has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,856 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:50,856 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 198 [2021-03-26 10:15:50,856 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:50,945 INFO L129 PetriNetUnfolder]: 99/374 cut-off events. [2021-03-26 10:15:50,945 INFO L130 PetriNetUnfolder]: For 2665/2850 co-relation queries the response was YES. [2021-03-26 10:15:50,946 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 374 events. 99/374 cut-off events. For 2665/2850 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2612 event pairs, 3 based on Foata normal form. 21/363 useless extension candidates. Maximal degree in co-relation 1719. Up to 178 conditions per place. [2021-03-26 10:15:50,948 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 14 selfloop transitions, 19 changer transitions 0/55 dead transitions. [2021-03-26 10:15:50,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 477 flow [2021-03-26 10:15:50,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:15:50,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:15:50,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 953 transitions. [2021-03-26 10:15:50,950 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8021885521885522 [2021-03-26 10:15:50,950 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 953 transitions. [2021-03-26 10:15:50,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 953 transitions. [2021-03-26 10:15:50,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:50,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 953 transitions. [2021-03-26 10:15:50,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.83333333333334) internal successors, (953), 6 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,953 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:50,954 INFO L185 Difference]: Start difference. First operand has 62 places, 52 transitions, 402 flow. Second operand 6 states and 953 transitions. [2021-03-26 10:15:50,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 477 flow [2021-03-26 10:15:50,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 456 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:50,957 INFO L241 Difference]: Finished difference. Result has 67 places, 53 transitions, 434 flow [2021-03-26 10:15:50,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=434, PETRI_PLACES=67, PETRI_TRANSITIONS=53} [2021-03-26 10:15:50,957 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 13 predicate places. [2021-03-26 10:15:50,957 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:50,958 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 67 places, 53 transitions, 434 flow [2021-03-26 10:15:50,958 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 67 places, 53 transitions, 434 flow [2021-03-26 10:15:50,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 53 transitions, 434 flow [2021-03-26 10:15:51,010 INFO L129 PetriNetUnfolder]: 96/368 cut-off events. [2021-03-26 10:15:51,010 INFO L130 PetriNetUnfolder]: For 2661/2794 co-relation queries the response was YES. [2021-03-26 10:15:51,011 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 368 events. 96/368 cut-off events. For 2661/2794 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2612 event pairs, 10 based on Foata normal form. 2/342 useless extension candidates. Maximal degree in co-relation 1578. Up to 144 conditions per place. [2021-03-26 10:15:51,014 INFO L142 LiptonReduction]: Number of co-enabled transitions 824 [2021-03-26 10:15:51,026 INFO L154 LiptonReduction]: Checked pairs total: 742 [2021-03-26 10:15:51,026 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:51,026 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 69 [2021-03-26 10:15:51,027 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 53 transitions, 434 flow [2021-03-26 10:15:51,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 157.2) internal successors, (786), 5 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,027 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:51,028 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:51,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:15:51,028 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:51,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1060065757, now seen corresponding path program 2 times [2021-03-26 10:15:51,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:51,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002085119] [2021-03-26 10:15:51,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:51,076 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:51,076 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:15:51,082 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:51,083 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:15:51,090 INFO L142 QuantifierPusher]: treesize reduction 4, result has 81.0 percent of original size [2021-03-26 10:15:51,090 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:15:51,100 INFO L142 QuantifierPusher]: treesize reduction 4, result has 83.3 percent of original size [2021-03-26 10:15:51,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 10:15:51,111 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:51,113 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:15:51,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:51,122 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002085119] [2021-03-26 10:15:51,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:51,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:15:51,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276794796] [2021-03-26 10:15:51,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:15:51,122 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:51,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:15:51,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:15:51,123 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 198 [2021-03-26 10:15:51,124 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 53 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,124 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:51,124 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 198 [2021-03-26 10:15:51,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:51,244 INFO L129 PetriNetUnfolder]: 95/358 cut-off events. [2021-03-26 10:15:51,244 INFO L130 PetriNetUnfolder]: For 2853/3014 co-relation queries the response was YES. [2021-03-26 10:15:51,245 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 358 events. 95/358 cut-off events. For 2853/3014 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2449 event pairs, 3 based on Foata normal form. 16/347 useless extension candidates. Maximal degree in co-relation 1746. Up to 143 conditions per place. [2021-03-26 10:15:51,247 INFO L132 encePairwiseOnDemand]: 192/198 looper letters, 21 selfloop transitions, 15 changer transitions 0/58 dead transitions. [2021-03-26 10:15:51,248 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 58 transitions, 550 flow [2021-03-26 10:15:51,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 762 transitions. [2021-03-26 10:15:51,250 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7696969696969697 [2021-03-26 10:15:51,250 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 762 transitions. [2021-03-26 10:15:51,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 762 transitions. [2021-03-26 10:15:51,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:51,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 762 transitions. [2021-03-26 10:15:51,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.4) internal successors, (762), 5 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,253 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,253 INFO L185 Difference]: Start difference. First operand has 67 places, 53 transitions, 434 flow. Second operand 5 states and 762 transitions. [2021-03-26 10:15:51,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 58 transitions, 550 flow [2021-03-26 10:15:51,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 58 transitions, 531 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 10:15:51,257 INFO L241 Difference]: Finished difference. Result has 69 places, 55 transitions, 485 flow [2021-03-26 10:15:51,257 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=485, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2021-03-26 10:15:51,258 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 15 predicate places. [2021-03-26 10:15:51,258 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:51,258 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 55 transitions, 485 flow [2021-03-26 10:15:51,258 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 55 transitions, 485 flow [2021-03-26 10:15:51,258 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 55 transitions, 485 flow [2021-03-26 10:15:51,292 INFO L129 PetriNetUnfolder]: 92/352 cut-off events. [2021-03-26 10:15:51,292 INFO L130 PetriNetUnfolder]: For 2756/2875 co-relation queries the response was YES. [2021-03-26 10:15:51,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1675 conditions, 352 events. 92/352 cut-off events. For 2756/2875 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2456 event pairs, 10 based on Foata normal form. 2/327 useless extension candidates. Maximal degree in co-relation 1647. Up to 140 conditions per place. [2021-03-26 10:15:51,297 INFO L142 LiptonReduction]: Number of co-enabled transitions 854 [2021-03-26 10:15:51,307 INFO L154 LiptonReduction]: Checked pairs total: 792 [2021-03-26 10:15:51,307 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:51,307 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 49 [2021-03-26 10:15:51,309 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 485 flow [2021-03-26 10:15:51,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 149.85714285714286) internal successors, (1049), 7 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,310 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:51,310 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:51,310 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:15:51,310 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:51,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:51,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1556185557, now seen corresponding path program 1 times [2021-03-26 10:15:51,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:51,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636297430] [2021-03-26 10:15:51,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:51,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:51,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:51,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:51,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:51,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:51,353 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:51,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:51,353 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636297430] [2021-03-26 10:15:51,353 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:51,353 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:51,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634332998] [2021-03-26 10:15:51,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:51,354 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:51,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:51,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:51,354 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 10:15:51,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 485 flow. Second operand has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:51,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 10:15:51,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:51,609 INFO L129 PetriNetUnfolder]: 1439/2654 cut-off events. [2021-03-26 10:15:51,609 INFO L130 PetriNetUnfolder]: For 10686/12975 co-relation queries the response was YES. [2021-03-26 10:15:51,618 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9077 conditions, 2654 events. 1439/2654 cut-off events. For 10686/12975 co-relation queries the response was YES. Maximal size of possible extension queue 487. Compared 21425 event pairs, 598 based on Foata normal form. 306/2491 useless extension candidates. Maximal degree in co-relation 9047. Up to 1640 conditions per place. [2021-03-26 10:15:51,627 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 15 selfloop transitions, 10 changer transitions 0/68 dead transitions. [2021-03-26 10:15:51,627 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 561 flow [2021-03-26 10:15:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:15:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:15:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 837 transitions. [2021-03-26 10:15:51,629 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8454545454545455 [2021-03-26 10:15:51,629 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 837 transitions. [2021-03-26 10:15:51,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 837 transitions. [2021-03-26 10:15:51,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:51,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 837 transitions. [2021-03-26 10:15:51,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,633 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:51,633 INFO L185 Difference]: Start difference. First operand has 69 places, 55 transitions, 485 flow. Second operand 5 states and 837 transitions. [2021-03-26 10:15:51,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 561 flow [2021-03-26 10:15:51,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 534 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-26 10:15:51,646 INFO L241 Difference]: Finished difference. Result has 74 places, 64 transitions, 553 flow [2021-03-26 10:15:51,646 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=553, PETRI_PLACES=74, PETRI_TRANSITIONS=64} [2021-03-26 10:15:51,646 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 20 predicate places. [2021-03-26 10:15:51,646 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:51,646 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 64 transitions, 553 flow [2021-03-26 10:15:51,646 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 64 transitions, 553 flow [2021-03-26 10:15:51,647 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 64 transitions, 553 flow [2021-03-26 10:15:51,877 INFO L129 PetriNetUnfolder]: 1446/2684 cut-off events. [2021-03-26 10:15:51,877 INFO L130 PetriNetUnfolder]: For 10933/13049 co-relation queries the response was YES. [2021-03-26 10:15:51,887 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10779 conditions, 2684 events. 1446/2684 cut-off events. For 10933/13049 co-relation queries the response was YES. Maximal size of possible extension queue 497. Compared 22041 event pairs, 589 based on Foata normal form. 14/2228 useless extension candidates. Maximal degree in co-relation 10747. Up to 1786 conditions per place. [2021-03-26 10:15:51,907 INFO L142 LiptonReduction]: Number of co-enabled transitions 1090 [2021-03-26 10:15:52,370 INFO L154 LiptonReduction]: Checked pairs total: 320 [2021-03-26 10:15:52,370 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:52,370 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 724 [2021-03-26 10:15:52,371 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 64 transitions, 553 flow [2021-03-26 10:15:52,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 163.75) internal successors, (655), 4 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:52,371 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:52,371 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:52,371 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:15:52,371 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:52,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:52,372 INFO L82 PathProgramCache]: Analyzing trace with hash -406902053, now seen corresponding path program 1 times [2021-03-26 10:15:52,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:52,372 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155075570] [2021-03-26 10:15:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:52,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:52,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:52,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:52,403 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:52,405 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:52,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:52,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155075570] [2021-03-26 10:15:52,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:52,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:15:52,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871982481] [2021-03-26 10:15:52,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:15:52,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:52,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:15:52,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:15:52,409 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 198 [2021-03-26 10:15:52,410 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 64 transitions, 553 flow. Second operand has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:52,410 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:52,410 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 198 [2021-03-26 10:15:52,410 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:52,843 INFO L129 PetriNetUnfolder]: 2647/4717 cut-off events. [2021-03-26 10:15:52,843 INFO L130 PetriNetUnfolder]: For 21022/24438 co-relation queries the response was YES. [2021-03-26 10:15:52,858 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18387 conditions, 4717 events. 2647/4717 cut-off events. For 21022/24438 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 40427 event pairs, 1105 based on Foata normal form. 94/3980 useless extension candidates. Maximal degree in co-relation 18353. Up to 3313 conditions per place. [2021-03-26 10:15:52,868 INFO L132 encePairwiseOnDemand]: 195/198 looper letters, 4 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2021-03-26 10:15:52,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 587 flow [2021-03-26 10:15:52,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:15:52,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:15:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 699 transitions. [2021-03-26 10:15:52,870 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8825757575757576 [2021-03-26 10:15:52,870 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 699 transitions. [2021-03-26 10:15:52,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 699 transitions. [2021-03-26 10:15:52,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:52,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 699 transitions. [2021-03-26 10:15:52,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.75) internal successors, (699), 4 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:52,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:52,872 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:52,873 INFO L185 Difference]: Start difference. First operand has 74 places, 64 transitions, 553 flow. Second operand 4 states and 699 transitions. [2021-03-26 10:15:52,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 587 flow [2021-03-26 10:15:52,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 582 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:52,887 INFO L241 Difference]: Finished difference. Result has 78 places, 65 transitions, 561 flow [2021-03-26 10:15:52,887 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=561, PETRI_PLACES=78, PETRI_TRANSITIONS=65} [2021-03-26 10:15:52,887 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 24 predicate places. [2021-03-26 10:15:52,887 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:52,887 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 78 places, 65 transitions, 561 flow [2021-03-26 10:15:52,887 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 78 places, 65 transitions, 561 flow [2021-03-26 10:15:52,888 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 78 places, 65 transitions, 561 flow [2021-03-26 10:15:53,231 INFO L129 PetriNetUnfolder]: 2646/4728 cut-off events. [2021-03-26 10:15:53,231 INFO L130 PetriNetUnfolder]: For 17589/20967 co-relation queries the response was YES. [2021-03-26 10:15:53,248 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18437 conditions, 4728 events. 2646/4728 cut-off events. For 17589/20967 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 40975 event pairs, 1069 based on Foata normal form. 41/3926 useless extension candidates. Maximal degree in co-relation 18403. Up to 3306 conditions per place. [2021-03-26 10:15:53,334 INFO L142 LiptonReduction]: Number of co-enabled transitions 1134 [2021-03-26 10:15:54,216 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:15:54,216 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:54,216 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1329 [2021-03-26 10:15:54,217 INFO L480 AbstractCegarLoop]: Abstraction has has 78 places, 65 transitions, 561 flow [2021-03-26 10:15:54,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:54,217 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:54,217 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:54,217 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:15:54,217 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:54,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:54,218 INFO L82 PathProgramCache]: Analyzing trace with hash 2138110627, now seen corresponding path program 1 times [2021-03-26 10:15:54,218 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:54,218 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101026066] [2021-03-26 10:15:54,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:54,254 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:54,255 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:54,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:54,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:54,261 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:54,261 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:54,267 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:54,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:54,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101026066] [2021-03-26 10:15:54,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:54,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:15:54,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799628173] [2021-03-26 10:15:54,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:15:54,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:54,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:15:54,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:15:54,270 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 10:15:54,270 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 65 transitions, 561 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:54,270 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:54,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 10:15:54,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:54,640 INFO L129 PetriNetUnfolder]: 1977/3734 cut-off events. [2021-03-26 10:15:54,640 INFO L130 PetriNetUnfolder]: For 17487/28233 co-relation queries the response was YES. [2021-03-26 10:15:54,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16516 conditions, 3734 events. 1977/3734 cut-off events. For 17487/28233 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 32005 event pairs, 309 based on Foata normal form. 1023/4177 useless extension candidates. Maximal degree in co-relation 16480. Up to 2871 conditions per place. [2021-03-26 10:15:54,666 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 13 selfloop transitions, 19 changer transitions 6/78 dead transitions. [2021-03-26 10:15:54,666 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 78 transitions, 705 flow [2021-03-26 10:15:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:15:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:15:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1172 transitions. [2021-03-26 10:15:54,668 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8455988455988456 [2021-03-26 10:15:54,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1172 transitions. [2021-03-26 10:15:54,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1172 transitions. [2021-03-26 10:15:54,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:54,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1172 transitions. [2021-03-26 10:15:54,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 167.42857142857142) internal successors, (1172), 7 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:54,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:54,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:54,673 INFO L185 Difference]: Start difference. First operand has 78 places, 65 transitions, 561 flow. Second operand 7 states and 1172 transitions. [2021-03-26 10:15:54,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 78 transitions, 705 flow [2021-03-26 10:15:54,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 78 transitions, 704 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:15:54,685 INFO L241 Difference]: Finished difference. Result has 86 places, 68 transitions, 636 flow [2021-03-26 10:15:54,686 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=636, PETRI_PLACES=86, PETRI_TRANSITIONS=68} [2021-03-26 10:15:54,686 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 32 predicate places. [2021-03-26 10:15:54,686 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:54,686 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 68 transitions, 636 flow [2021-03-26 10:15:54,686 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 68 transitions, 636 flow [2021-03-26 10:15:54,687 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 68 transitions, 636 flow [2021-03-26 10:15:54,967 INFO L129 PetriNetUnfolder]: 1944/3682 cut-off events. [2021-03-26 10:15:54,967 INFO L130 PetriNetUnfolder]: For 19921/29407 co-relation queries the response was YES. [2021-03-26 10:15:54,979 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19062 conditions, 3682 events. 1944/3682 cut-off events. For 19921/29407 co-relation queries the response was YES. Maximal size of possible extension queue 746. Compared 31792 event pairs, 303 based on Foata normal form. 53/3127 useless extension candidates. Maximal degree in co-relation 19024. Up to 2848 conditions per place. [2021-03-26 10:15:55,003 INFO L142 LiptonReduction]: Number of co-enabled transitions 1258 [2021-03-26 10:15:55,151 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:15:55,151 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:15:55,151 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 465 [2021-03-26 10:15:55,152 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 636 flow [2021-03-26 10:15:55,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:55,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:55,152 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:55,152 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:15:55,152 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash 294411184, now seen corresponding path program 1 times [2021-03-26 10:15:55,152 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:55,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251702429] [2021-03-26 10:15:55,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:55,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:55,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:55,194 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:55,195 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:55,198 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:55,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:55,201 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:55,202 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:55,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:55,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:55,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:55,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251702429] [2021-03-26 10:15:55,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:55,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:15:55,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370019085] [2021-03-26 10:15:55,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:15:55,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:15:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:15:55,208 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 198 [2021-03-26 10:15:55,209 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 636 flow. Second operand has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:55,209 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:55,209 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 198 [2021-03-26 10:15:55,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:55,493 INFO L129 PetriNetUnfolder]: 1438/2854 cut-off events. [2021-03-26 10:15:55,494 INFO L130 PetriNetUnfolder]: For 19331/41868 co-relation queries the response was YES. [2021-03-26 10:15:55,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16672 conditions, 2854 events. 1438/2854 cut-off events. For 19331/41868 co-relation queries the response was YES. Maximal size of possible extension queue 574. Compared 24201 event pairs, 31 based on Foata normal form. 1302/3655 useless extension candidates. Maximal degree in co-relation 16632. Up to 2495 conditions per place. [2021-03-26 10:15:55,511 INFO L132 encePairwiseOnDemand]: 191/198 looper letters, 7 selfloop transitions, 28 changer transitions 6/76 dead transitions. [2021-03-26 10:15:55,511 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 76 transitions, 779 flow [2021-03-26 10:15:55,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:15:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:15:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1507 transitions. [2021-03-26 10:15:55,514 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.845679012345679 [2021-03-26 10:15:55,514 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1507 transitions. [2021-03-26 10:15:55,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1507 transitions. [2021-03-26 10:15:55,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:55,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1507 transitions. [2021-03-26 10:15:55,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.44444444444446) internal successors, (1507), 9 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:55,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:55,528 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 198.0) internal successors, (1980), 10 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:55,528 INFO L185 Difference]: Start difference. First operand has 86 places, 68 transitions, 636 flow. Second operand 9 states and 1507 transitions. [2021-03-26 10:15:55,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 76 transitions, 779 flow [2021-03-26 10:15:55,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 76 transitions, 712 flow, removed 19 selfloop flow, removed 7 redundant places. [2021-03-26 10:15:55,565 INFO L241 Difference]: Finished difference. Result has 90 places, 70 transitions, 663 flow [2021-03-26 10:15:55,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=663, PETRI_PLACES=90, PETRI_TRANSITIONS=70} [2021-03-26 10:15:55,565 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 36 predicate places. [2021-03-26 10:15:55,565 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:55,565 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 70 transitions, 663 flow [2021-03-26 10:15:55,565 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 70 transitions, 663 flow [2021-03-26 10:15:55,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 70 transitions, 663 flow [2021-03-26 10:15:55,734 INFO L129 PetriNetUnfolder]: 1288/2642 cut-off events. [2021-03-26 10:15:55,735 INFO L130 PetriNetUnfolder]: For 18810/22361 co-relation queries the response was YES. [2021-03-26 10:15:55,745 INFO L84 FinitePrefix]: Finished finitePrefix Result has 14820 conditions, 2642 events. 1288/2642 cut-off events. For 18810/22361 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 23820 event pairs, 38 based on Foata normal form. 31/2153 useless extension candidates. Maximal degree in co-relation 14782. Up to 1841 conditions per place. [2021-03-26 10:15:55,764 INFO L142 LiptonReduction]: Number of co-enabled transitions 1304 [2021-03-26 10:15:56,372 WARN L205 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 10:15:56,576 WARN L205 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:15:57,776 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 10:15:58,207 WARN L205 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 10:15:58,227 INFO L154 LiptonReduction]: Checked pairs total: 5 [2021-03-26 10:15:58,227 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:15:58,227 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2662 [2021-03-26 10:15:58,228 INFO L480 AbstractCegarLoop]: Abstraction has has 90 places, 70 transitions, 681 flow [2021-03-26 10:15:58,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 163.83333333333334) internal successors, (983), 6 states have internal predecessors, (983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:58,228 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:15:58,228 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:15:58,228 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:15:58,229 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:15:58,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:15:58,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1714114975, now seen corresponding path program 1 times [2021-03-26 10:15:58,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:15:58,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337701024] [2021-03-26 10:15:58,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:15:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:15:58,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:58,263 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:58,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:58,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:58,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:58,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:58,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:58,273 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:15:58,277 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:58,278 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:15:58,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:15:58,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:15:58,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:15:58,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337701024] [2021-03-26 10:15:58,284 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:15:58,284 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:15:58,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208953003] [2021-03-26 10:15:58,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:15:58,285 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:15:58,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:15:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:15:58,286 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 199 [2021-03-26 10:15:58,286 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 70 transitions, 681 flow. Second operand has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:58,286 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:15:58,286 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 199 [2021-03-26 10:15:58,286 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:15:58,587 INFO L129 PetriNetUnfolder]: 1177/2417 cut-off events. [2021-03-26 10:15:58,587 INFO L130 PetriNetUnfolder]: For 20556/32177 co-relation queries the response was YES. [2021-03-26 10:15:58,597 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15419 conditions, 2417 events. 1177/2417 cut-off events. For 20556/32177 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 20675 event pairs, 0 based on Foata normal form. 1088/3009 useless extension candidates. Maximal degree in co-relation 15379. Up to 1683 conditions per place. [2021-03-26 10:15:58,600 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 2 selfloop transitions, 30 changer transitions 17/74 dead transitions. [2021-03-26 10:15:58,600 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 74 transitions, 774 flow [2021-03-26 10:15:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-03-26 10:15:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-03-26 10:15:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1835 transitions. [2021-03-26 10:15:58,604 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.838282320694381 [2021-03-26 10:15:58,604 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1835 transitions. [2021-03-26 10:15:58,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1835 transitions. [2021-03-26 10:15:58,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:15:58,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1835 transitions. [2021-03-26 10:15:58,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 166.8181818181818) internal successors, (1835), 11 states have internal predecessors, (1835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:58,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 199.0) internal successors, (2388), 12 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:58,610 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 199.0) internal successors, (2388), 12 states have internal predecessors, (2388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:15:58,610 INFO L185 Difference]: Start difference. First operand has 90 places, 70 transitions, 681 flow. Second operand 11 states and 1835 transitions. [2021-03-26 10:15:58,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 74 transitions, 774 flow [2021-03-26 10:15:58,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 74 transitions, 635 flow, removed 41 selfloop flow, removed 8 redundant places. [2021-03-26 10:15:58,775 INFO L241 Difference]: Finished difference. Result has 95 places, 57 transitions, 483 flow [2021-03-26 10:15:58,775 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=483, PETRI_PLACES=95, PETRI_TRANSITIONS=57} [2021-03-26 10:15:58,776 INFO L343 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2021-03-26 10:15:58,776 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:15:58,776 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 95 places, 57 transitions, 483 flow [2021-03-26 10:15:58,776 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 95 places, 57 transitions, 483 flow [2021-03-26 10:15:58,776 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 57 transitions, 483 flow [2021-03-26 10:15:58,802 INFO L129 PetriNetUnfolder]: 179/469 cut-off events. [2021-03-26 10:15:58,802 INFO L130 PetriNetUnfolder]: For 1780/2018 co-relation queries the response was YES. [2021-03-26 10:15:58,803 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 469 events. 179/469 cut-off events. For 1780/2018 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 3162 event pairs, 0 based on Foata normal form. 10/423 useless extension candidates. Maximal degree in co-relation 2080. Up to 130 conditions per place. [2021-03-26 10:15:58,805 INFO L142 LiptonReduction]: Number of co-enabled transitions 670 [2021-03-26 10:15:59,352 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 184 [2021-03-26 10:15:59,548 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-26 10:16:00,790 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 339 DAG size of output: 260 [2021-03-26 10:16:01,237 WARN L205 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-26 10:16:01,425 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:16:01,794 WARN L205 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 10:16:01,913 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:16:02,100 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:16:02,452 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-26 10:16:02,565 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-26 10:16:02,782 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:16:03,015 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:16:03,497 WARN L205 SmtUtils]: Spent 479.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:16:03,962 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:16:03,968 INFO L154 LiptonReduction]: Checked pairs total: 179 [2021-03-26 10:16:03,968 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:16:03,968 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5192 [2021-03-26 10:16:03,968 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 48 transitions, 436 flow [2021-03-26 10:16:03,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 163.85714285714286) internal successors, (1147), 7 states have internal predecessors, (1147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:16:03,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:16:03,969 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:16:03,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:16:03,969 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:16:03,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:16:03,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1411979657, now seen corresponding path program 1 times [2021-03-26 10:16:03,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:16:03,969 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161306198] [2021-03-26 10:16:03,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:16:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:16:03,988 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:16:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:16:04,008 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:16:04,028 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:16:04,028 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:16:04,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-03-26 10:16:04,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:16:04 BasicIcfg [2021-03-26 10:16:04,098 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:16:04,103 INFO L168 Benchmark]: Toolchain (without parser) took 29252.41 ms. Allocated memory was 367.0 MB in the beginning and 847.2 MB in the end (delta: 480.2 MB). Free memory was 330.1 MB in the beginning and 600.4 MB in the end (delta: -270.3 MB). Peak memory consumption was 211.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:16:04,104 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 367.0 MB. Free memory was 348.4 MB in the beginning and 348.3 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:16:04,104 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.93 ms. Allocated memory is still 367.0 MB. Free memory was 329.9 MB in the beginning and 326.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:16:04,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.48 ms. Allocated memory is still 367.0 MB. Free memory was 326.0 MB in the beginning and 322.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:16:04,104 INFO L168 Benchmark]: Boogie Preprocessor took 26.50 ms. Allocated memory is still 367.0 MB. Free memory was 322.8 MB in the beginning and 320.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:16:04,104 INFO L168 Benchmark]: RCFGBuilder took 1284.63 ms. Allocated memory is still 367.0 MB. Free memory was 320.1 MB in the beginning and 289.2 MB in the end (delta: 30.9 MB). Peak memory consumption was 163.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:16:04,104 INFO L168 Benchmark]: TraceAbstraction took 27455.18 ms. Allocated memory was 367.0 MB in the beginning and 847.2 MB in the end (delta: 480.2 MB). Free memory was 289.2 MB in the beginning and 600.4 MB in the end (delta: -311.2 MB). Peak memory consumption was 170.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:16:04,105 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.37 ms. Allocated memory is still 367.0 MB. Free memory was 348.4 MB in the beginning and 348.3 MB in the end (delta: 76.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 441.93 ms. Allocated memory is still 367.0 MB. Free memory was 329.9 MB in the beginning and 326.0 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 40.48 ms. Allocated memory is still 367.0 MB. Free memory was 326.0 MB in the beginning and 322.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 26.50 ms. Allocated memory is still 367.0 MB. Free memory was 322.8 MB in the beginning and 320.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1284.63 ms. Allocated memory is still 367.0 MB. Free memory was 320.1 MB in the beginning and 289.2 MB in the end (delta: 30.9 MB). Peak memory consumption was 163.6 MB. Max. memory is 16.0 GB. * TraceAbstraction took 27455.18 ms. Allocated memory was 367.0 MB in the beginning and 847.2 MB in the end (delta: 480.2 MB). Free memory was 289.2 MB in the beginning and 600.4 MB in the end (delta: -311.2 MB). Peak memory consumption was 170.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: 7571.7ms, 119 PlacesBefore, 54 PlacesAfterwards, 108 TransitionsBefore, 42 TransitionsAfterwards, 2406 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4010 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2326, positive: 2230, positive conditional: 2230, positive unconditional: 0, negative: 96, negative conditional: 96, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2326, positive: 2230, positive conditional: 0, positive unconditional: 2230, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2326, positive: 2230, positive conditional: 0, positive unconditional: 2230, negative: 96, negative conditional: 0, negative unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1680, positive: 1646, positive conditional: 0, positive unconditional: 1646, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1680, positive: 1626, positive conditional: 0, positive unconditional: 1626, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 521, positive: 62, positive conditional: 0, positive unconditional: 62, negative: 458, negative conditional: 0, negative unconditional: 458, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2326, positive: 584, positive conditional: 0, positive unconditional: 584, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 1680, unknown conditional: 0, unknown unconditional: 1680] , Statistics on independence cache: Total cache size (in pairs): 1680, Positive cache size: 1646, Positive conditional cache size: 0, Positive unconditional cache size: 1646, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3073.2ms, 50 PlacesBefore, 38 PlacesAfterwards, 35 TransitionsBefore, 27 TransitionsAfterwards, 362 CoEnabledTransitionPairs, 3 FixpointIterations, 6 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1154 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 467, positive: 398, positive conditional: 398, positive unconditional: 0, negative: 69, negative conditional: 69, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 467, positive: 398, positive conditional: 27, positive unconditional: 371, negative: 69, negative conditional: 7, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 467, positive: 398, positive conditional: 27, positive unconditional: 371, negative: 69, negative conditional: 7, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 104, positive: 83, positive conditional: 4, positive unconditional: 79, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 104, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 32, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 21, negative conditional: 2, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 322, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 266, negative conditional: 30, negative unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, positive: 315, positive conditional: 23, positive unconditional: 292, negative: 48, negative conditional: 5, negative unconditional: 43, unknown: 104, unknown conditional: 6, unknown unconditional: 98] , Statistics on independence cache: Total cache size (in pairs): 1784, Positive cache size: 1729, Positive conditional cache size: 4, Positive unconditional cache size: 1725, Negative cache size: 55, Negative conditional cache size: 2, Negative unconditional cache size: 53, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1001.9ms, 39 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 27 TransitionsAfterwards, 356 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 996 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 348, positive: 288, positive conditional: 288, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 348, positive: 288, positive conditional: 0, positive unconditional: 288, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 348, positive: 288, positive conditional: 0, positive unconditional: 288, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 348, positive: 283, positive conditional: 0, positive unconditional: 283, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1790, Positive cache size: 1734, Positive conditional cache size: 4, Positive unconditional cache size: 1730, Negative cache size: 56, Negative conditional cache size: 2, Negative unconditional cache size: 54, Eliminated conditions: 39 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.2ms, 39 PlacesBefore, 39 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 280 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 60, positive conditional: 60, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 76, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 76, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 12, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1792, Positive cache size: 1734, Positive conditional cache size: 4, Positive unconditional cache size: 1730, Negative cache size: 58, Negative conditional cache size: 2, Negative unconditional cache size: 56, Eliminated conditions: 8 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.3ms, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 394 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 316 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 102, positive: 84, positive conditional: 84, 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: 102, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 102, positive: 84, positive conditional: 0, positive unconditional: 84, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 102, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 1802, Positive cache size: 1744, Positive conditional cache size: 4, Positive unconditional cache size: 1740, Negative cache size: 58, Negative conditional cache size: 2, Negative unconditional cache size: 56, Eliminated conditions: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 37.5ms, 43 PlacesBefore, 43 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 428 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 260 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 77, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 14, negative conditional: 14, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 77, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 27, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1806, Positive cache size: 1747, Positive conditional cache size: 4, Positive unconditional cache size: 1743, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.2ms, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 510 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 214 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 49, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 10, negative conditional: 10, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 49, positive: 39, positive conditional: 3, positive unconditional: 36, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 49, positive: 39, positive conditional: 3, positive unconditional: 36, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 49, positive: 38, positive conditional: 3, positive unconditional: 35, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1807, Positive cache size: 1748, Positive conditional cache size: 4, Positive unconditional cache size: 1744, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.4ms, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 313 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 63, positive conditional: 63, 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: 76, positive: 63, positive conditional: 8, positive unconditional: 55, 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: 76, positive: 63, positive conditional: 8, positive unconditional: 55, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 76, positive: 62, positive conditional: 8, positive unconditional: 54, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1808, Positive cache size: 1749, Positive conditional cache size: 4, Positive unconditional cache size: 1745, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.2ms, 56 PlacesBefore, 56 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 421 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119, positive: 103, positive conditional: 103, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 119, positive: 103, positive conditional: 23, positive unconditional: 80, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 103, positive conditional: 23, positive unconditional: 80, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 1, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, positive: 99, positive conditional: 22, positive unconditional: 77, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 4, unknown conditional: 1, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1812, Positive cache size: 1753, Positive conditional cache size: 5, Positive unconditional cache size: 1748, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 705.6ms, 62 PlacesBefore, 62 PlacesAfterwards, 52 TransitionsBefore, 52 TransitionsAfterwards, 796 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 1379 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 414, positive: 366, positive conditional: 366, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 414, positive: 366, positive conditional: 88, positive unconditional: 278, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 414, positive: 366, positive conditional: 88, positive unconditional: 278, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 414, positive: 362, positive conditional: 86, positive unconditional: 276, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1816, Positive cache size: 1757, Positive conditional cache size: 7, Positive unconditional cache size: 1750, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 133 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 68.4ms, 67 PlacesBefore, 67 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 824 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 742 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 246, positive: 220, positive conditional: 220, positive unconditional: 0, negative: 26, negative conditional: 26, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 246, positive: 220, positive conditional: 74, positive unconditional: 146, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 246, positive: 220, positive conditional: 74, positive unconditional: 146, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 5, 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: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 246, positive: 215, positive conditional: 69, positive unconditional: 146, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1821, Positive cache size: 1762, Positive conditional cache size: 12, Positive unconditional cache size: 1750, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 62 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.2ms, 69 PlacesBefore, 69 PlacesAfterwards, 55 TransitionsBefore, 55 TransitionsAfterwards, 854 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 792 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 252, positive: 224, positive conditional: 224, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 252, positive: 224, positive conditional: 91, positive unconditional: 133, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 252, positive: 224, positive conditional: 91, positive unconditional: 133, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, 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: 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: 252, positive: 222, positive conditional: 89, positive unconditional: 133, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1823, Positive cache size: 1764, Positive conditional cache size: 14, Positive unconditional cache size: 1750, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 62 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 724.0ms, 74 PlacesBefore, 74 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 1090 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 320 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 25, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 34, positive: 25, positive conditional: 19, positive unconditional: 6, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 34, positive: 25, positive conditional: 19, positive unconditional: 6, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 34, positive: 25, positive conditional: 19, positive unconditional: 6, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1823, Positive cache size: 1764, Positive conditional cache size: 14, Positive unconditional cache size: 1750, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 4 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1329.1ms, 78 PlacesBefore, 78 PlacesAfterwards, 65 TransitionsBefore, 65 TransitionsAfterwards, 1134 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): 1823, Positive cache size: 1764, Positive conditional cache size: 14, Positive unconditional cache size: 1750, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 464.8ms, 86 PlacesBefore, 86 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 1258 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): 1823, Positive cache size: 1764, Positive conditional cache size: 14, Positive unconditional cache size: 1750, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2661.8ms, 90 PlacesBefore, 90 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 1304 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 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: 0, positive unconditional: 5, 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: 0, positive unconditional: 5, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1826, Positive cache size: 1767, Positive conditional cache size: 14, Positive unconditional cache size: 1753, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5191.9ms, 95 PlacesBefore, 86 PlacesAfterwards, 57 TransitionsBefore, 48 TransitionsAfterwards, 670 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 4 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 179 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 179, positive: 179, positive conditional: 179, 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: 179, positive: 179, positive conditional: 92, positive unconditional: 87, 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: 179, positive: 179, positive conditional: 92, positive unconditional: 87, 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: 25, positive: 25, positive conditional: 16, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 0, positive unconditional: 25, 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: 179, positive: 154, positive conditional: 76, positive unconditional: 78, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 25, unknown conditional: 16, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 1851, Positive cache size: 1792, Positive conditional cache size: 30, Positive unconditional cache size: 1762, Negative cache size: 59, Negative conditional cache size: 2, Negative unconditional cache size: 57, Eliminated conditions: 79 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L720] 0 int y = 0; [L722] 0 int z = 0; [L723] 0 _Bool z$flush_delayed; [L724] 0 int z$mem_tmp; [L725] 0 _Bool z$r_buff0_thd0; [L726] 0 _Bool z$r_buff0_thd1; [L727] 0 _Bool z$r_buff0_thd2; [L728] 0 _Bool z$r_buff0_thd3; [L729] 0 _Bool z$r_buff0_thd4; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$r_buff1_thd3; [L734] 0 _Bool z$r_buff1_thd4; [L735] 0 _Bool z$read_delayed; [L736] 0 int *z$read_delayed_var; [L737] 0 int z$w_buff0; [L738] 0 _Bool z$w_buff0_used; [L739] 0 int z$w_buff1; [L740] 0 _Bool z$w_buff1_used; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1541; [L835] FCALL, FORK 0 pthread_create(&t1541, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 pthread_t t1542; [L837] FCALL, FORK 0 pthread_create(&t1542, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1543; [L839] FCALL, FORK 0 pthread_create(&t1543, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1544; [L841] FCALL, FORK 0 pthread_create(&t1544, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 2 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L801] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L802] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L803] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L804] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L805] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L782] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L782] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L783] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L786] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L816] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L789] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 3 return 0; [L819] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 4 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L861] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L862] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L863] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L863] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L866] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L866] 0 z = z$flush_delayed ? z$mem_tmp : z [L867] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 27305.0ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2861.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7641.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 57 SDtfs, 40 SDslu, 26 SDs, 0 SdLazy, 329 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 326.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 320.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=681occurred in iteration=15, InterpolantAutomatonStates: 80, 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: 46.7ms SsaConstructionTime, 348.9ms SatisfiabilityAnalysisTime, 743.0ms InterpolantComputationTime, 304 NumberOfCodeBlocks, 304 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 1313 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...