/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-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 00:48:12,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 00:48:12,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 00:48:12,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 00:48:12,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 00:48:12,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 00:48:12,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 00:48:12,187 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 00:48:12,188 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 00:48:12,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 00:48:12,192 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 00:48:12,193 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 00:48:12,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 00:48:12,195 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 00:48:12,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 00:48:12,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 00:48:12,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 00:48:12,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 00:48:12,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 00:48:12,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 00:48:12,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 00:48:12,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 00:48:12,209 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 00:48:12,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 00:48:12,215 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 00:48:12,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 00:48:12,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 00:48:12,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 00:48:12,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 00:48:12,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 00:48:12,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 00:48:12,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 00:48:12,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 00:48:12,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 00:48:12,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 00:48:12,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 00:48:12,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 00:48:12,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 00:48:12,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 00:48:12,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 00:48:12,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 00:48:12,222 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-RepeatedSemanticLbeWithPredicates.epf [2021-03-26 00:48:12,259 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 00:48:12,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 00:48:12,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 00:48:12,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 00:48:12,262 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 00:48:12,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 00:48:12,262 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 00:48:12,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 00:48:12,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 00:48:12,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 00:48:12,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 00:48:12,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 00:48:12,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 00:48:12,263 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 00:48:12,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 00:48:12,263 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 00:48:12,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 00:48:12,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 00:48:12,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 00:48:12,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 00:48:12,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 00:48:12,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:48:12,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 00:48:12,264 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 00:48:12,264 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 00:48:12,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 00:48:12,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 00:48:12,265 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-03-26 00:48:12,265 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 00:48:12,265 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 00:48:12,265 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 00:48:12,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 00:48:12,548 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 00:48:12,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 00:48:12,551 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 00:48:12,552 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 00:48:12,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2021-03-26 00:48:12,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7041aaf/fe57c5aff0fc44f2965ab139e45c7fdc/FLAG0df2e473a [2021-03-26 00:48:13,014 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 00:48:13,015 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.opt.i [2021-03-26 00:48:13,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7041aaf/fe57c5aff0fc44f2965ab139e45c7fdc/FLAG0df2e473a [2021-03-26 00:48:13,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7041aaf/fe57c5aff0fc44f2965ab139e45c7fdc [2021-03-26 00:48:13,376 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 00:48:13,377 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 00:48:13,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 00:48:13,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 00:48:13,385 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 00:48:13,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d64e306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13, skipping insertion in model container [2021-03-26 00:48:13,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,390 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 00:48:13,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 00:48:13,516 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/safe029_pso.opt.i[949,962] [2021-03-26 00:48:13,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:48:13,688 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 00:48:13,700 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/safe029_pso.opt.i[949,962] [2021-03-26 00:48:13,745 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 00:48:13,797 INFO L208 MainTranslator]: Completed translation [2021-03-26 00:48:13,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13 WrapperNode [2021-03-26 00:48:13,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 00:48:13,800 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 00:48:13,800 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 00:48:13,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 00:48:13,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,835 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,864 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 00:48:13,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 00:48:13,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 00:48:13,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 00:48:13,872 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,888 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... [2021-03-26 00:48:13,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 00:48:13,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 00:48:13,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 00:48:13,911 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 00:48:13,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 00:48:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 00:48:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 00:48:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 00:48:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 00:48:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 00:48:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 00:48:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 00:48:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 00:48:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 00:48:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 00:48:13,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 00:48:13,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 00:48:13,995 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 00:48:15,167 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 00:48:15,167 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 00:48:15,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:48:15 BoogieIcfgContainer [2021-03-26 00:48:15,169 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 00:48:15,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 00:48:15,170 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 00:48:15,172 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 00:48:15,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 12:48:13" (1/3) ... [2021-03-26 00:48:15,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e872a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:48:15, skipping insertion in model container [2021-03-26 00:48:15,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 12:48:13" (2/3) ... [2021-03-26 00:48:15,174 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e872a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 12:48:15, skipping insertion in model container [2021-03-26 00:48:15,174 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 12:48:15" (3/3) ... [2021-03-26 00:48:15,175 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2021-03-26 00:48:15,182 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 00:48:15,185 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 00:48:15,186 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 00:48:15,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,210 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,211 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,212 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,216 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,218 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,218 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,219 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 00:48:15,221 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 00:48:15,233 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 00:48:15,246 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 00:48:15,246 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 00:48:15,246 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 00:48:15,246 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 00:48:15,246 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 00:48:15,246 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 00:48:15,246 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 00:48:15,247 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 00:48:15,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 00:48:15,273 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 00:48:15,274 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:15,276 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 00:48:15,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-26 00:48:15,279 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-26 00:48:15,280 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:15,288 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 00:48:15,290 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-26 00:48:15,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-26 00:48:15,301 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-26 00:48:15,301 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:15,302 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-26 00:48:15,303 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-26 00:48:16,293 WARN L205 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-26 00:48:16,588 WARN L205 SmtUtils]: Spent 291.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-26 00:48:17,772 WARN L205 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-26 00:48:18,264 WARN L205 SmtUtils]: Spent 488.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-26 00:48:18,789 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 00:48:19,089 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 00:48:20,247 WARN L205 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-26 00:48:20,500 WARN L205 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-26 00:48:20,993 WARN L205 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:48:21,527 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:48:21,768 INFO L154 LiptonReduction]: Checked pairs total: 1657 [2021-03-26 00:48:21,768 INFO L156 LiptonReduction]: Total number of compositions: 53 [2021-03-26 00:48:21,769 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6490 [2021-03-26 00:48:21,776 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-26 00:48:21,776 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:21,776 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:21,777 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:21,777 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:21,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:21,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1463710772, now seen corresponding path program 1 times [2021-03-26 00:48:21,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:21,785 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203743437] [2021-03-26 00:48:21,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:21,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:21,973 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:21,974 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:21,974 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:21,978 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 00:48:21,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203743437] [2021-03-26 00:48:21,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:21,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:21,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732721991] [2021-03-26 00:48:21,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:21,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:21,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:22,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:22,001 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 132 [2021-03-26 00:48:22,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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 00:48:22,004 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:22,004 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 132 [2021-03-26 00:48:22,005 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:22,068 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-26 00:48:22,069 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:22,069 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 91 events. 23/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 332 event pairs, 9 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 130. Up to 37 conditions per place. [2021-03-26 00:48:22,070 INFO L132 encePairwiseOnDemand]: 128/132 looper letters, 7 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2021-03-26 00:48:22,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 92 flow [2021-03-26 00:48:22,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:22,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2021-03-26 00:48:22,079 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8762626262626263 [2021-03-26 00:48:22,079 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2021-03-26 00:48:22,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2021-03-26 00:48:22,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:22,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2021-03-26 00:48:22,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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 00:48:22,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 00:48:22,095 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 00:48:22,096 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 347 transitions. [2021-03-26 00:48:22,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 92 flow [2021-03-26 00:48:22,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:22,105 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 56 flow [2021-03-26 00:48:22,106 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-26 00:48:22,107 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-26 00:48:22,108 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:22,108 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-26 00:48:22,110 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-26 00:48:22,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2021-03-26 00:48:22,118 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 00:48:22,118 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:22,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 00:48:22,119 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 00:48:22,452 WARN L205 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:48:22,721 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 00:48:23,844 WARN L205 SmtUtils]: Spent 1.12 s on a formula simplification. DAG size of input: 264 DAG size of output: 263 [2021-03-26 00:48:24,376 WARN L205 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-26 00:48:24,789 INFO L154 LiptonReduction]: Checked pairs total: 448 [2021-03-26 00:48:24,789 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-26 00:48:24,789 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2681 [2021-03-26 00:48:24,790 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-26 00:48:24,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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 00:48:24,790 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:24,791 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:24,791 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 00:48:24,791 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:24,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:24,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1396965882, now seen corresponding path program 1 times [2021-03-26 00:48:24,791 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:24,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383324670] [2021-03-26 00:48:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:24,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:24,863 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:24,863 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:24,864 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:24,864 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:24,872 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:24,873 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:24,877 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 00:48:24,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383324670] [2021-03-26 00:48:24,878 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:24,878 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:24,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035258690] [2021-03-26 00:48:24,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:48:24,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:24,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:48:24,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:48:24,880 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2021-03-26 00:48:24,880 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 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 00:48:24,880 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:24,880 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2021-03-26 00:48:24,880 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:24,900 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 00:48:24,901 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 00:48:24,902 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2021-03-26 00:48:24,902 INFO L132 encePairwiseOnDemand]: 134/138 looper letters, 3 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2021-03-26 00:48:24,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 60 flow [2021-03-26 00:48:24,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:24,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:24,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2021-03-26 00:48:24,906 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2021-03-26 00:48:24,906 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2021-03-26 00:48:24,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2021-03-26 00:48:24,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:24,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2021-03-26 00:48:24,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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 00:48:24,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 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 00:48:24,908 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 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 00:48:24,908 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 3 states and 352 transitions. [2021-03-26 00:48:24,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 60 flow [2021-03-26 00:48:24,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 20 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:24,909 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 59 flow [2021-03-26 00:48:24,909 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2021-03-26 00:48:24,910 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -11 predicate places. [2021-03-26 00:48:24,910 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:24,910 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 59 flow [2021-03-26 00:48:24,910 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 59 flow [2021-03-26 00:48:24,910 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 59 flow [2021-03-26 00:48:24,913 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-26 00:48:24,913 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 00:48:24,913 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 1 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 37. Up to 10 conditions per place. [2021-03-26 00:48:24,913 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-26 00:48:25,423 WARN L205 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 00:48:25,526 WARN L205 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-26 00:48:25,755 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-26 00:48:25,860 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-26 00:48:25,862 INFO L154 LiptonReduction]: Checked pairs total: 342 [2021-03-26 00:48:25,862 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 00:48:25,863 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 953 [2021-03-26 00:48:25,863 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-03-26 00:48:25,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 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 00:48:25,864 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:25,864 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:25,864 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 00:48:25,864 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:25,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1388591254, now seen corresponding path program 1 times [2021-03-26 00:48:25,864 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:25,864 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584589626] [2021-03-26 00:48:25,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:25,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:25,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:48:25,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:25,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:25,953 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 00:48:25,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584589626] [2021-03-26 00:48:25,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:25,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:25,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34157594] [2021-03-26 00:48:25,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:48:25,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:48:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:48:25,955 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 140 [2021-03-26 00:48:25,956 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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 00:48:25,956 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:25,956 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 140 [2021-03-26 00:48:25,956 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:25,995 INFO L129 PetriNetUnfolder]: 35/89 cut-off events. [2021-03-26 00:48:25,995 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-26 00:48:25,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 89 events. 35/89 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 319 event pairs, 24 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 176. Up to 61 conditions per place. [2021-03-26 00:48:25,996 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2021-03-26 00:48:25,996 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 81 flow [2021-03-26 00:48:26,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2021-03-26 00:48:26,003 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7761904761904762 [2021-03-26 00:48:26,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2021-03-26 00:48:26,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2021-03-26 00:48:26,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:26,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2021-03-26 00:48:26,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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 00:48:26,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 00:48:26,007 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 00:48:26,007 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 326 transitions. [2021-03-26 00:48:26,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 81 flow [2021-03-26 00:48:26,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 78 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:26,008 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 71 flow [2021-03-26 00:48:26,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2021-03-26 00:48:26,008 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -11 predicate places. [2021-03-26 00:48:26,008 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:26,009 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 71 flow [2021-03-26 00:48:26,009 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 71 flow [2021-03-26 00:48:26,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 71 flow [2021-03-26 00:48:26,016 INFO L129 PetriNetUnfolder]: 6/37 cut-off events. [2021-03-26 00:48:26,017 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2021-03-26 00:48:26,017 INFO L84 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 37 events. 6/37 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 116 event pairs, 2 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 63. Up to 13 conditions per place. [2021-03-26 00:48:26,018 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-26 00:48:26,049 INFO L154 LiptonReduction]: Checked pairs total: 72 [2021-03-26 00:48:26,049 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:26,049 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 41 [2021-03-26 00:48:26,051 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 71 flow [2021-03-26 00:48:26,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 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 00:48:26,052 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:26,052 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:26,052 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 00:48:26,052 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1850481260, now seen corresponding path program 1 times [2021-03-26 00:48:26,053 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:26,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032203347] [2021-03-26 00:48:26,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:26,136 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:48:26,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:26,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:48:26,162 INFO L142 QuantifierPusher]: treesize reduction 4, result has 76.5 percent of original size [2021-03-26 00:48:26,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:26,169 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 00:48:26,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032203347] [2021-03-26 00:48:26,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:26,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:26,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565435555] [2021-03-26 00:48:26,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:26,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:26,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:26,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:26,173 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2021-03-26 00:48:26,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:26,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2021-03-26 00:48:26,174 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:26,303 INFO L129 PetriNetUnfolder]: 120/236 cut-off events. [2021-03-26 00:48:26,303 INFO L130 PetriNetUnfolder]: For 81/81 co-relation queries the response was YES. [2021-03-26 00:48:26,306 INFO L84 FinitePrefix]: Finished finitePrefix Result has 563 conditions, 236 events. 120/236 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 918 event pairs, 17 based on Foata normal form. 4/222 useless extension candidates. Maximal degree in co-relation 551. Up to 177 conditions per place. [2021-03-26 00:48:26,310 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 15 selfloop transitions, 9 changer transitions 3/34 dead transitions. [2021-03-26 00:48:26,311 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 157 flow [2021-03-26 00:48:26,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2021-03-26 00:48:26,317 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7271428571428571 [2021-03-26 00:48:26,317 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2021-03-26 00:48:26,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2021-03-26 00:48:26,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:26,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2021-03-26 00:48:26,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 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 00:48:26,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,321 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 71 flow. Second operand 5 states and 509 transitions. [2021-03-26 00:48:26,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 157 flow [2021-03-26 00:48:26,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:26,323 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 125 flow [2021-03-26 00:48:26,323 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2021-03-26 00:48:26,323 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2021-03-26 00:48:26,323 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:26,326 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 125 flow [2021-03-26 00:48:26,327 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 125 flow [2021-03-26 00:48:26,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 125 flow [2021-03-26 00:48:26,339 INFO L129 PetriNetUnfolder]: 21/68 cut-off events. [2021-03-26 00:48:26,339 INFO L130 PetriNetUnfolder]: For 112/116 co-relation queries the response was YES. [2021-03-26 00:48:26,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 209 conditions, 68 events. 21/68 cut-off events. For 112/116 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 233 event pairs, 8 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 195. Up to 28 conditions per place. [2021-03-26 00:48:26,342 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 00:48:26,371 INFO L154 LiptonReduction]: Checked pairs total: 32 [2021-03-26 00:48:26,371 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:26,371 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 48 [2021-03-26 00:48:26,372 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 125 flow [2021-03-26 00:48:26,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,372 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:26,373 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:26,373 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 00:48:26,373 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1125626090, now seen corresponding path program 1 times [2021-03-26 00:48:26,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:26,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677358440] [2021-03-26 00:48:26,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:26,425 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:26,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:26,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:26,446 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 00:48:26,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677358440] [2021-03-26 00:48:26,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:26,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:26,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568913273] [2021-03-26 00:48:26,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:26,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:26,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:26,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:26,448 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2021-03-26 00:48:26,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 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 00:48:26,449 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:26,449 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2021-03-26 00:48:26,449 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:26,496 INFO L129 PetriNetUnfolder]: 37/99 cut-off events. [2021-03-26 00:48:26,496 INFO L130 PetriNetUnfolder]: For 197/201 co-relation queries the response was YES. [2021-03-26 00:48:26,497 INFO L84 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 99 events. 37/99 cut-off events. For 197/201 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 356 event pairs, 6 based on Foata normal form. 4/101 useless extension candidates. Maximal degree in co-relation 302. Up to 59 conditions per place. [2021-03-26 00:48:26,497 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 12 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2021-03-26 00:48:26,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 173 flow [2021-03-26 00:48:26,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 00:48:26,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 00:48:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2021-03-26 00:48:26,499 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7607142857142857 [2021-03-26 00:48:26,499 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2021-03-26 00:48:26,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2021-03-26 00:48:26,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:26,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2021-03-26 00:48:26,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 00:48:26,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 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 00:48:26,501 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 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 00:48:26,501 INFO L185 Difference]: Start difference. First operand has 32 places, 25 transitions, 125 flow. Second operand 4 states and 426 transitions. [2021-03-26 00:48:26,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 173 flow [2021-03-26 00:48:26,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 164 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:26,503 INFO L241 Difference]: Finished difference. Result has 35 places, 27 transitions, 141 flow [2021-03-26 00:48:26,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2021-03-26 00:48:26,504 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-26 00:48:26,504 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:26,504 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 141 flow [2021-03-26 00:48:26,504 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 141 flow [2021-03-26 00:48:26,505 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 141 flow [2021-03-26 00:48:26,513 INFO L129 PetriNetUnfolder]: 29/78 cut-off events. [2021-03-26 00:48:26,513 INFO L130 PetriNetUnfolder]: For 232/240 co-relation queries the response was YES. [2021-03-26 00:48:26,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 78 events. 29/78 cut-off events. For 232/240 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 281 event pairs, 10 based on Foata normal form. 1/71 useless extension candidates. Maximal degree in co-relation 253. Up to 35 conditions per place. [2021-03-26 00:48:26,514 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-26 00:48:26,516 INFO L154 LiptonReduction]: Checked pairs total: 34 [2021-03-26 00:48:26,516 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:26,516 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-26 00:48:26,518 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 141 flow [2021-03-26 00:48:26,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 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 00:48:26,519 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:26,519 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:26,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 00:48:26,519 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:26,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:26,525 INFO L82 PathProgramCache]: Analyzing trace with hash -549513630, now seen corresponding path program 1 times [2021-03-26 00:48:26,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:26,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313223447] [2021-03-26 00:48:26,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:26,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:26,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:26,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,573 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:26,574 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:26,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:26,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:26,585 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 00:48:26,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313223447] [2021-03-26 00:48:26,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:26,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:26,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693189257] [2021-03-26 00:48:26,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:26,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:26,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:26,587 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140 [2021-03-26 00:48:26,587 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 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 00:48:26,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:26,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140 [2021-03-26 00:48:26,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:26,643 INFO L129 PetriNetUnfolder]: 42/107 cut-off events. [2021-03-26 00:48:26,643 INFO L130 PetriNetUnfolder]: For 308/312 co-relation queries the response was YES. [2021-03-26 00:48:26,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 387 conditions, 107 events. 42/107 cut-off events. For 308/312 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 407 event pairs, 13 based on Foata normal form. 4/105 useless extension candidates. Maximal degree in co-relation 369. Up to 63 conditions per place. [2021-03-26 00:48:26,645 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 9 selfloop transitions, 13 changer transitions 0/34 dead transitions. [2021-03-26 00:48:26,645 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 34 transitions, 223 flow [2021-03-26 00:48:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 561 transitions. [2021-03-26 00:48:26,647 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8014285714285714 [2021-03-26 00:48:26,647 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 561 transitions. [2021-03-26 00:48:26,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 561 transitions. [2021-03-26 00:48:26,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:26,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 561 transitions. [2021-03-26 00:48:26,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 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 00:48:26,650 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,650 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:26,650 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 141 flow. Second operand 5 states and 561 transitions. [2021-03-26 00:48:26,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 34 transitions, 223 flow [2021-03-26 00:48:26,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 214 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:26,654 INFO L241 Difference]: Finished difference. Result has 39 places, 33 transitions, 215 flow [2021-03-26 00:48:26,655 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2021-03-26 00:48:26,655 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2021-03-26 00:48:26,655 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:26,655 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 33 transitions, 215 flow [2021-03-26 00:48:26,655 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 33 transitions, 215 flow [2021-03-26 00:48:26,655 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 33 transitions, 215 flow [2021-03-26 00:48:26,667 INFO L129 PetriNetUnfolder]: 42/103 cut-off events. [2021-03-26 00:48:26,667 INFO L130 PetriNetUnfolder]: For 413/421 co-relation queries the response was YES. [2021-03-26 00:48:26,667 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 103 events. 42/103 cut-off events. For 413/421 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 367 event pairs, 6 based on Foata normal form. 3/99 useless extension candidates. Maximal degree in co-relation 385. Up to 41 conditions per place. [2021-03-26 00:48:26,668 INFO L142 LiptonReduction]: Number of co-enabled transitions 166 [2021-03-26 00:48:26,832 WARN L205 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 00:48:27,257 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2021-03-26 00:48:27,400 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 00:48:27,403 INFO L154 LiptonReduction]: Checked pairs total: 91 [2021-03-26 00:48:27,403 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:48:27,404 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 749 [2021-03-26 00:48:27,405 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 218 flow [2021-03-26 00:48:27,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 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 00:48:27,405 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:27,405 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:27,405 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 00:48:27,405 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:27,406 INFO L82 PathProgramCache]: Analyzing trace with hash -549474570, now seen corresponding path program 2 times [2021-03-26 00:48:27,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:27,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771368760] [2021-03-26 00:48:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:27,462 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:27,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,467 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 00:48:27,468 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,470 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:48:27,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:27,478 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:27,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:27,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771368760] [2021-03-26 00:48:27,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:27,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:27,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441314522] [2021-03-26 00:48:27,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:27,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:27,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:27,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:27,488 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 141 [2021-03-26 00:48:27,488 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:27,488 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:27,488 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 141 [2021-03-26 00:48:27,488 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:27,540 INFO L129 PetriNetUnfolder]: 43/114 cut-off events. [2021-03-26 00:48:27,540 INFO L130 PetriNetUnfolder]: For 507/535 co-relation queries the response was YES. [2021-03-26 00:48:27,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 114 events. 43/114 cut-off events. For 507/535 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 461 event pairs, 6 based on Foata normal form. 17/127 useless extension candidates. Maximal degree in co-relation 452. Up to 60 conditions per place. [2021-03-26 00:48:27,542 INFO L132 encePairwiseOnDemand]: 134/141 looper letters, 12 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2021-03-26 00:48:27,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 257 flow [2021-03-26 00:48:27,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:27,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2021-03-26 00:48:27,544 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7659574468085106 [2021-03-26 00:48:27,544 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2021-03-26 00:48:27,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2021-03-26 00:48:27,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:27,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2021-03-26 00:48:27,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:27,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 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 00:48:27,546 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 0 states have call successors, (0), 0 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 00:48:27,546 INFO L185 Difference]: Start difference. First operand has 39 places, 33 transitions, 218 flow. Second operand 5 states and 540 transitions. [2021-03-26 00:48:27,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 257 flow [2021-03-26 00:48:27,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 248 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:27,549 INFO L241 Difference]: Finished difference. Result has 42 places, 32 transitions, 212 flow [2021-03-26 00:48:27,549 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2021-03-26 00:48:27,549 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2021-03-26 00:48:27,549 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:27,550 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 32 transitions, 212 flow [2021-03-26 00:48:27,550 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 32 transitions, 212 flow [2021-03-26 00:48:27,550 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 32 transitions, 212 flow [2021-03-26 00:48:27,561 INFO L129 PetriNetUnfolder]: 30/96 cut-off events. [2021-03-26 00:48:27,561 INFO L130 PetriNetUnfolder]: For 412/422 co-relation queries the response was YES. [2021-03-26 00:48:27,562 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 96 events. 30/96 cut-off events. For 412/422 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 384 event pairs, 7 based on Foata normal form. 2/95 useless extension candidates. Maximal degree in co-relation 345. Up to 34 conditions per place. [2021-03-26 00:48:27,562 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-26 00:48:28,124 WARN L205 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 178 [2021-03-26 00:48:28,315 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-26 00:48:29,445 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 332 DAG size of output: 254 [2021-03-26 00:48:29,898 WARN L205 SmtUtils]: Spent 430.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 00:48:29,903 INFO L154 LiptonReduction]: Checked pairs total: 110 [2021-03-26 00:48:29,903 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:48:29,903 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2354 [2021-03-26 00:48:29,904 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 224 flow [2021-03-26 00:48:29,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:29,904 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:29,904 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:29,904 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 00:48:29,904 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:29,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:29,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1530344188, now seen corresponding path program 3 times [2021-03-26 00:48:29,905 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:29,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435363075] [2021-03-26 00:48:29,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:29,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:29,929 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:29,935 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:29,935 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:48:29,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:29,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:48:29,950 INFO L142 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-03-26 00:48:29,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:48:29,958 INFO L142 QuantifierPusher]: treesize reduction 4, result has 75.0 percent of original size [2021-03-26 00:48:29,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-26 00:48:29,966 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 00:48:29,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435363075] [2021-03-26 00:48:29,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:29,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:48:29,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594021359] [2021-03-26 00:48:29,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:48:29,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:29,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:48:29,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:48:29,967 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 142 [2021-03-26 00:48:29,968 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 224 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 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 00:48:29,968 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:29,968 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 142 [2021-03-26 00:48:29,968 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:30,093 INFO L129 PetriNetUnfolder]: 138/269 cut-off events. [2021-03-26 00:48:30,094 INFO L130 PetriNetUnfolder]: For 1055/1055 co-relation queries the response was YES. [2021-03-26 00:48:30,094 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 269 events. 138/269 cut-off events. For 1055/1055 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1171 event pairs, 16 based on Foata normal form. 6/250 useless extension candidates. Maximal degree in co-relation 1028. Up to 176 conditions per place. [2021-03-26 00:48:30,095 INFO L132 encePairwiseOnDemand]: 133/142 looper letters, 23 selfloop transitions, 15 changer transitions 3/48 dead transitions. [2021-03-26 00:48:30,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 371 flow [2021-03-26 00:48:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 00:48:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 00:48:30,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 588 transitions. [2021-03-26 00:48:30,097 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2021-03-26 00:48:30,097 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 588 transitions. [2021-03-26 00:48:30,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 588 transitions. [2021-03-26 00:48:30,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:30,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 588 transitions. [2021-03-26 00:48:30,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.0) internal successors, (588), 6 states have internal predecessors, (588), 0 states have call successors, (0), 0 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 00:48:30,100 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 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 00:48:30,100 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 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 00:48:30,100 INFO L185 Difference]: Start difference. First operand has 42 places, 32 transitions, 224 flow. Second operand 6 states and 588 transitions. [2021-03-26 00:48:30,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 371 flow [2021-03-26 00:48:30,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 340 flow, removed 8 selfloop flow, removed 3 redundant places. [2021-03-26 00:48:30,103 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 265 flow [2021-03-26 00:48:30,103 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=265, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2021-03-26 00:48:30,103 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2021-03-26 00:48:30,103 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:30,104 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 35 transitions, 265 flow [2021-03-26 00:48:30,104 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 35 transitions, 265 flow [2021-03-26 00:48:30,104 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 265 flow [2021-03-26 00:48:30,117 INFO L129 PetriNetUnfolder]: 28/92 cut-off events. [2021-03-26 00:48:30,117 INFO L130 PetriNetUnfolder]: For 365/376 co-relation queries the response was YES. [2021-03-26 00:48:30,117 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 92 events. 28/92 cut-off events. For 365/376 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 386 event pairs, 6 based on Foata normal form. 3/89 useless extension candidates. Maximal degree in co-relation 378. Up to 37 conditions per place. [2021-03-26 00:48:30,118 INFO L142 LiptonReduction]: Number of co-enabled transitions 172 [2021-03-26 00:48:30,125 INFO L154 LiptonReduction]: Checked pairs total: 54 [2021-03-26 00:48:30,125 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:30,125 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 00:48:30,125 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 265 flow [2021-03-26 00:48:30,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 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 00:48:30,126 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:30,126 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:30,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 00:48:30,126 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:30,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:30,126 INFO L82 PathProgramCache]: Analyzing trace with hash -534694533, now seen corresponding path program 1 times [2021-03-26 00:48:30,126 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:30,126 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29445395] [2021-03-26 00:48:30,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:30,176 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,176 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:30,177 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,177 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:30,179 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 00:48:30,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29445395] [2021-03-26 00:48:30,179 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:30,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 00:48:30,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452855265] [2021-03-26 00:48:30,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 00:48:30,180 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:30,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 00:48:30,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 00:48:30,181 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 142 [2021-03-26 00:48:30,181 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 265 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 00:48:30,181 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:30,181 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 142 [2021-03-26 00:48:30,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:30,205 INFO L129 PetriNetUnfolder]: 32/112 cut-off events. [2021-03-26 00:48:30,205 INFO L130 PetriNetUnfolder]: For 797/824 co-relation queries the response was YES. [2021-03-26 00:48:30,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 112 events. 32/112 cut-off events. For 797/824 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 512 event pairs, 7 based on Foata normal form. 10/114 useless extension candidates. Maximal degree in co-relation 478. Up to 47 conditions per place. [2021-03-26 00:48:30,206 INFO L132 encePairwiseOnDemand]: 138/142 looper letters, 4 selfloop transitions, 3 changer transitions 4/35 dead transitions. [2021-03-26 00:48:30,206 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 35 transitions, 279 flow [2021-03-26 00:48:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 00:48:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 00:48:30,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2021-03-26 00:48:30,208 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8708920187793427 [2021-03-26 00:48:30,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 371 transitions. [2021-03-26 00:48:30,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 371 transitions. [2021-03-26 00:48:30,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:30,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 371 transitions. [2021-03-26 00:48:30,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 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 00:48:30,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 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 00:48:30,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 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 00:48:30,210 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 265 flow. Second operand 3 states and 371 transitions. [2021-03-26 00:48:30,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 35 transitions, 279 flow [2021-03-26 00:48:30,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 255 flow, removed 1 selfloop flow, removed 5 redundant places. [2021-03-26 00:48:30,213 INFO L241 Difference]: Finished difference. Result has 43 places, 31 transitions, 225 flow [2021-03-26 00:48:30,213 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2021-03-26 00:48:30,213 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2021-03-26 00:48:30,213 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:30,213 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 31 transitions, 225 flow [2021-03-26 00:48:30,214 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 31 transitions, 225 flow [2021-03-26 00:48:30,214 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 31 transitions, 225 flow [2021-03-26 00:48:30,222 INFO L129 PetriNetUnfolder]: 25/95 cut-off events. [2021-03-26 00:48:30,223 INFO L130 PetriNetUnfolder]: For 349/359 co-relation queries the response was YES. [2021-03-26 00:48:30,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 95 events. 25/95 cut-off events. For 349/359 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 432 event pairs, 8 based on Foata normal form. 2/91 useless extension candidates. Maximal degree in co-relation 373. Up to 41 conditions per place. [2021-03-26 00:48:30,223 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-26 00:48:30,229 INFO L154 LiptonReduction]: Checked pairs total: 71 [2021-03-26 00:48:30,229 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:30,229 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 16 [2021-03-26 00:48:30,230 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 225 flow [2021-03-26 00:48:30,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 00:48:30,230 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:30,230 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:30,230 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 00:48:30,230 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:30,231 INFO L82 PathProgramCache]: Analyzing trace with hash 144945359, now seen corresponding path program 1 times [2021-03-26 00:48:30,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:30,231 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448057725] [2021-03-26 00:48:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:30,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:30,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:30,289 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:30,298 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,299 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:48:30,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:30,316 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 00:48:30,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448057725] [2021-03-26 00:48:30,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:30,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:30,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817196668] [2021-03-26 00:48:30,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:30,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:30,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:30,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:30,317 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 142 [2021-03-26 00:48:30,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 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 00:48:30,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:30,318 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 142 [2021-03-26 00:48:30,318 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:30,378 INFO L129 PetriNetUnfolder]: 32/108 cut-off events. [2021-03-26 00:48:30,378 INFO L130 PetriNetUnfolder]: For 496/506 co-relation queries the response was YES. [2021-03-26 00:48:30,379 INFO L84 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 108 events. 32/108 cut-off events. For 496/506 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 482 event pairs, 7 based on Foata normal form. 5/108 useless extension candidates. Maximal degree in co-relation 496. Up to 69 conditions per place. [2021-03-26 00:48:30,379 INFO L132 encePairwiseOnDemand]: 136/142 looper letters, 15 selfloop transitions, 7 changer transitions 4/37 dead transitions. [2021-03-26 00:48:30,379 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 319 flow [2021-03-26 00:48:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:30,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:30,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 522 transitions. [2021-03-26 00:48:30,381 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7352112676056338 [2021-03-26 00:48:30,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 522 transitions. [2021-03-26 00:48:30,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 522 transitions. [2021-03-26 00:48:30,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:30,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 522 transitions. [2021-03-26 00:48:30,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.4) internal successors, (522), 5 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 00:48:30,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:30,384 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:30,384 INFO L185 Difference]: Start difference. First operand has 42 places, 31 transitions, 225 flow. Second operand 5 states and 522 transitions. [2021-03-26 00:48:30,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 319 flow [2021-03-26 00:48:30,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 312 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 00:48:30,386 INFO L241 Difference]: Finished difference. Result has 45 places, 31 transitions, 240 flow [2021-03-26 00:48:30,386 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2021-03-26 00:48:30,387 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2021-03-26 00:48:30,387 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:30,387 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 31 transitions, 240 flow [2021-03-26 00:48:30,387 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 31 transitions, 240 flow [2021-03-26 00:48:30,387 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 31 transitions, 240 flow [2021-03-26 00:48:30,397 INFO L129 PetriNetUnfolder]: 24/101 cut-off events. [2021-03-26 00:48:30,397 INFO L130 PetriNetUnfolder]: For 393/404 co-relation queries the response was YES. [2021-03-26 00:48:30,397 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 101 events. 24/101 cut-off events. For 393/404 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 478 event pairs, 7 based on Foata normal form. 3/98 useless extension candidates. Maximal degree in co-relation 415. Up to 42 conditions per place. [2021-03-26 00:48:30,398 INFO L142 LiptonReduction]: Number of co-enabled transitions 130 [2021-03-26 00:48:30,401 INFO L154 LiptonReduction]: Checked pairs total: 42 [2021-03-26 00:48:30,401 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:30,401 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 14 [2021-03-26 00:48:30,403 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 240 flow [2021-03-26 00:48:30,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 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 00:48:30,403 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:30,403 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:30,403 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 00:48:30,403 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:30,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:30,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1710612747, now seen corresponding path program 2 times [2021-03-26 00:48:30,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:30,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232087877] [2021-03-26 00:48:30,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:30,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 00:48:30,456 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:48:30,466 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:48:30,476 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,476 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-03-26 00:48:30,488 INFO L142 QuantifierPusher]: treesize reduction 4, result has 78.9 percent of original size [2021-03-26 00:48:30,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-26 00:48:30,497 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-26 00:48:30,499 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:48:30,507 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 00:48:30,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232087877] [2021-03-26 00:48:30,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:30,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 00:48:30,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628669454] [2021-03-26 00:48:30,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-03-26 00:48:30,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:30,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-03-26 00:48:30,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-03-26 00:48:30,509 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 142 [2021-03-26 00:48:30,509 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 240 flow. Second operand has 8 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 0 states have call successors, (0), 0 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 00:48:30,509 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:30,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 142 [2021-03-26 00:48:30,510 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:30,642 INFO L129 PetriNetUnfolder]: 163/341 cut-off events. [2021-03-26 00:48:30,643 INFO L130 PetriNetUnfolder]: For 1330/1342 co-relation queries the response was YES. [2021-03-26 00:48:30,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 341 events. 163/341 cut-off events. For 1330/1342 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1620 event pairs, 31 based on Foata normal form. 2/311 useless extension candidates. Maximal degree in co-relation 1392. Up to 260 conditions per place. [2021-03-26 00:48:30,644 INFO L132 encePairwiseOnDemand]: 135/142 looper letters, 15 selfloop transitions, 5 changer transitions 23/50 dead transitions. [2021-03-26 00:48:30,644 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 423 flow [2021-03-26 00:48:30,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:48:30,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:48:30,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 661 transitions. [2021-03-26 00:48:30,646 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6649899396378269 [2021-03-26 00:48:30,646 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 661 transitions. [2021-03-26 00:48:30,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 661 transitions. [2021-03-26 00:48:30,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:30,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 661 transitions. [2021-03-26 00:48:30,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 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 00:48:30,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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 00:48:30,649 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 142.0) internal successors, (1136), 8 states have internal predecessors, (1136), 0 states have call successors, (0), 0 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 00:48:30,649 INFO L185 Difference]: Start difference. First operand has 45 places, 31 transitions, 240 flow. Second operand 7 states and 661 transitions. [2021-03-26 00:48:30,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 423 flow [2021-03-26 00:48:30,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 401 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-26 00:48:30,652 INFO L241 Difference]: Finished difference. Result has 51 places, 23 transitions, 190 flow [2021-03-26 00:48:30,652 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=190, PETRI_PLACES=51, PETRI_TRANSITIONS=23} [2021-03-26 00:48:30,652 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 14 predicate places. [2021-03-26 00:48:30,652 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:30,652 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 23 transitions, 190 flow [2021-03-26 00:48:30,652 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 23 transitions, 190 flow [2021-03-26 00:48:30,653 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 23 transitions, 190 flow [2021-03-26 00:48:30,661 INFO L129 PetriNetUnfolder]: 26/86 cut-off events. [2021-03-26 00:48:30,661 INFO L130 PetriNetUnfolder]: For 606/620 co-relation queries the response was YES. [2021-03-26 00:48:30,662 INFO L84 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 86 events. 26/86 cut-off events. For 606/620 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 343 event pairs, 9 based on Foata normal form. 3/82 useless extension candidates. Maximal degree in co-relation 435. Up to 43 conditions per place. [2021-03-26 00:48:30,662 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-26 00:48:30,770 INFO L154 LiptonReduction]: Checked pairs total: 47 [2021-03-26 00:48:30,771 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 00:48:30,771 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 119 [2021-03-26 00:48:30,771 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 23 transitions, 202 flow [2021-03-26 00:48:30,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 89.875) internal successors, (719), 8 states have internal predecessors, (719), 0 states have call successors, (0), 0 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 00:48:30,771 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:30,771 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:30,771 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 00:48:30,772 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:30,772 INFO L82 PathProgramCache]: Analyzing trace with hash 146156219, now seen corresponding path program 3 times [2021-03-26 00:48:30,772 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:30,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98754416] [2021-03-26 00:48:30,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:30,815 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,816 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:30,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:30,822 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 00:48:30,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 00:48:30,843 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:30,843 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:30,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 00:48:30,884 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98754416] [2021-03-26 00:48:30,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:30,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:30,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848831314] [2021-03-26 00:48:30,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 00:48:30,885 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:30,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 00:48:30,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-26 00:48:30,887 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 143 [2021-03-26 00:48:30,887 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 23 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 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 00:48:30,887 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:30,887 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 143 [2021-03-26 00:48:30,887 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:30,986 INFO L129 PetriNetUnfolder]: 30/110 cut-off events. [2021-03-26 00:48:30,986 INFO L130 PetriNetUnfolder]: For 1072/1083 co-relation queries the response was YES. [2021-03-26 00:48:30,986 INFO L84 FinitePrefix]: Finished finitePrefix Result has 641 conditions, 110 events. 30/110 cut-off events. For 1072/1083 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 511 event pairs, 12 based on Foata normal form. 9/114 useless extension candidates. Maximal degree in co-relation 616. Up to 56 conditions per place. [2021-03-26 00:48:30,987 INFO L132 encePairwiseOnDemand]: 135/143 looper letters, 8 selfloop transitions, 8 changer transitions 0/25 dead transitions. [2021-03-26 00:48:30,987 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 25 transitions, 252 flow [2021-03-26 00:48:31,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2021-03-26 00:48:31,001 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7258741258741259 [2021-03-26 00:48:31,001 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2021-03-26 00:48:31,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2021-03-26 00:48:31,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:31,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2021-03-26 00:48:31,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 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 00:48:31,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 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 00:48:31,003 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 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 00:48:31,003 INFO L185 Difference]: Start difference. First operand has 44 places, 23 transitions, 202 flow. Second operand 5 states and 519 transitions. [2021-03-26 00:48:31,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 25 transitions, 252 flow [2021-03-26 00:48:31,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 25 transitions, 226 flow, removed 4 selfloop flow, removed 7 redundant places. [2021-03-26 00:48:31,005 INFO L241 Difference]: Finished difference. Result has 42 places, 24 transitions, 213 flow [2021-03-26 00:48:31,005 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2021-03-26 00:48:31,005 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2021-03-26 00:48:31,005 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:31,005 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 24 transitions, 213 flow [2021-03-26 00:48:31,005 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 213 flow [2021-03-26 00:48:31,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 24 transitions, 213 flow [2021-03-26 00:48:31,015 INFO L129 PetriNetUnfolder]: 26/102 cut-off events. [2021-03-26 00:48:31,015 INFO L130 PetriNetUnfolder]: For 592/630 co-relation queries the response was YES. [2021-03-26 00:48:31,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 544 conditions, 102 events. 26/102 cut-off events. For 592/630 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 468 event pairs, 10 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 524. Up to 51 conditions per place. [2021-03-26 00:48:31,024 INFO L142 LiptonReduction]: Number of co-enabled transitions 78 [2021-03-26 00:48:31,026 INFO L154 LiptonReduction]: Checked pairs total: 23 [2021-03-26 00:48:31,026 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:31,026 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 00:48:31,028 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 213 flow [2021-03-26 00:48:31,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 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 00:48:31,028 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:31,028 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:31,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 00:48:31,028 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:31,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:31,028 INFO L82 PathProgramCache]: Analyzing trace with hash -176370121, now seen corresponding path program 1 times [2021-03-26 00:48:31,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:31,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430838016] [2021-03-26 00:48:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:31,065 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:31,065 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:31,068 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:48:31,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:31,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:31,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:31,073 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 00:48:31,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430838016] [2021-03-26 00:48:31,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:31,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 00:48:31,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666335683] [2021-03-26 00:48:31,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 00:48:31,074 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:31,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 00:48:31,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 00:48:31,075 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 143 [2021-03-26 00:48:31,075 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 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 00:48:31,075 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:31,075 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 143 [2021-03-26 00:48:31,075 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:31,101 INFO L129 PetriNetUnfolder]: 39/142 cut-off events. [2021-03-26 00:48:31,101 INFO L130 PetriNetUnfolder]: For 873/893 co-relation queries the response was YES. [2021-03-26 00:48:31,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 142 events. 39/142 cut-off events. For 873/893 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 733 event pairs, 11 based on Foata normal form. 38/179 useless extension candidates. Maximal degree in co-relation 628. Up to 72 conditions per place. [2021-03-26 00:48:31,102 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 5 selfloop transitions, 5 changer transitions 3/31 dead transitions. [2021-03-26 00:48:31,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 265 flow [2021-03-26 00:48:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2021-03-26 00:48:31,104 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8167832167832167 [2021-03-26 00:48:31,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2021-03-26 00:48:31,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2021-03-26 00:48:31,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:31,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2021-03-26 00:48:31,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 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 00:48:31,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 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 00:48:31,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 143.0) internal successors, (858), 6 states have internal predecessors, (858), 0 states have call successors, (0), 0 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 00:48:31,106 INFO L185 Difference]: Start difference. First operand has 42 places, 24 transitions, 213 flow. Second operand 5 states and 584 transitions. [2021-03-26 00:48:31,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 265 flow [2021-03-26 00:48:31,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 31 transitions, 236 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-26 00:48:31,108 INFO L241 Difference]: Finished difference. Result has 45 places, 28 transitions, 229 flow [2021-03-26 00:48:31,108 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2021-03-26 00:48:31,109 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2021-03-26 00:48:31,109 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:31,109 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 28 transitions, 229 flow [2021-03-26 00:48:31,109 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 28 transitions, 229 flow [2021-03-26 00:48:31,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 28 transitions, 229 flow [2021-03-26 00:48:31,119 INFO L129 PetriNetUnfolder]: 27/122 cut-off events. [2021-03-26 00:48:31,119 INFO L130 PetriNetUnfolder]: For 569/590 co-relation queries the response was YES. [2021-03-26 00:48:31,119 INFO L84 FinitePrefix]: Finished finitePrefix Result has 568 conditions, 122 events. 27/122 cut-off events. For 569/590 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 631 event pairs, 9 based on Foata normal form. 12/132 useless extension candidates. Maximal degree in co-relation 546. Up to 46 conditions per place. [2021-03-26 00:48:31,120 INFO L142 LiptonReduction]: Number of co-enabled transitions 80 [2021-03-26 00:48:31,121 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 00:48:31,121 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 00:48:31,121 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-26 00:48:31,122 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 229 flow [2021-03-26 00:48:31,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 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 00:48:31,122 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:31,122 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:31,123 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 00:48:31,123 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:31,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:31,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1783877691, now seen corresponding path program 1 times [2021-03-26 00:48:31,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:31,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076749910] [2021-03-26 00:48:31,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:31,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:31,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:31,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:31,152 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:31,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 00:48:31,156 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 00:48:31,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 00:48:31,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:31,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 00:48:31,162 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 00:48:31,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076749910] [2021-03-26 00:48:31,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:31,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 00:48:31,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631635695] [2021-03-26 00:48:31,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 00:48:31,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:31,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 00:48:31,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 00:48:31,163 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 143 [2021-03-26 00:48:31,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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 00:48:31,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:31,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 143 [2021-03-26 00:48:31,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:31,196 INFO L129 PetriNetUnfolder]: 14/87 cut-off events. [2021-03-26 00:48:31,196 INFO L130 PetriNetUnfolder]: For 460/547 co-relation queries the response was YES. [2021-03-26 00:48:31,197 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 87 events. 14/87 cut-off events. For 460/547 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 411 event pairs, 2 based on Foata normal form. 72/158 useless extension candidates. Maximal degree in co-relation 383. Up to 42 conditions per place. [2021-03-26 00:48:31,197 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 3 selfloop transitions, 8 changer transitions 5/30 dead transitions. [2021-03-26 00:48:31,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 30 transitions, 261 flow [2021-03-26 00:48:31,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 00:48:31,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 00:48:31,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 812 transitions. [2021-03-26 00:48:31,199 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8111888111888111 [2021-03-26 00:48:31,199 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 812 transitions. [2021-03-26 00:48:31,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 812 transitions. [2021-03-26 00:48:31,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:31,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 812 transitions. [2021-03-26 00:48:31,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.0) internal successors, (812), 7 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 00:48:31,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 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 00:48:31,202 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 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 00:48:31,202 INFO L185 Difference]: Start difference. First operand has 45 places, 28 transitions, 229 flow. Second operand 7 states and 812 transitions. [2021-03-26 00:48:31,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 30 transitions, 261 flow [2021-03-26 00:48:31,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 30 transitions, 234 flow, removed 12 selfloop flow, removed 1 redundant places. [2021-03-26 00:48:31,203 INFO L241 Difference]: Finished difference. Result has 53 places, 25 transitions, 210 flow [2021-03-26 00:48:31,203 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=210, PETRI_PLACES=53, PETRI_TRANSITIONS=25} [2021-03-26 00:48:31,203 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 16 predicate places. [2021-03-26 00:48:31,204 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:31,204 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 25 transitions, 210 flow [2021-03-26 00:48:31,204 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 25 transitions, 210 flow [2021-03-26 00:48:31,205 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 25 transitions, 210 flow [2021-03-26 00:48:31,210 INFO L129 PetriNetUnfolder]: 5/40 cut-off events. [2021-03-26 00:48:31,210 INFO L130 PetriNetUnfolder]: For 162/172 co-relation queries the response was YES. [2021-03-26 00:48:31,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 40 events. 5/40 cut-off events. For 162/172 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 112 event pairs, 1 based on Foata normal form. 4/44 useless extension candidates. Maximal degree in co-relation 167. Up to 18 conditions per place. [2021-03-26 00:48:31,211 INFO L142 LiptonReduction]: Number of co-enabled transitions 48 [2021-03-26 00:48:31,794 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 178 [2021-03-26 00:48:32,036 WARN L205 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-26 00:48:33,767 WARN L205 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 332 DAG size of output: 258 [2021-03-26 00:48:34,245 WARN L205 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-03-26 00:48:34,781 WARN L205 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 178 [2021-03-26 00:48:34,975 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-26 00:48:36,199 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 332 DAG size of output: 254 [2021-03-26 00:48:36,649 WARN L205 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 00:48:36,762 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-03-26 00:48:37,009 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2021-03-26 00:48:37,104 INFO L154 LiptonReduction]: Checked pairs total: 12 [2021-03-26 00:48:37,104 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 00:48:37,104 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5900 [2021-03-26 00:48:37,105 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 23 transitions, 217 flow [2021-03-26 00:48:37,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 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 00:48:37,105 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:37,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:37,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 00:48:37,105 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:37,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:37,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1851553179, now seen corresponding path program 1 times [2021-03-26 00:48:37,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:37,105 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099716339] [2021-03-26 00:48:37,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 00:48:37,138 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:37,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 00:48:37,144 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:37,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-26 00:48:37,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:37,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 00:48:37,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:37,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 00:48:37,195 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 00:48:37,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-26 00:48:37,204 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 00:48:37,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099716339] [2021-03-26 00:48:37,204 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 00:48:37,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 00:48:37,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870094110] [2021-03-26 00:48:37,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 00:48:37,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 00:48:37,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 00:48:37,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 00:48:37,206 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 148 [2021-03-26 00:48:37,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 23 transitions, 217 flow. Second operand has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 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 00:48:37,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 00:48:37,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 148 [2021-03-26 00:48:37,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 00:48:37,253 INFO L129 PetriNetUnfolder]: 4/36 cut-off events. [2021-03-26 00:48:37,253 INFO L130 PetriNetUnfolder]: For 195/203 co-relation queries the response was YES. [2021-03-26 00:48:37,253 INFO L84 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 36 events. 4/36 cut-off events. For 195/203 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 94 event pairs, 1 based on Foata normal form. 6/41 useless extension candidates. Maximal degree in co-relation 169. Up to 17 conditions per place. [2021-03-26 00:48:37,253 INFO L132 encePairwiseOnDemand]: 142/148 looper letters, 4 selfloop transitions, 4 changer transitions 3/22 dead transitions. [2021-03-26 00:48:37,253 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 22 transitions, 222 flow [2021-03-26 00:48:37,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 00:48:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 00:48:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2021-03-26 00:48:37,255 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2021-03-26 00:48:37,255 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 520 transitions. [2021-03-26 00:48:37,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 520 transitions. [2021-03-26 00:48:37,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 00:48:37,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 520 transitions. [2021-03-26 00:48:37,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 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 00:48:37,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 0 states have call successors, (0), 0 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 00:48:37,257 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 148.0) internal successors, (888), 6 states have internal predecessors, (888), 0 states have call successors, (0), 0 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 00:48:37,257 INFO L185 Difference]: Start difference. First operand has 49 places, 23 transitions, 217 flow. Second operand 5 states and 520 transitions. [2021-03-26 00:48:37,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 22 transitions, 222 flow [2021-03-26 00:48:37,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 22 transitions, 164 flow, removed 11 selfloop flow, removed 13 redundant places. [2021-03-26 00:48:37,258 INFO L241 Difference]: Finished difference. Result has 40 places, 19 transitions, 131 flow [2021-03-26 00:48:37,258 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=148, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=40, PETRI_TRANSITIONS=19} [2021-03-26 00:48:37,258 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2021-03-26 00:48:37,258 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 00:48:37,258 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 19 transitions, 131 flow [2021-03-26 00:48:37,259 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 19 transitions, 131 flow [2021-03-26 00:48:37,259 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 19 transitions, 131 flow [2021-03-26 00:48:37,261 INFO L129 PetriNetUnfolder]: 3/23 cut-off events. [2021-03-26 00:48:37,261 INFO L130 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2021-03-26 00:48:37,261 INFO L84 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 23 events. 3/23 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 32 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 79. Up to 8 conditions per place. [2021-03-26 00:48:37,262 INFO L142 LiptonReduction]: Number of co-enabled transitions 20 [2021-03-26 00:48:37,437 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 00:48:37,847 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-26 00:48:37,967 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 00:48:38,222 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 00:48:38,454 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-26 00:48:38,994 WARN L205 SmtUtils]: Spent 537.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 00:48:39,495 WARN L205 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-26 00:48:39,499 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 00:48:39,499 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 00:48:39,499 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2241 [2021-03-26 00:48:39,502 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 16 transitions, 122 flow [2021-03-26 00:48:39,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 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 00:48:39,502 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 00:48:39,503 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 00:48:39,503 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 00:48:39,503 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 00:48:39,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 00:48:39,503 INFO L82 PathProgramCache]: Analyzing trace with hash 930390795, now seen corresponding path program 1 times [2021-03-26 00:48:39,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 00:48:39,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841139199] [2021-03-26 00:48:39,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 00:48:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:48:39,560 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:48:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 00:48:39,588 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 00:48:39,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 00:48:39,615 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 00:48:39,615 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 00:48:39,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 12:48:39 BasicIcfg [2021-03-26 00:48:39,678 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 00:48:39,678 INFO L168 Benchmark]: Toolchain (without parser) took 26301.18 ms. Allocated memory was 371.2 MB in the beginning and 964.7 MB in the end (delta: 593.5 MB). Free memory was 334.3 MB in the beginning and 673.6 MB in the end (delta: -339.3 MB). Peak memory consumption was 257.2 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:39,678 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 371.2 MB. Free memory was 352.3 MB in the beginning and 352.3 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 00:48:39,678 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.19 ms. Allocated memory is still 371.2 MB. Free memory was 334.2 MB in the beginning and 331.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:39,678 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.61 ms. Allocated memory is still 371.2 MB. Free memory was 331.7 MB in the beginning and 328.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:39,679 INFO L168 Benchmark]: Boogie Preprocessor took 44.94 ms. Allocated memory is still 371.2 MB. Free memory was 328.6 MB in the beginning and 326.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:39,679 INFO L168 Benchmark]: RCFGBuilder took 1258.47 ms. Allocated memory is still 371.2 MB. Free memory was 326.5 MB in the beginning and 312.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 167.1 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:39,679 INFO L168 Benchmark]: TraceAbstraction took 24507.32 ms. Allocated memory was 371.2 MB in the beginning and 964.7 MB in the end (delta: 593.5 MB). Free memory was 312.5 MB in the beginning and 673.6 MB in the end (delta: -361.2 MB). Peak memory consumption was 233.4 MB. Max. memory is 16.0 GB. [2021-03-26 00:48:39,680 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.14 ms. Allocated memory is still 371.2 MB. Free memory was 352.3 MB in the beginning and 352.3 MB in the end (delta: 71.0 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 421.19 ms. Allocated memory is still 371.2 MB. Free memory was 334.2 MB in the beginning and 331.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 6.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.61 ms. Allocated memory is still 371.2 MB. Free memory was 331.7 MB in the beginning and 328.6 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 44.94 ms. Allocated memory is still 371.2 MB. Free memory was 328.6 MB in the beginning and 326.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1258.47 ms. Allocated memory is still 371.2 MB. Free memory was 326.5 MB in the beginning and 312.5 MB in the end (delta: 14.0 MB). Peak memory consumption was 167.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 24507.32 ms. Allocated memory was 371.2 MB in the beginning and 964.7 MB in the end (delta: 593.5 MB). Free memory was 312.5 MB in the beginning and 673.6 MB in the end (delta: -361.2 MB). Peak memory consumption was 233.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6477.6ms, 82 PlacesBefore, 37 PlacesAfterwards, 77 TransitionsBefore, 31 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 5 FixpointIterations, 24 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 53 TotalNumberOfCompositions, 1657 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 809, positive: 743, positive conditional: 743, positive unconditional: 0, negative: 66, negative conditional: 66, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 624, positive: 593, positive conditional: 0, positive unconditional: 593, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 624, positive: 593, positive conditional: 0, positive unconditional: 593, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 624, positive: 591, positive conditional: 0, positive unconditional: 591, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 429, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 424, negative conditional: 0, negative unconditional: 424, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 809, positive: 150, positive conditional: 150, positive unconditional: 0, negative: 35, negative conditional: 35, negative unconditional: 0, unknown: 624, unknown conditional: 624, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 38, Positive cache size: 22, Positive conditional cache size: 22, Positive unconditional cache size: 0, Negative cache size: 16, Negative conditional cache size: 16, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2679.6ms, 35 PlacesBefore, 25 PlacesAfterwards, 24 TransitionsBefore, 18 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 5 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 448 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 49, negative conditional: 49, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 34, positive conditional: 6, positive unconditional: 28, negative: 13, negative conditional: 3, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 47, positive: 34, positive conditional: 6, positive unconditional: 28, negative: 13, negative conditional: 3, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 47, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 13, negative conditional: 3, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 158, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 146, negative conditional: 36, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, positive: 89, positive conditional: 89, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 47, unknown conditional: 47, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 45, Positive conditional cache size: 45, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 952.4ms, 26 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 342 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 123, positive: 87, positive conditional: 87, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 5, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 5, positive unconditional: 5, 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: 123, positive: 77, positive conditional: 77, positive unconditional: 0, negative: 36, negative conditional: 36, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 55, Positive conditional cache size: 55, Positive unconditional cache size: 0, Negative cache size: 22, Negative conditional cache size: 22, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.7ms, 26 PlacesBefore, 26 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 72 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 13, positive conditional: 13, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 1, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 2, positive conditional: 1, positive unconditional: 1, 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: 3, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 30, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 57, Positive conditional cache size: 57, Positive unconditional cache size: 0, Negative cache size: 23, Negative conditional cache size: 23, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 44.3ms, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 32 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 3, positive unconditional: 5, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 1, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 28, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 24, negative conditional: 4, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 10, unknown conditional: 10, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 65, Positive conditional cache size: 65, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.9ms, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 34 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 19, positive conditional: 19, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 4, 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: 7, positive: 7, positive conditional: 0, positive unconditional: 7, 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: 22, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 7, unknown conditional: 7, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 72, Positive conditional cache size: 72, Positive unconditional cache size: 0, Negative cache size: 25, Negative conditional cache size: 25, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 748.5ms, 39 PlacesBefore, 39 PlacesAfterwards, 33 TransitionsBefore, 33 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 91 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 26, positive conditional: 26, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 7, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 18, positive conditional: 18, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 68, Positive conditional cache size: 68, Positive unconditional cache size: 0, Negative cache size: 17, Negative conditional cache size: 17, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2353.6ms, 42 PlacesBefore, 42 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 110 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 8, 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: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 42, positive: 28, positive conditional: 28, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 66, Positive conditional cache size: 66, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.2ms, 45 PlacesBefore, 45 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 172 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 54 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 16, positive conditional: 16, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 1, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 5, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 20, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 74, Positive conditional cache size: 74, Positive unconditional cache size: 0, Negative cache size: 12, Negative conditional cache size: 12, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.7ms, 43 PlacesBefore, 42 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 71 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 20, positive conditional: 20, positive unconditional: 0, negative: 7, negative conditional: 7, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 6, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 8, positive conditional: 6, positive unconditional: 2, 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: 9, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 82, Positive conditional cache size: 82, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.1ms, 45 PlacesBefore, 45 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 130 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 10, positive conditional: 10, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 4, negative conditional: 4, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 85, Positive conditional cache size: 85, Positive unconditional cache size: 0, Negative cache size: 13, Negative conditional cache size: 13, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 118.1ms, 51 PlacesBefore, 44 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 47 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 7, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 3, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 14, positive: 11, positive conditional: 11, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13, positive: 3, positive conditional: 3, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 5, unknown conditional: 5, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 72, Positive conditional cache size: 72, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.8ms, 42 PlacesBefore, 42 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 78 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 23 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 72, Positive conditional cache size: 72, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 80 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 83, Positive cache size: 72, Positive conditional cache size: 72, Positive unconditional cache size: 0, Negative cache size: 11, Negative conditional cache size: 11, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5900.4ms, 53 PlacesBefore, 49 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 48 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 12 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 12, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 6, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 31, Positive cache size: 24, Positive conditional cache size: 24, Positive unconditional cache size: 0, Negative cache size: 7, Negative conditional cache size: 7, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2240.7ms, 40 PlacesBefore, 39 PlacesAfterwards, 19 TransitionsBefore, 16 TransitionsAfterwards, 20 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 9, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 9, unknown conditional: 9, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6, Positive cache size: 5, Positive conditional cache size: 5, Positive unconditional cache size: 0, Negative cache size: 1, Negative conditional cache size: 1, Negative unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2479; [L791] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2480; [L793] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 24372.5ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1165.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6527.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 61 SDtfs, 59 SDslu, 40 SDs, 0 SdLazy, 432 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 408.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 432.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=265occurred in iteration=8, InterpolantAutomatonStates: 71, 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: 36.6ms SsaConstructionTime, 319.5ms SatisfiabilityAnalysisTime, 864.9ms InterpolantComputationTime, 175 NumberOfCodeBlocks, 175 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 1235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...