/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:26:08,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:26:08,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:26:08,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:26:08,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:26:08,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:26:08,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:26:08,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:26:08,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:26:08,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:26:08,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:26:08,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:26:08,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:26:08,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:26:08,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:26:08,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:26:08,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:26:08,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:26:08,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:26:08,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:26:08,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:26:08,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:26:08,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:26:08,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:26:08,247 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:26:08,247 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:26:08,247 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:26:08,249 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:26:08,249 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:26:08,250 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:26:08,250 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:26:08,251 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:26:08,252 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:26:08,253 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:26:08,254 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:26:08,254 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:26:08,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:26:08,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:26:08,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:26:08,256 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:26:08,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:26:08,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:26:08,294 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:26:08,295 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:26:08,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:26:08,298 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:26:08,298 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:26:08,298 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:26:08,299 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:26:08,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:26:08,299 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:26:08,299 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:26:08,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:26:08,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:26:08,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:26:08,300 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:26:08,300 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:26:08,301 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:26:08,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:26:08,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:26:08,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:26:08,301 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:26:08,301 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:26:08,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:26:08,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:26:08,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:26:08,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:26:08,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:26:08,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:26:08,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:26:08,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:26:08,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:26:08,303 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:26:08,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:26:08,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:26:08,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:26:08,604 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:26:08,604 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:26:08,605 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-03-26 10:26:08,657 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c709106c1/e935b1061a2a41c882e202105aaffe2c/FLAGea30842c6 [2021-03-26 10:26:09,138 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:26:09,138 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2021-03-26 10:26:09,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c709106c1/e935b1061a2a41c882e202105aaffe2c/FLAGea30842c6 [2021-03-26 10:26:09,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c709106c1/e935b1061a2a41c882e202105aaffe2c [2021-03-26 10:26:09,638 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:26:09,640 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:26:09,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:26:09,641 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:26:09,651 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:26:09,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:26:09" (1/1) ... [2021-03-26 10:26:09,652 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9c7ea80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:09, skipping insertion in model container [2021-03-26 10:26:09,652 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:26:09" (1/1) ... [2021-03-26 10:26:09,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:26:09,707 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:26:09,808 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/safe001_pso.oepc.i[950,963] [2021-03-26 10:26:10,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:26:10,036 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:26:10,048 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/safe001_pso.oepc.i[950,963] [2021-03-26 10:26:10,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:26:10,181 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:26:10,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10 WrapperNode [2021-03-26 10:26:10,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:26:10,184 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:26:10,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:26:10,184 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:26:10,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:26:10,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:26:10,262 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:26:10,262 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:26:10,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,309 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... [2021-03-26 10:26:10,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:26:10,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:26:10,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:26:10,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:26:10,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:26:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:26:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:26:10,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:26:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:26:10,388 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:26:10,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:26:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:26:10,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:26:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:26:10,389 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:26:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:26:10,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:26:10,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:26:10,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:26:10,391 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:26:11,968 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:26:11,968 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:26:11,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:26:11 BoogieIcfgContainer [2021-03-26 10:26:11,971 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:26:11,972 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:26:11,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:26:11,974 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:26:11,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:26:09" (1/3) ... [2021-03-26 10:26:11,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b432f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:26:11, skipping insertion in model container [2021-03-26 10:26:11,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:26:10" (2/3) ... [2021-03-26 10:26:11,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b432f72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:26:11, skipping insertion in model container [2021-03-26 10:26:11,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:26:11" (3/3) ... [2021-03-26 10:26:11,977 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2021-03-26 10:26:11,985 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:26:11,989 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:26:11,989 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:26:12,023 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,024 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,024 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,025 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,025 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,026 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,027 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,028 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,029 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,029 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,029 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,029 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,030 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,030 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,030 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,030 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,031 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,031 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,031 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,032 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,033 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,034 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,035 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,035 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,035 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,036 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,036 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,036 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,037 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,038 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,039 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,040 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,042 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,043 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,044 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,047 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,049 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,050 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,055 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,057 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,058 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:26:12,059 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:26:12,074 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:26:12,091 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:26:12,091 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:26:12,091 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:26:12,092 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:26:12,092 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:26:12,092 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:26:12,092 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:26:12,092 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:26:12,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:26:12,151 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:26:12,151 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:12,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:26:12,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-03-26 10:26:12,168 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-03-26 10:26:12,170 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:12,185 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:26:12,190 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-03-26 10:26:12,193 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-03-26 10:26:12,221 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-03-26 10:26:12,222 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:12,222 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-03-26 10:26:12,226 INFO L142 LiptonReduction]: Number of co-enabled transitions 1686 [2021-03-26 10:26:14,077 WARN L205 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-26 10:26:14,673 WARN L205 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-26 10:26:15,993 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:26:16,553 WARN L205 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:26:16,713 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:26:17,111 WARN L205 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-26 10:26:17,243 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-26 10:26:18,399 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:26:18,705 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:26:19,297 WARN L205 SmtUtils]: Spent 590.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:26:19,909 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:26:20,072 INFO L154 LiptonReduction]: Checked pairs total: 2882 [2021-03-26 10:26:20,072 INFO L156 LiptonReduction]: Total number of compositions: 64 [2021-03-26 10:26:20,075 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7906 [2021-03-26 10:26:20,083 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2021-03-26 10:26:20,084 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:20,084 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:20,084 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:20,085 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:20,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:20,089 INFO L82 PathProgramCache]: Analyzing trace with hash 788348067, now seen corresponding path program 1 times [2021-03-26 10:26:20,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:20,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812930232] [2021-03-26 10:26:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:20,266 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:20,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:20,269 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:20,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:20,285 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812930232] [2021-03-26 10:26:20,286 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:20,286 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:26:20,286 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601298413] [2021-03-26 10:26:20,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:26:20,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:20,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:26:20,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:26:20,307 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2021-03-26 10:26:20,309 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:20,309 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:20,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2021-03-26 10:26:20,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:20,398 INFO L129 PetriNetUnfolder]: 69/198 cut-off events. [2021-03-26 10:26:20,398 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:20,399 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 198 events. 69/198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 921 event pairs, 39 based on Foata normal form. 11/192 useless extension candidates. Maximal degree in co-relation 307. Up to 89 conditions per place. [2021-03-26 10:26:20,401 INFO L132 encePairwiseOnDemand]: 157/161 looper letters, 9 selfloop transitions, 2 changer transitions 5/41 dead transitions. [2021-03-26 10:26:20,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 117 flow [2021-03-26 10:26:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:26:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:26:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2021-03-26 10:26:20,412 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902691511387164 [2021-03-26 10:26:20,413 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2021-03-26 10:26:20,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2021-03-26 10:26:20,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:20,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2021-03-26 10:26:20,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:20,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:20,427 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 161.0) internal successors, (644), 4 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:20,428 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 430 transitions. [2021-03-26 10:26:20,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 117 flow [2021-03-26 10:26:20,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:26:20,432 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-26 10:26:20,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-26 10:26:20,434 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 10:26:20,434 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:20,434 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 10:26:20,435 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-26 10:26:20,435 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-26 10:26:20,440 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-26 10:26:20,440 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:20,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:26:20,440 INFO L142 LiptonReduction]: Number of co-enabled transitions 264 [2021-03-26 10:26:20,957 WARN L205 SmtUtils]: Spent 342.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:26:21,249 WARN L205 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:26:21,832 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:26:22,399 WARN L205 SmtUtils]: Spent 565.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-26 10:26:23,083 INFO L154 LiptonReduction]: Checked pairs total: 1242 [2021-03-26 10:26:23,083 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 10:26:23,083 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2649 [2021-03-26 10:26:23,084 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2021-03-26 10:26:23,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:23,085 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:23,085 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:23,085 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:26:23,085 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:23,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1851944499, now seen corresponding path program 1 times [2021-03-26 10:26:23,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:23,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040986808] [2021-03-26 10:26:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:23,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:23,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:23,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:23,257 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:23,258 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:23,265 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:26:23,265 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:26:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:23,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040986808] [2021-03-26 10:26:23,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:23,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:26:23,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515753778] [2021-03-26 10:26:23,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:26:23,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:23,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:26:23,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:26:23,271 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 169 [2021-03-26 10:26:23,271 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:23,271 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:23,271 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 169 [2021-03-26 10:26:23,271 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:23,285 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:26:23,285 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:26:23,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 38 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:26:23,285 INFO L132 encePairwiseOnDemand]: 166/169 looper letters, 1 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2021-03-26 10:26:23,285 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 64 flow [2021-03-26 10:26:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:26:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:26:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2021-03-26 10:26:23,288 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8777120315581854 [2021-03-26 10:26:23,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2021-03-26 10:26:23,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2021-03-26 10:26:23,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:23,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2021-03-26 10:26:23,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:23,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:23,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 169.0) internal successors, (676), 4 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:23,292 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 3 states and 445 transitions. [2021-03-26 10:26:23,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 64 flow [2021-03-26 10:26:23,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 60 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:26:23,293 INFO L241 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2021-03-26 10:26:23,293 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2021-03-26 10:26:23,294 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:26:23,294 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:23,294 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 10:26:23,295 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 23 transitions, 60 flow [2021-03-26 10:26:23,295 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 60 flow [2021-03-26 10:26:23,298 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2021-03-26 10:26:23,299 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:26:23,299 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 23 events. 0/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:26:23,299 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-26 10:26:23,846 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:26:23,961 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:26:24,209 WARN L205 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-26 10:26:24,322 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-26 10:26:24,325 INFO L154 LiptonReduction]: Checked pairs total: 777 [2021-03-26 10:26:24,325 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:26:24,326 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1032 [2021-03-26 10:26:24,326 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-26 10:26:24,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,327 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:24,327 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:24,327 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:26:24,327 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1192546168, now seen corresponding path program 1 times [2021-03-26 10:26:24,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:24,328 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23585824] [2021-03-26 10:26:24,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:24,414 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:24,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:24,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:24,415 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:24,418 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:24,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:24,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:24,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23585824] [2021-03-26 10:26:24,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:24,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:26:24,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53808492] [2021-03-26 10:26:24,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:26:24,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:24,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:26:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:26:24,424 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-26 10:26:24,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,425 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:24,425 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-26 10:26:24,425 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:24,491 INFO L129 PetriNetUnfolder]: 13/71 cut-off events. [2021-03-26 10:26:24,491 INFO L130 PetriNetUnfolder]: For 14/18 co-relation queries the response was YES. [2021-03-26 10:26:24,491 INFO L84 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 71 events. 13/71 cut-off events. For 14/18 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 272 event pairs, 3 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 117. Up to 15 conditions per place. [2021-03-26 10:26:24,492 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 5 selfloop transitions, 3 changer transitions 4/27 dead transitions. [2021-03-26 10:26:24,492 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 27 transitions, 95 flow [2021-03-26 10:26:24,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:26:24,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:26:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2021-03-26 10:26:24,495 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391812865497076 [2021-03-26 10:26:24,495 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2021-03-26 10:26:24,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2021-03-26 10:26:24,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:24,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2021-03-26 10:26:24,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 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 10:26:24,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,505 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 171.0) internal successors, (855), 5 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,505 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 4 states and 574 transitions. [2021-03-26 10:26:24,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 27 transitions, 95 flow [2021-03-26 10:26:24,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 89 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:26:24,507 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,507 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 10:26:24,507 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:26:24,507 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:24,507 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,508 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,508 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,511 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 10:26:24,511 INFO L130 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2021-03-26 10:26:24,511 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 25 events. 1/25 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2021-03-26 10:26:24,512 INFO L142 LiptonReduction]: Number of co-enabled transitions 192 [2021-03-26 10:26:24,711 INFO L154 LiptonReduction]: Checked pairs total: 199 [2021-03-26 10:26:24,711 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:26:24,711 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 204 [2021-03-26 10:26:24,712 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,713 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:24,713 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:24,713 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:26:24,713 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:24,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:24,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1360024109, now seen corresponding path program 1 times [2021-03-26 10:26:24,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:24,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593014754] [2021-03-26 10:26:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:24,785 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:24,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:24,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593014754] [2021-03-26 10:26:24,789 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:24,789 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:26:24,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790792882] [2021-03-26 10:26:24,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:26:24,789 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:26:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:26:24,791 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 171 [2021-03-26 10:26:24,791 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,792 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:24,792 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 171 [2021-03-26 10:26:24,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:24,804 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 10:26:24,805 INFO L130 PetriNetUnfolder]: For 19/19 co-relation queries the response was YES. [2021-03-26 10:26:24,805 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 25 events. 1/25 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 1 based on Foata normal form. 2/27 useless extension candidates. Maximal degree in co-relation 43. Up to 6 conditions per place. [2021-03-26 10:26:24,805 INFO L132 encePairwiseOnDemand]: 168/171 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-26 10:26:24,805 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 21 transitions, 74 flow [2021-03-26 10:26:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:26:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:26:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-03-26 10:26:24,809 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8966861598440545 [2021-03-26 10:26:24,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-03-26 10:26:24,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-03-26 10:26:24,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:24,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-03-26 10:26:24,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,812 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 171.0) internal successors, (684), 4 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,812 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 68 flow. Second operand 3 states and 460 transitions. [2021-03-26 10:26:24,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 21 transitions, 74 flow [2021-03-26 10:26:24,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 21 transitions, 66 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:26:24,813 INFO L241 Difference]: Finished difference. Result has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,814 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=21} [2021-03-26 10:26:24,814 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -14 predicate places. [2021-03-26 10:26:24,814 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:24,814 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,814 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,815 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,818 INFO L129 PetriNetUnfolder]: 1/25 cut-off events. [2021-03-26 10:26:24,818 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:26:24,819 INFO L84 FinitePrefix]: Finished finitePrefix Result has 50 conditions, 25 events. 1/25 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 28 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 40. Up to 6 conditions per place. [2021-03-26 10:26:24,819 INFO L142 LiptonReduction]: Number of co-enabled transitions 190 [2021-03-26 10:26:24,820 INFO L154 LiptonReduction]: Checked pairs total: 184 [2021-03-26 10:26:24,820 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:26:24,821 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-26 10:26:24,821 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 21 transitions, 68 flow [2021-03-26 10:26:24,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,822 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:24,822 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:24,822 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:26:24,822 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:24,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:24,822 INFO L82 PathProgramCache]: Analyzing trace with hash 799765819, now seen corresponding path program 1 times [2021-03-26 10:26:24,823 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:24,823 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198240905] [2021-03-26 10:26:24,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:24,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:24,911 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:24,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:24,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:24,913 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:24,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:24,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:24,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:24,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198240905] [2021-03-26 10:26:24,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:24,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:26:24,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467092392] [2021-03-26 10:26:24,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:26:24,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:24,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:26:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:26:24,932 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2021-03-26 10:26:24,933 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 21 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,933 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:24,933 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2021-03-26 10:26:24,933 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:24,969 INFO L129 PetriNetUnfolder]: 2/42 cut-off events. [2021-03-26 10:26:24,969 INFO L130 PetriNetUnfolder]: For 18/18 co-relation queries the response was YES. [2021-03-26 10:26:24,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 42 events. 2/42 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 126 event pairs, 1 based on Foata normal form. 3/44 useless extension candidates. Maximal degree in co-relation 78. Up to 7 conditions per place. [2021-03-26 10:26:24,970 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 4 selfloop transitions, 2 changer transitions 3/24 dead transitions. [2021-03-26 10:26:24,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 24 transitions, 99 flow [2021-03-26 10:26:24,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:26:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:26:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2021-03-26 10:26:24,972 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8327485380116959 [2021-03-26 10:26:24,972 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2021-03-26 10:26:24,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2021-03-26 10:26:24,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:24,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2021-03-26 10:26:24,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 171.0) internal successors, (1026), 6 states have internal predecessors, (1026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:24,978 INFO L185 Difference]: Start difference. First operand has 34 places, 21 transitions, 68 flow. Second operand 5 states and 712 transitions. [2021-03-26 10:26:24,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 24 transitions, 99 flow [2021-03-26 10:26:24,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 24 transitions, 89 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:26:24,980 INFO L241 Difference]: Finished difference. Result has 39 places, 21 transitions, 76 flow [2021-03-26 10:26:24,981 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=76, PETRI_PLACES=39, PETRI_TRANSITIONS=21} [2021-03-26 10:26:24,981 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-26 10:26:24,981 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:24,981 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 21 transitions, 76 flow [2021-03-26 10:26:24,981 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 21 transitions, 76 flow [2021-03-26 10:26:24,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 21 transitions, 76 flow [2021-03-26 10:26:24,985 INFO L129 PetriNetUnfolder]: 1/30 cut-off events. [2021-03-26 10:26:24,985 INFO L130 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2021-03-26 10:26:24,985 INFO L84 FinitePrefix]: Finished finitePrefix Result has 66 conditions, 30 events. 1/30 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 54 event pairs, 1 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 54. Up to 6 conditions per place. [2021-03-26 10:26:24,986 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-26 10:26:25,010 INFO L154 LiptonReduction]: Checked pairs total: 328 [2021-03-26 10:26:25,010 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:26:25,011 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-03-26 10:26:25,013 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 20 transitions, 74 flow [2021-03-26 10:26:25,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,014 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:25,014 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:25,014 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:26:25,014 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:25,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:25,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1313154008, now seen corresponding path program 1 times [2021-03-26 10:26:25,016 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:25,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150374705] [2021-03-26 10:26:25,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:25,131 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:25,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:26:25,139 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:25,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:26:25,155 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:26:25,157 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:26:25,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:25,175 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150374705] [2021-03-26 10:26:25,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:25,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:26:25,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123999209] [2021-03-26 10:26:25,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:26:25,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:25,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:26:25,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:26:25,177 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 172 [2021-03-26 10:26:25,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 20 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,178 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:25,178 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 172 [2021-03-26 10:26:25,178 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:25,267 INFO L129 PetriNetUnfolder]: 65/156 cut-off events. [2021-03-26 10:26:25,268 INFO L130 PetriNetUnfolder]: For 358/369 co-relation queries the response was YES. [2021-03-26 10:26:25,268 INFO L84 FinitePrefix]: Finished finitePrefix Result has 388 conditions, 156 events. 65/156 cut-off events. For 358/369 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 672 event pairs, 26 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 374. Up to 107 conditions per place. [2021-03-26 10:26:25,269 INFO L132 encePairwiseOnDemand]: 166/172 looper letters, 9 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2021-03-26 10:26:25,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 27 transitions, 118 flow [2021-03-26 10:26:25,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:26:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:26:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 532 transitions. [2021-03-26 10:26:25,272 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7732558139534884 [2021-03-26 10:26:25,272 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 532 transitions. [2021-03-26 10:26:25,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 532 transitions. [2021-03-26 10:26:25,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:25,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 532 transitions. [2021-03-26 10:26:25,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,275 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,276 INFO L185 Difference]: Start difference. First operand has 36 places, 20 transitions, 74 flow. Second operand 4 states and 532 transitions. [2021-03-26 10:26:25,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 27 transitions, 118 flow [2021-03-26 10:26:25,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 27 transitions, 106 flow, removed 3 selfloop flow, removed 5 redundant places. [2021-03-26 10:26:25,278 INFO L241 Difference]: Finished difference. Result has 36 places, 25 transitions, 101 flow [2021-03-26 10:26:25,279 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=172, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2021-03-26 10:26:25,279 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -12 predicate places. [2021-03-26 10:26:25,279 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:25,279 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 25 transitions, 101 flow [2021-03-26 10:26:25,279 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 25 transitions, 101 flow [2021-03-26 10:26:25,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 25 transitions, 101 flow [2021-03-26 10:26:25,291 INFO L129 PetriNetUnfolder]: 11/60 cut-off events. [2021-03-26 10:26:25,292 INFO L130 PetriNetUnfolder]: For 28/29 co-relation queries the response was YES. [2021-03-26 10:26:25,293 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 60 events. 11/60 cut-off events. For 28/29 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 194 event pairs, 5 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 128. Up to 23 conditions per place. [2021-03-26 10:26:25,295 INFO L142 LiptonReduction]: Number of co-enabled transitions 206 [2021-03-26 10:26:25,602 INFO L154 LiptonReduction]: Checked pairs total: 261 [2021-03-26 10:26:25,603 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:26:25,603 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 324 [2021-03-26 10:26:25,603 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 106 flow [2021-03-26 10:26:25,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,604 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:25,604 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:25,604 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:26:25,604 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1120262708, now seen corresponding path program 1 times [2021-03-26 10:26:25,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:25,605 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946786387] [2021-03-26 10:26:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:25,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:25,650 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:25,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:25,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:25,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:25,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:25,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946786387] [2021-03-26 10:26:25,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:25,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:26:25,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883016906] [2021-03-26 10:26:25,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:26:25,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:25,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:26:25,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:26:25,658 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-26 10:26:25,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:25,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-26 10:26:25,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:25,689 INFO L129 PetriNetUnfolder]: 16/73 cut-off events. [2021-03-26 10:26:25,689 INFO L130 PetriNetUnfolder]: For 140/159 co-relation queries the response was YES. [2021-03-26 10:26:25,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 73 events. 16/73 cut-off events. For 140/159 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 272 event pairs, 7 based on Foata normal form. 9/79 useless extension candidates. Maximal degree in co-relation 175. Up to 34 conditions per place. [2021-03-26 10:26:25,690 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 2 selfloop transitions, 3 changer transitions 3/26 dead transitions. [2021-03-26 10:26:25,690 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 26 transitions, 127 flow [2021-03-26 10:26:25,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:26:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:26:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2021-03-26 10:26:25,692 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8175287356321839 [2021-03-26 10:26:25,692 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2021-03-26 10:26:25,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2021-03-26 10:26:25,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:25,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2021-03-26 10:26:25,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,695 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:25,695 INFO L185 Difference]: Start difference. First operand has 36 places, 25 transitions, 106 flow. Second operand 4 states and 569 transitions. [2021-03-26 10:26:25,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 26 transitions, 127 flow [2021-03-26 10:26:25,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 26 transitions, 127 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:26:25,697 INFO L241 Difference]: Finished difference. Result has 40 places, 23 transitions, 102 flow [2021-03-26 10:26:25,697 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2021-03-26 10:26:25,697 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -8 predicate places. [2021-03-26 10:26:25,697 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:25,697 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 23 transitions, 102 flow [2021-03-26 10:26:25,698 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 102 flow [2021-03-26 10:26:25,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 102 flow [2021-03-26 10:26:25,704 INFO L129 PetriNetUnfolder]: 8/45 cut-off events. [2021-03-26 10:26:25,704 INFO L130 PetriNetUnfolder]: For 54/55 co-relation queries the response was YES. [2021-03-26 10:26:25,705 INFO L84 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 45 events. 8/45 cut-off events. For 54/55 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 121 event pairs, 4 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 106. Up to 21 conditions per place. [2021-03-26 10:26:25,705 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-26 10:26:25,894 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:26:26,284 WARN L205 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 87 [2021-03-26 10:26:26,417 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-26 10:26:26,803 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 85 [2021-03-26 10:26:26,967 INFO L154 LiptonReduction]: Checked pairs total: 316 [2021-03-26 10:26:26,967 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:26:26,967 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1270 [2021-03-26 10:26:26,969 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 113 flow [2021-03-26 10:26:26,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:26,969 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:26,969 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:26,969 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:26:26,970 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1492827030, now seen corresponding path program 2 times [2021-03-26 10:26:26,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:26,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901847003] [2021-03-26 10:26:26,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:27,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:26:27,055 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-26 10:26:27,056 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:26:27,069 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:26:27,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:26:27,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:26:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:27,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901847003] [2021-03-26 10:26:27,086 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:27,086 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:26:27,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878155691] [2021-03-26 10:26:27,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:26:27,087 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:27,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:26:27,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:26:27,088 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 178 [2021-03-26 10:26:27,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:27,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 178 [2021-03-26 10:26:27,089 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:27,206 INFO L129 PetriNetUnfolder]: 55/153 cut-off events. [2021-03-26 10:26:27,207 INFO L130 PetriNetUnfolder]: For 302/305 co-relation queries the response was YES. [2021-03-26 10:26:27,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 153 events. 55/153 cut-off events. For 302/305 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 701 event pairs, 20 based on Foata normal form. 7/156 useless extension candidates. Maximal degree in co-relation 422. Up to 68 conditions per place. [2021-03-26 10:26:27,208 INFO L132 encePairwiseOnDemand]: 170/178 looper letters, 13 selfloop transitions, 8 changer transitions 1/33 dead transitions. [2021-03-26 10:26:27,208 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 199 flow [2021-03-26 10:26:27,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:26:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:26:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2021-03-26 10:26:27,211 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.75187265917603 [2021-03-26 10:26:27,211 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2021-03-26 10:26:27,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2021-03-26 10:26:27,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:27,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2021-03-26 10:26:27,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,215 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,215 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 113 flow. Second operand 6 states and 803 transitions. [2021-03-26 10:26:27,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 199 flow [2021-03-26 10:26:27,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 164 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-26 10:26:27,218 INFO L241 Difference]: Finished difference. Result has 39 places, 26 transitions, 130 flow [2021-03-26 10:26:27,218 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=130, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2021-03-26 10:26:27,218 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-26 10:26:27,218 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:27,219 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 26 transitions, 130 flow [2021-03-26 10:26:27,219 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 26 transitions, 130 flow [2021-03-26 10:26:27,219 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 26 transitions, 130 flow [2021-03-26 10:26:27,236 INFO L129 PetriNetUnfolder]: 24/86 cut-off events. [2021-03-26 10:26:27,237 INFO L130 PetriNetUnfolder]: For 82/84 co-relation queries the response was YES. [2021-03-26 10:26:27,237 INFO L84 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 86 events. 24/86 cut-off events. For 82/84 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 338 event pairs, 10 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 232. Up to 49 conditions per place. [2021-03-26 10:26:27,238 INFO L142 LiptonReduction]: Number of co-enabled transitions 132 [2021-03-26 10:26:27,239 INFO L154 LiptonReduction]: Checked pairs total: 76 [2021-03-26 10:26:27,239 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:26:27,240 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 10:26:27,240 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 130 flow [2021-03-26 10:26:27,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,241 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:27,241 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:27,241 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:26:27,241 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:27,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:27,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1358326890, now seen corresponding path program 1 times [2021-03-26 10:26:27,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:27,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192724838] [2021-03-26 10:26:27,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:27,299 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,300 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:27,304 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:26:27,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:26:27,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:27,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192724838] [2021-03-26 10:26:27,310 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:27,310 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:26:27,310 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685350787] [2021-03-26 10:26:27,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:26:27,310 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:27,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:26:27,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:26:27,312 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 178 [2021-03-26 10:26:27,312 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,312 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:27,312 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 178 [2021-03-26 10:26:27,312 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:27,368 INFO L129 PetriNetUnfolder]: 115/283 cut-off events. [2021-03-26 10:26:27,369 INFO L130 PetriNetUnfolder]: For 178/198 co-relation queries the response was YES. [2021-03-26 10:26:27,370 INFO L84 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 283 events. 115/283 cut-off events. For 178/198 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1623 event pairs, 48 based on Foata normal form. 26/291 useless extension candidates. Maximal degree in co-relation 674. Up to 159 conditions per place. [2021-03-26 10:26:27,371 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 8 selfloop transitions, 8 changer transitions 0/36 dead transitions. [2021-03-26 10:26:27,371 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 36 transitions, 182 flow [2021-03-26 10:26:27,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:26:27,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:26:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2021-03-26 10:26:27,373 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.851685393258427 [2021-03-26 10:26:27,373 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2021-03-26 10:26:27,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2021-03-26 10:26:27,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:27,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2021-03-26 10:26:27,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.6) internal successors, (758), 5 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,377 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 178.0) internal successors, (1068), 6 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,377 INFO L185 Difference]: Start difference. First operand has 39 places, 26 transitions, 130 flow. Second operand 5 states and 758 transitions. [2021-03-26 10:26:27,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 36 transitions, 182 flow [2021-03-26 10:26:27,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 36 transitions, 177 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:26:27,380 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 185 flow [2021-03-26 10:26:27,380 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=185, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2021-03-26 10:26:27,380 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-26 10:26:27,380 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:27,380 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 185 flow [2021-03-26 10:26:27,381 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 185 flow [2021-03-26 10:26:27,381 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 33 transitions, 185 flow [2021-03-26 10:26:27,407 INFO L129 PetriNetUnfolder]: 122/291 cut-off events. [2021-03-26 10:26:27,408 INFO L130 PetriNetUnfolder]: For 352/397 co-relation queries the response was YES. [2021-03-26 10:26:27,409 INFO L84 FinitePrefix]: Finished finitePrefix Result has 892 conditions, 291 events. 122/291 cut-off events. For 352/397 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1610 event pairs, 51 based on Foata normal form. 8/278 useless extension candidates. Maximal degree in co-relation 876. Up to 161 conditions per place. [2021-03-26 10:26:27,410 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-26 10:26:27,416 INFO L154 LiptonReduction]: Checked pairs total: 14 [2021-03-26 10:26:27,416 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:26:27,416 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 36 [2021-03-26 10:26:27,418 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 179 flow [2021-03-26 10:26:27,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 148.75) internal successors, (595), 4 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,418 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:27,418 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:27,418 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:26:27,418 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:27,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:27,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1153072037, now seen corresponding path program 1 times [2021-03-26 10:26:27,419 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:27,419 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227222913] [2021-03-26 10:26:27,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:27,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:27,453 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:27,457 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,458 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:27,463 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:26:27,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:26:27,469 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,469 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:27,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227222913] [2021-03-26 10:26:27,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:27,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:26:27,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625362845] [2021-03-26 10:26:27,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:26:27,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:27,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:26:27,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:26:27,473 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 178 [2021-03-26 10:26:27,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:27,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 178 [2021-03-26 10:26:27,474 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:27,571 INFO L129 PetriNetUnfolder]: 53/168 cut-off events. [2021-03-26 10:26:27,571 INFO L130 PetriNetUnfolder]: For 207/235 co-relation queries the response was YES. [2021-03-26 10:26:27,572 INFO L84 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 168 events. 53/168 cut-off events. For 207/235 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 825 event pairs, 8 based on Foata normal form. 39/204 useless extension candidates. Maximal degree in co-relation 598. Up to 105 conditions per place. [2021-03-26 10:26:27,572 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 5 selfloop transitions, 11 changer transitions 3/39 dead transitions. [2021-03-26 10:26:27,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 257 flow [2021-03-26 10:26:27,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:26:27,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:26:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 909 transitions. [2021-03-26 10:26:27,575 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.851123595505618 [2021-03-26 10:26:27,575 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 909 transitions. [2021-03-26 10:26:27,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 909 transitions. [2021-03-26 10:26:27,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:27,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 909 transitions. [2021-03-26 10:26:27,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 151.5) internal successors, (909), 6 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,579 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 178.0) internal successors, (1246), 7 states have internal predecessors, (1246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,579 INFO L185 Difference]: Start difference. First operand has 45 places, 32 transitions, 179 flow. Second operand 6 states and 909 transitions. [2021-03-26 10:26:27,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 257 flow [2021-03-26 10:26:27,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 251 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:26:27,583 INFO L241 Difference]: Finished difference. Result has 49 places, 36 transitions, 243 flow [2021-03-26 10:26:27,584 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2021-03-26 10:26:27,584 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-03-26 10:26:27,584 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:27,584 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 243 flow [2021-03-26 10:26:27,585 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 243 flow [2021-03-26 10:26:27,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 36 transitions, 243 flow [2021-03-26 10:26:27,601 INFO L129 PetriNetUnfolder]: 50/163 cut-off events. [2021-03-26 10:26:27,601 INFO L130 PetriNetUnfolder]: For 320/334 co-relation queries the response was YES. [2021-03-26 10:26:27,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 163 events. 50/163 cut-off events. For 320/334 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 796 event pairs, 8 based on Foata normal form. 1/159 useless extension candidates. Maximal degree in co-relation 619. Up to 99 conditions per place. [2021-03-26 10:26:27,603 INFO L142 LiptonReduction]: Number of co-enabled transitions 160 [2021-03-26 10:26:27,610 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-26 10:26:27,610 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:26:27,610 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 26 [2021-03-26 10:26:27,611 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 235 flow [2021-03-26 10:26:27,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 148.8) internal successors, (744), 5 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,612 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:27,612 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:27,612 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:26:27,613 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:27,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 740627575, now seen corresponding path program 1 times [2021-03-26 10:26:27,613 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:27,613 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165661567] [2021-03-26 10:26:27,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:26:27,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:27,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:27,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:26:27,691 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:26:27,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:26:27,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:26:27,698 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:26:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:26:27,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165661567] [2021-03-26 10:26:27,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:26:27,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:26:27,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133443162] [2021-03-26 10:26:27,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:26:27,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:26:27,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:26:27,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:26:27,701 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 178 [2021-03-26 10:26:27,702 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,702 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:26:27,702 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 178 [2021-03-26 10:26:27,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:26:27,759 INFO L129 PetriNetUnfolder]: 27/97 cut-off events. [2021-03-26 10:26:27,759 INFO L130 PetriNetUnfolder]: For 216/226 co-relation queries the response was YES. [2021-03-26 10:26:27,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 97 events. 27/97 cut-off events. For 216/226 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 365 event pairs, 2 based on Foata normal form. 22/117 useless extension candidates. Maximal degree in co-relation 395. Up to 58 conditions per place. [2021-03-26 10:26:27,760 INFO L132 encePairwiseOnDemand]: 172/178 looper letters, 2 selfloop transitions, 11 changer transitions 5/36 dead transitions. [2021-03-26 10:26:27,760 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 267 flow [2021-03-26 10:26:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:26:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:26:27,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1054 transitions. [2021-03-26 10:26:27,763 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8459069020866774 [2021-03-26 10:26:27,763 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1054 transitions. [2021-03-26 10:26:27,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1054 transitions. [2021-03-26 10:26:27,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:26:27,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1054 transitions. [2021-03-26 10:26:27,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 150.57142857142858) internal successors, (1054), 7 states have internal predecessors, (1054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,769 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 178.0) internal successors, (1424), 8 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:27,769 INFO L185 Difference]: Start difference. First operand has 49 places, 35 transitions, 235 flow. Second operand 7 states and 1054 transitions. [2021-03-26 10:26:27,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 267 flow [2021-03-26 10:26:27,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 36 transitions, 238 flow, removed 11 selfloop flow, removed 4 redundant places. [2021-03-26 10:26:27,772 INFO L241 Difference]: Finished difference. Result has 52 places, 31 transitions, 205 flow [2021-03-26 10:26:27,772 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=52, PETRI_TRANSITIONS=31} [2021-03-26 10:26:27,772 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 4 predicate places. [2021-03-26 10:26:27,772 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:26:27,772 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 31 transitions, 205 flow [2021-03-26 10:26:27,772 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 31 transitions, 205 flow [2021-03-26 10:26:27,773 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 31 transitions, 205 flow [2021-03-26 10:26:27,779 INFO L129 PetriNetUnfolder]: 16/62 cut-off events. [2021-03-26 10:26:27,780 INFO L130 PetriNetUnfolder]: For 98/100 co-relation queries the response was YES. [2021-03-26 10:26:27,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 62 events. 16/62 cut-off events. For 98/100 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 182 event pairs, 1 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 222. Up to 20 conditions per place. [2021-03-26 10:26:27,780 INFO L142 LiptonReduction]: Number of co-enabled transitions 70 [2021-03-26 10:26:28,133 WARN L205 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:26:28,309 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-26 10:26:28,482 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-26 10:26:28,880 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 90 [2021-03-26 10:26:28,999 WARN L205 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-03-26 10:26:29,584 WARN L205 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 10:26:29,802 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:26:31,150 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 348 DAG size of output: 276 [2021-03-26 10:26:31,802 WARN L205 SmtUtils]: Spent 649.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-26 10:26:31,806 INFO L154 LiptonReduction]: Checked pairs total: 14 [2021-03-26 10:26:31,806 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-26 10:26:31,807 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4035 [2021-03-26 10:26:31,807 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 191 flow [2021-03-26 10:26:31,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:26:31,807 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:26:31,808 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:26:31,808 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:26:31,808 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:26:31,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:26:31,808 INFO L82 PathProgramCache]: Analyzing trace with hash -533762823, now seen corresponding path program 1 times [2021-03-26 10:26:31,808 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:26:31,808 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181372969] [2021-03-26 10:26:31,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:26:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:26:31,872 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:26:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:26:31,917 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:26:31,957 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:26:31,957 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:26:31,957 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:26:32,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:26:32 BasicIcfg [2021-03-26 10:26:32,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:26:32,049 INFO L168 Benchmark]: Toolchain (without parser) took 22409.31 ms. Allocated memory was 255.9 MB in the beginning and 616.6 MB in the end (delta: 360.7 MB). Free memory was 234.1 MB in the beginning and 516.5 MB in the end (delta: -282.4 MB). Peak memory consumption was 77.6 MB. Max. memory is 16.0 GB. [2021-03-26 10:26:32,049 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:26:32,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.68 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 234.1 MB in the beginning and 313.9 MB in the end (delta: -79.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. [2021-03-26 10:26:32,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.27 ms. Allocated memory is still 354.4 MB. Free memory was 313.9 MB in the beginning and 311.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:26:32,051 INFO L168 Benchmark]: Boogie Preprocessor took 50.56 ms. Allocated memory is still 354.4 MB. Free memory was 311.2 MB in the beginning and 309.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:26:32,051 INFO L168 Benchmark]: RCFGBuilder took 1657.87 ms. Allocated memory is still 354.4 MB. Free memory was 309.1 MB in the beginning and 209.8 MB in the end (delta: 99.3 MB). Peak memory consumption was 101.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:26:32,051 INFO L168 Benchmark]: TraceAbstraction took 20076.51 ms. Allocated memory was 354.4 MB in the beginning and 616.6 MB in the end (delta: 262.1 MB). Free memory was 209.8 MB in the beginning and 516.5 MB in the end (delta: -306.6 MB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:26:32,058 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 255.9 MB. Free memory is still 237.7 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 542.68 ms. Allocated memory was 255.9 MB in the beginning and 354.4 MB in the end (delta: 98.6 MB). Free memory was 234.1 MB in the beginning and 313.9 MB in the end (delta: -79.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 77.27 ms. Allocated memory is still 354.4 MB. Free memory was 313.9 MB in the beginning and 311.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.56 ms. Allocated memory is still 354.4 MB. Free memory was 311.2 MB in the beginning and 309.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1657.87 ms. Allocated memory is still 354.4 MB. Free memory was 309.1 MB in the beginning and 209.8 MB in the end (delta: 99.3 MB). Peak memory consumption was 101.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20076.51 ms. Allocated memory was 354.4 MB in the beginning and 616.6 MB in the end (delta: 262.1 MB). Free memory was 209.8 MB in the beginning and 516.5 MB in the end (delta: -306.6 MB). There was no memory consumed. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7882.7ms, 102 PlacesBefore, 48 PlacesAfterwards, 94 TransitionsBefore, 39 TransitionsAfterwards, 1686 CoEnabledTransitionPairs, 4 FixpointIterations, 26 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 64 TotalNumberOfCompositions, 2882 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1376, positive: 1304, positive conditional: 1304, positive unconditional: 0, negative: 72, negative conditional: 72, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1376, positive: 1304, positive conditional: 0, positive unconditional: 1304, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1376, positive: 1304, positive conditional: 0, positive unconditional: 1304, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1081, positive: 1047, positive conditional: 0, positive unconditional: 1047, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1081, positive: 1038, positive conditional: 0, positive unconditional: 1038, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 43, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 568, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 537, negative conditional: 0, negative unconditional: 537, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1376, positive: 257, positive conditional: 0, positive unconditional: 257, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 1081, unknown conditional: 0, unknown unconditional: 1081] , Statistics on independence cache: Total cache size (in pairs): 1081, Positive cache size: 1047, Positive conditional cache size: 0, Positive unconditional cache size: 1047, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2648.4ms, 45 PlacesBefore, 33 PlacesAfterwards, 32 TransitionsBefore, 24 TransitionsAfterwards, 264 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 1242 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 351, positive: 262, positive conditional: 262, positive unconditional: 0, negative: 89, negative conditional: 89, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 351, positive: 262, positive conditional: 15, positive unconditional: 247, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 351, positive: 262, positive conditional: 15, positive unconditional: 247, negative: 89, negative conditional: 4, negative unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 58, positive: 49, positive conditional: 1, positive unconditional: 48, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 58, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 14, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 9, negative conditional: 1, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 250, positive: 79, positive conditional: 0, positive unconditional: 79, negative: 171, negative conditional: 16, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 351, positive: 213, positive conditional: 14, positive unconditional: 199, negative: 80, negative conditional: 3, negative unconditional: 77, unknown: 58, unknown conditional: 2, unknown unconditional: 56] , Statistics on independence cache: Total cache size (in pairs): 1139, Positive cache size: 1096, Positive conditional cache size: 1, Positive unconditional cache size: 1095, Negative cache size: 43, Negative conditional cache size: 1, Negative unconditional cache size: 42, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1030.8ms, 34 PlacesBefore, 31 PlacesAfterwards, 23 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 777 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 216, positive: 156, positive conditional: 156, positive unconditional: 0, negative: 60, negative conditional: 60, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 216, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 216, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 23, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 216, positive: 146, positive conditional: 0, positive unconditional: 146, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 1151, Positive cache size: 1106, Positive conditional cache size: 1, Positive unconditional cache size: 1105, Negative cache size: 45, Negative conditional cache size: 1, Negative unconditional cache size: 44, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 203.8ms, 34 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 192 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 199 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 51, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 16, negative conditional: 16, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 51, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 51, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 16, negative conditional: 1, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 8, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 8, negative conditional: 1, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 197, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 197, negative conditional: 4, negative unconditional: 194, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 51, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 12, unknown conditional: 1, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 1163, Positive cache size: 1110, Positive conditional cache size: 1, Positive unconditional cache size: 1109, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.1ms, 34 PlacesBefore, 34 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 190 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 184 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 45, positive conditional: 45, positive unconditional: 0, negative: 15, negative conditional: 15, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 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] , 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: 60, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 1171, Positive cache size: 1118, Positive conditional cache size: 1, Positive unconditional cache size: 1117, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.2ms, 39 PlacesBefore, 36 PlacesAfterwards, 21 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 328 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 111, positive: 84, positive conditional: 84, positive unconditional: 0, negative: 27, negative conditional: 27, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 111, positive: 84, positive conditional: 2, positive unconditional: 82, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 111, positive: 84, positive conditional: 2, positive unconditional: 82, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 2, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 111, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 27, negative conditional: 0, negative unconditional: 27, unknown: 4, unknown conditional: 2, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1175, Positive cache size: 1122, Positive conditional cache size: 3, Positive unconditional cache size: 1119, Negative cache size: 53, Negative conditional cache size: 2, Negative unconditional cache size: 51, Eliminated conditions: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 323.2ms, 36 PlacesBefore, 36 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 206 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 261 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, positive: 94, positive conditional: 94, positive unconditional: 0, negative: 18, negative conditional: 18, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, positive: 94, positive conditional: 13, positive unconditional: 81, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 94, positive conditional: 13, positive unconditional: 81, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 18, positive conditional: 6, positive unconditional: 12, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 6, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 191, positive: 88, positive conditional: 88, positive unconditional: 0, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, positive: 76, positive conditional: 7, positive unconditional: 69, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 22, unknown conditional: 6, unknown unconditional: 16] , Statistics on independence cache: Total cache size (in pairs): 1197, Positive cache size: 1140, Positive conditional cache size: 9, Positive unconditional cache size: 1131, Negative cache size: 57, Negative conditional cache size: 2, Negative unconditional cache size: 55, Eliminated conditions: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1269.7ms, 40 PlacesBefore, 39 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 4 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 316 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 172, positive: 140, positive conditional: 140, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 172, positive: 140, positive conditional: 23, positive unconditional: 117, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 140, positive conditional: 23, positive unconditional: 117, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 15, positive: 12, positive conditional: 9, positive unconditional: 3, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 15, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 3, positive conditional: 2, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, positive: 41, positive conditional: 37, positive unconditional: 5, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, positive: 128, positive conditional: 14, positive unconditional: 114, negative: 29, negative conditional: 0, negative unconditional: 29, unknown: 15, unknown conditional: 9, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1152, Positive conditional cache size: 18, Positive unconditional cache size: 1134, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.7ms, 39 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 132 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 76 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 32, positive: 26, positive conditional: 3, positive unconditional: 23, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 26, positive conditional: 3, positive unconditional: 23, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 32, positive: 26, positive conditional: 3, positive unconditional: 23, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1152, Positive conditional cache size: 18, Positive unconditional cache size: 1134, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 35.6ms, 45 PlacesBefore, 45 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 14, positive conditional: 9, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 9, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 13, positive conditional: 9, positive unconditional: 4, 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: 13, positive: 13, positive conditional: 0, positive unconditional: 13, 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: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 13, unknown conditional: 9, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1225, Positive cache size: 1165, Positive conditional cache size: 27, Positive unconditional cache size: 1138, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 25.5ms, 49 PlacesBefore, 49 PlacesAfterwards, 36 TransitionsBefore, 35 TransitionsAfterwards, 160 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.Independence Queries: [ total: 9, positive: 9, positive conditional: 7, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 7, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 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: 9, positive: 6, positive conditional: 4, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1228, Positive cache size: 1168, Positive conditional cache size: 30, Positive unconditional cache size: 1138, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4034.1ms, 52 PlacesBefore, 46 PlacesAfterwards, 31 TransitionsBefore, 27 TransitionsAfterwards, 70 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 14 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 14, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 14, positive: 14, positive conditional: 12, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 12, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 3, 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: 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: 11, positive conditional: 9, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1231, Positive cache size: 1171, Positive conditional cache size: 33, Positive unconditional cache size: 1138, Negative cache size: 60, Negative conditional cache size: 2, Negative unconditional cache size: 58, Eliminated conditions: 2 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1807; [L819] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L820] 0 pthread_t t1808; [L821] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L822] 0 pthread_t t1809; [L823] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L790] 3 __unbuffered_p2_EAX = y [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L741] 1 __unbuffered_p0_EAX = y [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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] [L747] 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) [L747] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L747] 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) [L747] 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) [L748] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L749] 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 [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L751] 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 [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L796] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L776] 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) [L776] 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) [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] 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 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L780] 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 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] 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) [L829] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L829] 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) [L829] 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) [L830] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 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 [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L833] 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 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 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) [L840] 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) [L841] 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)) [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L841] 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)) [L841] 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)) [L842] 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)) [L842] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L842] 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)) [L842] 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)) [L843] 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)) [L843] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L843] 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)) [L843] 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)) [L844] 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)) [L844] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] 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)) [L844] 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)) [L845] 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)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L845] 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)) [L845] 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)) [L846] 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)) [L846] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] 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)) [L846] 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)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 19870.3ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 843.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7987.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 38 SDtfs, 24 SDslu, 17 SDs, 0 SdLazy, 179 SolverSat, 57 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 210.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 209.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=243occurred in iteration=10, InterpolantAutomatonStates: 50, 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: 34.3ms SsaConstructionTime, 443.7ms SatisfiabilityAnalysisTime, 650.5ms InterpolantComputationTime, 170 NumberOfCodeBlocks, 170 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 141 ConstructedInterpolants, 0 QuantifiedInterpolants, 561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...