/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/mix045_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:10:19,102 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:10:19,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:10:19,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:10:19,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:10:19,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:10:19,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:10:19,151 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:10:19,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:10:19,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:10:19,158 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:10:19,159 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:10:19,159 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:10:19,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:10:19,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:10:19,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:10:19,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:10:19,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:10:19,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:10:19,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:10:19,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:10:19,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:10:19,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:10:19,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:10:19,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:10:19,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:10:19,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:10:19,189 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:10:19,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:10:19,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:10:19,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:10:19,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:10:19,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:10:19,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:10:19,194 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:10:19,194 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:10:19,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:10:19,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:10:19,195 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:10:19,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:10:19,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:10:19,200 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:10:19,234 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:10:19,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:10:19,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:10:19,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:10:19,238 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:10:19,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:10:19,239 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:10:19,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:10:19,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:10:19,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:10:19,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:10:19,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:10:19,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:10:19,240 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:10:19,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:10:19,241 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:10:19,241 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:10:19,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:10:19,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:10:19,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:10:19,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:10:19,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:10:19,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:10:19,242 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:10:19,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:10:19,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:10:19,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:10:19,243 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:10:19,243 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:10:19,243 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:10:19,244 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:10:19,554 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:10:19,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:10:19,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:10:19,581 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:10:19,582 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:10:19,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2021-03-26 10:10:19,641 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1331f72c5/e12b0611a66a4f929dcb75d31b42f80b/FLAGfc9cd6260 [2021-03-26 10:10:20,129 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:10:20,130 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix045_power.opt.i [2021-03-26 10:10:20,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1331f72c5/e12b0611a66a4f929dcb75d31b42f80b/FLAGfc9cd6260 [2021-03-26 10:10:20,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1331f72c5/e12b0611a66a4f929dcb75d31b42f80b [2021-03-26 10:10:20,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:10:20,660 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:10:20,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:10:20,661 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:10:20,666 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:10:20,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:10:20" (1/1) ... [2021-03-26 10:10:20,667 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a7b267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:20, skipping insertion in model container [2021-03-26 10:10:20,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:10:20" (1/1) ... [2021-03-26 10:10:20,672 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:10:20,719 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:10:20,857 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/mix045_power.opt.i[950,963] [2021-03-26 10:10:21,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:10:21,037 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:10:21,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/mix045_power.opt.i[950,963] [2021-03-26 10:10:21,091 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:10:21,150 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:10:21,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21 WrapperNode [2021-03-26 10:10:21,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:10:21,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:10:21,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:10:21,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:10:21,160 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:10:21" (1/1) ... [2021-03-26 10:10:21,186 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:10:21" (1/1) ... [2021-03-26 10:10:21,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:10:21,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:10:21,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:10:21,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:10:21,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (1/1) ... [2021-03-26 10:10:21,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (1/1) ... [2021-03-26 10:10:21,234 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (1/1) ... [2021-03-26 10:10:21,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (1/1) ... [2021-03-26 10:10:21,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (1/1) ... [2021-03-26 10:10:21,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (1/1) ... [2021-03-26 10:10:21,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (1/1) ... [2021-03-26 10:10:21,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:10:21,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:10:21,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:10:21,276 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:10:21,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (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:10:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:10:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:10:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:10:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:10:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:10:21,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:10:21,324 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:10:21,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:10:21,325 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:10:21,325 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:10:21,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:10:21,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:10:21,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:10:21,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:10:21,326 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:10:22,779 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:10:22,780 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-26 10:10:22,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:10:22 BoogieIcfgContainer [2021-03-26 10:10:22,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:10:22,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:10:22,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:10:22,786 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:10:22,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:10:20" (1/3) ... [2021-03-26 10:10:22,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2216aa62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:10:22, skipping insertion in model container [2021-03-26 10:10:22,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:10:21" (2/3) ... [2021-03-26 10:10:22,787 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2216aa62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:10:22, skipping insertion in model container [2021-03-26 10:10:22,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:10:22" (3/3) ... [2021-03-26 10:10:22,788 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_power.opt.i [2021-03-26 10:10:22,794 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:10:22,797 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-26 10:10:22,798 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:10:22,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,829 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,829 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,829 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,829 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,829 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,830 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,831 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,831 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,832 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,833 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,834 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,835 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,836 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,837 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,837 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,837 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,838 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,839 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,839 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,840 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,841 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,842 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,844 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,844 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,845 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,846 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,846 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,847 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,847 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,848 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,848 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,849 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,849 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,850 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,850 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:10:22,852 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:10:22,869 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-26 10:10:22,892 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:10:22,893 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:10:22,893 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:10:22,893 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:10:22,893 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:10:22,893 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:10:22,893 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:10:22,893 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:10:22,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:10:22,955 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:10:22,955 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:22,969 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:10:22,969 INFO L82 GeneralOperation]: Start removeDead. Operand has 108 places, 100 transitions, 215 flow [2021-03-26 10:10:22,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:22,974 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:22,987 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:22,992 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:22,997 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 203 flow [2021-03-26 10:10:23,022 INFO L129 PetriNetUnfolder]: 2/97 cut-off events. [2021-03-26 10:10:23,023 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:23,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 2/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 73 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-26 10:10:23,026 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-26 10:10:23,877 WARN L205 SmtUtils]: Spent 788.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-03-26 10:10:24,196 WARN L205 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-26 10:10:25,456 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-26 10:10:26,063 WARN L205 SmtUtils]: Spent 598.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-26 10:10:27,026 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-26 10:10:27,353 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-26 10:10:27,462 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-26 10:10:28,518 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:10:28,846 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-26 10:10:29,937 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 267 DAG size of output: 266 [2021-03-26 10:10:30,571 WARN L205 SmtUtils]: Spent 631.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-26 10:10:30,741 INFO L154 LiptonReduction]: Checked pairs total: 2726 [2021-03-26 10:10:30,741 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-26 10:10:30,744 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7771 [2021-03-26 10:10:30,759 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:10:30,759 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:30,759 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:30,760 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:10:30,760 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:30,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:30,766 INFO L82 PathProgramCache]: Analyzing trace with hash 429548733, now seen corresponding path program 1 times [2021-03-26 10:10:30,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:30,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854423615] [2021-03-26 10:10:30,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:30,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:31,029 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:31,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:31,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:31,034 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:31,040 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:10:31,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854423615] [2021-03-26 10:10:31,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:31,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:31,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893419230] [2021-03-26 10:10:31,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:31,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:31,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:31,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:31,065 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 167 [2021-03-26 10:10:31,066 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:31,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:31,067 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 167 [2021-03-26 10:10:31,067 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:31,146 INFO L129 PetriNetUnfolder]: 23/102 cut-off events. [2021-03-26 10:10:31,146 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:31,149 INFO L84 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 102 events. 23/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 372 event pairs, 3 based on Foata normal form. 5/99 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-26 10:10:31,151 INFO L132 encePairwiseOnDemand]: 163/167 looper letters, 7 selfloop transitions, 2 changer transitions 4/41 dead transitions. [2021-03-26 10:10:31,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 41 transitions, 113 flow [2021-03-26 10:10:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2021-03-26 10:10:31,171 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8902195608782435 [2021-03-26 10:10:31,172 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2021-03-26 10:10:31,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2021-03-26 10:10:31,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:31,178 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2021-03-26 10:10:31,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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:10:31,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:10:31,196 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states 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:10:31,198 INFO L185 Difference]: Start difference. First operand has 49 places, 40 transitions, 89 flow. Second operand 3 states and 446 transitions. [2021-03-26 10:10:31,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 41 transitions, 113 flow [2021-03-26 10:10:31,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 110 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:31,202 INFO L241 Difference]: Finished difference. Result has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:31,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=167, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2021-03-26 10:10:31,205 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2021-03-26 10:10:31,205 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:31,205 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:31,206 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 34 transitions, 78 flow [2021-03-26 10:10:31,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 34 transitions, 78 flow [2021-03-26 10:10:31,214 INFO L129 PetriNetUnfolder]: 0/34 cut-off events. [2021-03-26 10:10:31,214 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:31,215 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-26 10:10:31,216 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-26 10:10:31,642 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:10:31,956 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-26 10:10:33,118 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 268 DAG size of output: 267 [2021-03-26 10:10:33,779 WARN L205 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-26 10:10:35,036 INFO L154 LiptonReduction]: Checked pairs total: 1054 [2021-03-26 10:10:35,037 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-26 10:10:35,037 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3832 [2021-03-26 10:10:35,038 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2021-03-26 10:10:35,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:35,039 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:35,039 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:35,039 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:10:35,039 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:35,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:35,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1980972199, now seen corresponding path program 1 times [2021-03-26 10:10:35,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:35,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360608514] [2021-03-26 10:10:35,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:35,143 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:35,144 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:35,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:35,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:35,155 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-26 10:10:35,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-26 10:10:35,158 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:10:35,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360608514] [2021-03-26 10:10:35,159 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:35,159 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:35,159 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020972282] [2021-03-26 10:10:35,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:35,160 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:35,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:35,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:35,162 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 178 [2021-03-26 10:10:35,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:10:35,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:35,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 178 [2021-03-26 10:10:35,163 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:35,187 INFO L129 PetriNetUnfolder]: 3/35 cut-off events. [2021-03-26 10:10:35,187 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:10:35,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 3/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 1/33 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 10:10:35,188 INFO L132 encePairwiseOnDemand]: 174/178 looper letters, 3 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2021-03-26 10:10:35,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 72 flow [2021-03-26 10:10:35,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2021-03-26 10:10:35,195 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8782771535580525 [2021-03-26 10:10:35,195 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2021-03-26 10:10:35,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2021-03-26 10:10:35,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:35,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2021-03-26 10:10:35,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states 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:10:35,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 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:10:35,198 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 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:10:35,199 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 3 states and 469 transitions. [2021-03-26 10:10:35,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 72 flow [2021-03-26 10:10:35,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 25 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:35,200 INFO L241 Difference]: Finished difference. Result has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:35,200 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2021-03-26 10:10:35,200 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-26 10:10:35,200 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:35,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:35,201 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:35,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 25 transitions, 71 flow [2021-03-26 10:10:35,205 INFO L129 PetriNetUnfolder]: 3/31 cut-off events. [2021-03-26 10:10:35,206 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:10:35,206 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 31 events. 3/31 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 56 event pairs, 1 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 42. Up to 10 conditions per place. [2021-03-26 10:10:35,206 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-26 10:10:35,836 WARN L205 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:10:35,993 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:10:36,295 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 116 [2021-03-26 10:10:36,426 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2021-03-26 10:10:36,429 INFO L154 LiptonReduction]: Checked pairs total: 633 [2021-03-26 10:10:36,429 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:36,429 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1229 [2021-03-26 10:10:36,430 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-26 10:10:36,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states 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:10:36,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:36,431 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:36,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:10:36,431 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1508873391, now seen corresponding path program 1 times [2021-03-26 10:10:36,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:36,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504634554] [2021-03-26 10:10:36,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:36,494 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:36,495 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:36,497 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:10:36,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504634554] [2021-03-26 10:10:36,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:36,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-26 10:10:36,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176130693] [2021-03-26 10:10:36,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:36,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:36,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:36,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:36,500 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 180 [2021-03-26 10:10:36,501 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:10:36,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:36,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 180 [2021-03-26 10:10:36,501 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:36,513 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 10:10:36,513 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-26 10:10:36,513 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 33 events. 3/33 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 74 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-26 10:10:36,514 INFO L132 encePairwiseOnDemand]: 177/180 looper letters, 1 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2021-03-26 10:10:36,514 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 23 transitions, 73 flow [2021-03-26 10:10:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2021-03-26 10:10:36,516 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8851851851851852 [2021-03-26 10:10:36,516 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2021-03-26 10:10:36,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2021-03-26 10:10:36,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:36,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2021-03-26 10:10:36,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states 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:10:36,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states 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:10:36,519 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 180.0) internal successors, (720), 4 states have internal predecessors, (720), 0 states have call successors, (0), 0 states 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:10:36,519 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 3 states and 478 transitions. [2021-03-26 10:10:36,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 23 transitions, 73 flow [2021-03-26 10:10:36,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 23 transitions, 70 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:36,520 INFO L241 Difference]: Finished difference. Result has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:36,520 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2021-03-26 10:10:36,521 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -16 predicate places. [2021-03-26 10:10:36,521 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:36,521 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:36,521 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:36,521 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:36,525 INFO L129 PetriNetUnfolder]: 3/29 cut-off events. [2021-03-26 10:10:36,525 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-26 10:10:36,525 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 29 events. 3/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 62 event pairs, 1 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-26 10:10:36,526 INFO L142 LiptonReduction]: Number of co-enabled transitions 236 [2021-03-26 10:10:36,527 INFO L154 LiptonReduction]: Checked pairs total: 198 [2021-03-26 10:10:36,527 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:36,528 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-26 10:10:36,528 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 72 flow [2021-03-26 10:10:36,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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:10:36,529 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:36,529 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:36,529 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:10:36,529 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:36,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1510579461, now seen corresponding path program 1 times [2021-03-26 10:10:36,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:36,530 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088150362] [2021-03-26 10:10:36,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:36,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:36,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:36,635 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-26 10:10:36,639 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-26 10:10:36,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:36,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:36,660 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:10:36,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088150362] [2021-03-26 10:10:36,661 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:36,661 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:36,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812390351] [2021-03-26 10:10:36,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:36,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:36,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:36,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:36,667 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 180 [2021-03-26 10:10:36,668 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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:10:36,668 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:36,668 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 180 [2021-03-26 10:10:36,668 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:36,737 INFO L129 PetriNetUnfolder]: 47/123 cut-off events. [2021-03-26 10:10:36,737 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-03-26 10:10:36,739 INFO L84 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 123 events. 47/123 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 534 event pairs, 17 based on Foata normal form. 1/112 useless extension candidates. Maximal degree in co-relation 257. Up to 77 conditions per place. [2021-03-26 10:10:36,742 INFO L132 encePairwiseOnDemand]: 175/180 looper letters, 8 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2021-03-26 10:10:36,742 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 29 transitions, 113 flow [2021-03-26 10:10:36,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2021-03-26 10:10:36,744 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7638888888888888 [2021-03-26 10:10:36,744 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2021-03-26 10:10:36,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2021-03-26 10:10:36,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:36,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2021-03-26 10:10:36,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:36,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states 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:10:36,748 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states 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:10:36,748 INFO L185 Difference]: Start difference. First operand has 33 places, 23 transitions, 72 flow. Second operand 4 states and 550 transitions. [2021-03-26 10:10:36,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 29 transitions, 113 flow [2021-03-26 10:10:36,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:36,750 INFO L241 Difference]: Finished difference. Result has 36 places, 27 transitions, 101 flow [2021-03-26 10:10:36,750 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=101, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2021-03-26 10:10:36,750 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -13 predicate places. [2021-03-26 10:10:36,750 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:36,751 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 36 places, 27 transitions, 101 flow [2021-03-26 10:10:36,751 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 36 places, 27 transitions, 101 flow [2021-03-26 10:10:36,751 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 36 places, 27 transitions, 101 flow [2021-03-26 10:10:36,758 INFO L129 PetriNetUnfolder]: 7/43 cut-off events. [2021-03-26 10:10:36,758 INFO L130 PetriNetUnfolder]: For 25/28 co-relation queries the response was YES. [2021-03-26 10:10:36,758 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 43 events. 7/43 cut-off events. For 25/28 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 121 event pairs, 3 based on Foata normal form. 1/39 useless extension candidates. Maximal degree in co-relation 87. Up to 15 conditions per place. [2021-03-26 10:10:36,759 INFO L142 LiptonReduction]: Number of co-enabled transitions 278 [2021-03-26 10:10:36,832 INFO L154 LiptonReduction]: Checked pairs total: 162 [2021-03-26 10:10:36,833 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:36,833 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 83 [2021-03-26 10:10:36,834 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 101 flow [2021-03-26 10:10:36,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 134.8) internal successors, (674), 5 states have internal predecessors, (674), 0 states have call successors, (0), 0 states 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:10:36,835 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:36,835 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:36,835 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:10:36,835 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:36,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:36,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1185198741, now seen corresponding path program 1 times [2021-03-26 10:10:36,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:36,836 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347002343] [2021-03-26 10:10:36,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:36,881 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:36,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:36,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:36,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:36,885 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:36,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:36,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:36,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:36,899 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:10:36,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347002343] [2021-03-26 10:10:36,900 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:36,900 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:36,900 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923488926] [2021-03-26 10:10:36,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:36,901 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:36,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:36,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:36,902 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 180 [2021-03-26 10:10:36,903 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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:10:36,903 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:36,903 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 180 [2021-03-26 10:10:36,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:36,970 INFO L129 PetriNetUnfolder]: 63/156 cut-off events. [2021-03-26 10:10:36,970 INFO L130 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2021-03-26 10:10:36,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 156 events. 63/156 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 694 event pairs, 13 based on Foata normal form. 2/149 useless extension candidates. Maximal degree in co-relation 393. Up to 91 conditions per place. [2021-03-26 10:10:36,972 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 8 selfloop transitions, 11 changer transitions 0/35 dead transitions. [2021-03-26 10:10:36,972 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 35 transitions, 168 flow [2021-03-26 10:10:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 741 transitions. [2021-03-26 10:10:36,975 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8233333333333334 [2021-03-26 10:10:36,975 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 741 transitions. [2021-03-26 10:10:36,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 741 transitions. [2021-03-26 10:10:36,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:36,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 741 transitions. [2021-03-26 10:10:36,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.2) internal successors, (741), 5 states have internal predecessors, (741), 0 states have call successors, (0), 0 states 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:10:36,979 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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:10:36,979 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states 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:10:36,980 INFO L185 Difference]: Start difference. First operand has 36 places, 27 transitions, 101 flow. Second operand 5 states and 741 transitions. [2021-03-26 10:10:36,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 35 transitions, 168 flow [2021-03-26 10:10:36,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-26 10:10:36,982 INFO L241 Difference]: Finished difference. Result has 42 places, 34 transitions, 173 flow [2021-03-26 10:10:36,982 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=42, PETRI_TRANSITIONS=34} [2021-03-26 10:10:36,982 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -7 predicate places. [2021-03-26 10:10:36,982 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:36,982 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 34 transitions, 173 flow [2021-03-26 10:10:36,982 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 34 transitions, 173 flow [2021-03-26 10:10:36,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 34 transitions, 173 flow [2021-03-26 10:10:36,994 INFO L129 PetriNetUnfolder]: 29/93 cut-off events. [2021-03-26 10:10:36,994 INFO L130 PetriNetUnfolder]: For 135/143 co-relation queries the response was YES. [2021-03-26 10:10:36,995 INFO L84 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 93 events. 29/93 cut-off events. For 135/143 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 383 event pairs, 6 based on Foata normal form. 3/83 useless extension candidates. Maximal degree in co-relation 262. Up to 33 conditions per place. [2021-03-26 10:10:36,996 INFO L142 LiptonReduction]: Number of co-enabled transitions 344 [2021-03-26 10:10:36,999 INFO L154 LiptonReduction]: Checked pairs total: 153 [2021-03-26 10:10:36,999 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:36,999 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-26 10:10:37,002 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 173 flow [2021-03-26 10:10:37,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 146.0) internal successors, (730), 5 states have internal predecessors, (730), 0 states have call successors, (0), 0 states 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:10:37,003 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:37,003 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:37,003 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:10:37,003 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:37,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:37,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1185109461, now seen corresponding path program 2 times [2021-03-26 10:10:37,004 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:37,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90018739] [2021-03-26 10:10:37,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:37,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:37,089 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:37,094 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:37,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:37,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:37,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:37,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:37,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:37,108 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:10:37,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90018739] [2021-03-26 10:10:37,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:37,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:37,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25111730] [2021-03-26 10:10:37,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:37,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:37,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:37,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:37,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 180 [2021-03-26 10:10:37,111 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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:10:37,111 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:37,111 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 180 [2021-03-26 10:10:37,111 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:37,193 INFO L129 PetriNetUnfolder]: 61/148 cut-off events. [2021-03-26 10:10:37,193 INFO L130 PetriNetUnfolder]: For 208/211 co-relation queries the response was YES. [2021-03-26 10:10:37,194 INFO L84 FinitePrefix]: Finished finitePrefix Result has 550 conditions, 148 events. 61/148 cut-off events. For 208/211 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 652 event pairs, 8 based on Foata normal form. 7/147 useless extension candidates. Maximal degree in co-relation 532. Up to 81 conditions per place. [2021-03-26 10:10:37,195 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 9 selfloop transitions, 15 changer transitions 0/40 dead transitions. [2021-03-26 10:10:37,195 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 244 flow [2021-03-26 10:10:37,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:10:37,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:10:37,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 863 transitions. [2021-03-26 10:10:37,198 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.799074074074074 [2021-03-26 10:10:37,198 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 863 transitions. [2021-03-26 10:10:37,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 863 transitions. [2021-03-26 10:10:37,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:37,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 863 transitions. [2021-03-26 10:10:37,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.83333333333334) internal successors, (863), 6 states have internal predecessors, (863), 0 states have call successors, (0), 0 states 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:10:37,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:10:37,204 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 180.0) internal successors, (1260), 7 states have internal predecessors, (1260), 0 states have call successors, (0), 0 states 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:10:37,204 INFO L185 Difference]: Start difference. First operand has 42 places, 34 transitions, 173 flow. Second operand 6 states and 863 transitions. [2021-03-26 10:10:37,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 244 flow [2021-03-26 10:10:37,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 235 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:37,208 INFO L241 Difference]: Finished difference. Result has 47 places, 38 transitions, 224 flow [2021-03-26 10:10:37,209 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2021-03-26 10:10:37,209 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2021-03-26 10:10:37,209 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:37,209 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 38 transitions, 224 flow [2021-03-26 10:10:37,209 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 38 transitions, 224 flow [2021-03-26 10:10:37,209 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 38 transitions, 224 flow [2021-03-26 10:10:37,223 INFO L129 PetriNetUnfolder]: 27/91 cut-off events. [2021-03-26 10:10:37,223 INFO L130 PetriNetUnfolder]: For 164/174 co-relation queries the response was YES. [2021-03-26 10:10:37,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 91 events. 27/91 cut-off events. For 164/174 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 347 event pairs, 5 based on Foata normal form. 3/83 useless extension candidates. Maximal degree in co-relation 287. Up to 31 conditions per place. [2021-03-26 10:10:37,224 INFO L142 LiptonReduction]: Number of co-enabled transitions 370 [2021-03-26 10:10:37,411 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-26 10:10:37,843 WARN L205 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-26 10:10:37,976 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-26 10:10:37,984 INFO L154 LiptonReduction]: Checked pairs total: 515 [2021-03-26 10:10:37,984 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:10:37,984 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 775 [2021-03-26 10:10:37,985 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 228 flow [2021-03-26 10:10:37,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states 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:10:37,985 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:37,986 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:37,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:10:37,986 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1626306817, now seen corresponding path program 3 times [2021-03-26 10:10:37,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:37,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735703241] [2021-03-26 10:10:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:38,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,033 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:38,038 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:38,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,047 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-26 10:10:38,062 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-03-26 10:10:38,063 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-03-26 10:10:38,082 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:10:38,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735703241] [2021-03-26 10:10:38,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:38,083 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:38,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430591518] [2021-03-26 10:10:38,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:38,083 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:38,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:38,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:38,085 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 181 [2021-03-26 10:10:38,086 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 228 flow. Second operand has 6 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states 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:10:38,086 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:38,086 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 181 [2021-03-26 10:10:38,086 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:38,179 INFO L129 PetriNetUnfolder]: 65/170 cut-off events. [2021-03-26 10:10:38,179 INFO L130 PetriNetUnfolder]: For 338/344 co-relation queries the response was YES. [2021-03-26 10:10:38,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 699 conditions, 170 events. 65/170 cut-off events. For 338/344 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 819 event pairs, 1 based on Foata normal form. 5/163 useless extension candidates. Maximal degree in co-relation 679. Up to 92 conditions per place. [2021-03-26 10:10:38,183 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 16 selfloop transitions, 12 changer transitions 0/44 dead transitions. [2021-03-26 10:10:38,183 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 316 flow [2021-03-26 10:10:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2021-03-26 10:10:38,186 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7756906077348066 [2021-03-26 10:10:38,186 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2021-03-26 10:10:38,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2021-03-26 10:10:38,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:38,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2021-03-26 10:10:38,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states 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:10:38,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:38,190 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:38,190 INFO L185 Difference]: Start difference. First operand has 47 places, 38 transitions, 228 flow. Second operand 5 states and 702 transitions. [2021-03-26 10:10:38,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 316 flow [2021-03-26 10:10:38,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 311 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-26 10:10:38,194 INFO L241 Difference]: Finished difference. Result has 51 places, 40 transitions, 271 flow [2021-03-26 10:10:38,195 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=271, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2021-03-26 10:10:38,195 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2021-03-26 10:10:38,195 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:38,195 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 40 transitions, 271 flow [2021-03-26 10:10:38,195 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 40 transitions, 271 flow [2021-03-26 10:10:38,196 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 40 transitions, 271 flow [2021-03-26 10:10:38,210 INFO L129 PetriNetUnfolder]: 34/105 cut-off events. [2021-03-26 10:10:38,211 INFO L130 PetriNetUnfolder]: For 301/318 co-relation queries the response was YES. [2021-03-26 10:10:38,211 INFO L84 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 105 events. 34/105 cut-off events. For 301/318 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 434 event pairs, 9 based on Foata normal form. 5/101 useless extension candidates. Maximal degree in co-relation 378. Up to 35 conditions per place. [2021-03-26 10:10:38,212 INFO L142 LiptonReduction]: Number of co-enabled transitions 388 [2021-03-26 10:10:38,217 INFO L154 LiptonReduction]: Checked pairs total: 335 [2021-03-26 10:10:38,217 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:38,217 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 10:10:38,220 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 271 flow [2021-03-26 10:10:38,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 137.83333333333334) internal successors, (827), 6 states have internal predecessors, (827), 0 states have call successors, (0), 0 states 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:10:38,220 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:38,221 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:38,221 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:10:38,221 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:38,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:38,221 INFO L82 PathProgramCache]: Analyzing trace with hash -463580543, now seen corresponding path program 4 times [2021-03-26 10:10:38,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:38,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230399099] [2021-03-26 10:10:38,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:38,310 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:38,317 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-03-26 10:10:38,318 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-03-26 10:10:38,331 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-26 10:10:38,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-26 10:10:38,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:38,348 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:10:38,348 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230399099] [2021-03-26 10:10:38,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:38,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:38,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121639828] [2021-03-26 10:10:38,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:38,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:38,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:38,351 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 181 [2021-03-26 10:10:38,351 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 271 flow. Second operand has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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:10:38,352 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:38,352 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 181 [2021-03-26 10:10:38,352 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:38,439 INFO L129 PetriNetUnfolder]: 60/165 cut-off events. [2021-03-26 10:10:38,439 INFO L130 PetriNetUnfolder]: For 487/493 co-relation queries the response was YES. [2021-03-26 10:10:38,440 INFO L84 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 165 events. 60/165 cut-off events. For 487/493 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 803 event pairs, 1 based on Foata normal form. 5/161 useless extension candidates. Maximal degree in co-relation 736. Up to 73 conditions per place. [2021-03-26 10:10:38,441 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 12 selfloop transitions, 18 changer transitions 0/46 dead transitions. [2021-03-26 10:10:38,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 46 transitions, 369 flow [2021-03-26 10:10:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:10:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:10:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 839 transitions. [2021-03-26 10:10:38,445 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7725598526703499 [2021-03-26 10:10:38,445 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 839 transitions. [2021-03-26 10:10:38,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 839 transitions. [2021-03-26 10:10:38,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:38,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 839 transitions. [2021-03-26 10:10:38,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 139.83333333333334) internal successors, (839), 6 states have internal predecessors, (839), 0 states have call successors, (0), 0 states 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:10:38,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states 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:10:38,450 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 181.0) internal successors, (1267), 7 states have internal predecessors, (1267), 0 states have call successors, (0), 0 states 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:10:38,450 INFO L185 Difference]: Start difference. First operand has 51 places, 40 transitions, 271 flow. Second operand 6 states and 839 transitions. [2021-03-26 10:10:38,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 46 transitions, 369 flow [2021-03-26 10:10:38,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 46 transitions, 342 flow, removed 3 selfloop flow, removed 4 redundant places. [2021-03-26 10:10:38,454 INFO L241 Difference]: Finished difference. Result has 53 places, 42 transitions, 314 flow [2021-03-26 10:10:38,454 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2021-03-26 10:10:38,454 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2021-03-26 10:10:38,454 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:38,454 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 42 transitions, 314 flow [2021-03-26 10:10:38,455 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 42 transitions, 314 flow [2021-03-26 10:10:38,455 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 42 transitions, 314 flow [2021-03-26 10:10:38,468 INFO L129 PetriNetUnfolder]: 31/100 cut-off events. [2021-03-26 10:10:38,468 INFO L130 PetriNetUnfolder]: For 342/356 co-relation queries the response was YES. [2021-03-26 10:10:38,468 INFO L84 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 100 events. 31/100 cut-off events. For 342/356 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 387 event pairs, 6 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 391. Up to 37 conditions per place. [2021-03-26 10:10:38,469 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-26 10:10:38,475 INFO L154 LiptonReduction]: Checked pairs total: 379 [2021-03-26 10:10:38,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:38,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-26 10:10:38,475 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 314 flow [2021-03-26 10:10:38,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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:10:38,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:38,476 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:38,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:10:38,476 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:38,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:38,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1124098012, now seen corresponding path program 1 times [2021-03-26 10:10:38,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:38,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802823972] [2021-03-26 10:10:38,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:38,566 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:38,575 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,575 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-26 10:10:38,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:38,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-26 10:10:38,605 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,606 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-26 10:10:38,615 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:10:38,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802823972] [2021-03-26 10:10:38,615 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:38,615 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:10:38,615 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621608642] [2021-03-26 10:10:38,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:10:38,616 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:38,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:10:38,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:10:38,617 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 181 [2021-03-26 10:10:38,618 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states 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:10:38,618 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:38,618 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 181 [2021-03-26 10:10:38,618 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:38,719 INFO L129 PetriNetUnfolder]: 62/175 cut-off events. [2021-03-26 10:10:38,719 INFO L130 PetriNetUnfolder]: For 585/591 co-relation queries the response was YES. [2021-03-26 10:10:38,721 INFO L84 FinitePrefix]: Finished finitePrefix Result has 861 conditions, 175 events. 62/175 cut-off events. For 585/591 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 893 event pairs, 1 based on Foata normal form. 3/169 useless extension candidates. Maximal degree in co-relation 840. Up to 84 conditions per place. [2021-03-26 10:10:38,722 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 21 selfloop transitions, 10 changer transitions 0/47 dead transitions. [2021-03-26 10:10:38,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 47 transitions, 412 flow [2021-03-26 10:10:38,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:38,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:38,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 677 transitions. [2021-03-26 10:10:38,725 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7480662983425415 [2021-03-26 10:10:38,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 677 transitions. [2021-03-26 10:10:38,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 677 transitions. [2021-03-26 10:10:38,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:38,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 677 transitions. [2021-03-26 10:10:38,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:38,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:38,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:38,730 INFO L185 Difference]: Start difference. First operand has 53 places, 42 transitions, 314 flow. Second operand 5 states and 677 transitions. [2021-03-26 10:10:38,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 47 transitions, 412 flow [2021-03-26 10:10:38,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 381 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-03-26 10:10:38,735 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 325 flow [2021-03-26 10:10:38,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-26 10:10:38,735 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 5 predicate places. [2021-03-26 10:10:38,735 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:38,735 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 325 flow [2021-03-26 10:10:38,735 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 325 flow [2021-03-26 10:10:38,736 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 325 flow [2021-03-26 10:10:38,749 INFO L129 PetriNetUnfolder]: 32/105 cut-off events. [2021-03-26 10:10:38,749 INFO L130 PetriNetUnfolder]: For 421/435 co-relation queries the response was YES. [2021-03-26 10:10:38,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 423 conditions, 105 events. 32/105 cut-off events. For 421/435 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 440 event pairs, 6 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 403. Up to 39 conditions per place. [2021-03-26 10:10:38,751 INFO L142 LiptonReduction]: Number of co-enabled transitions 416 [2021-03-26 10:10:38,757 INFO L154 LiptonReduction]: Checked pairs total: 371 [2021-03-26 10:10:38,757 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:38,757 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 10:10:38,758 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 325 flow [2021-03-26 10:10:38,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 132.85714285714286) internal successors, (930), 7 states have internal predecessors, (930), 0 states have call successors, (0), 0 states 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:10:38,758 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:38,758 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:38,758 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:10:38,759 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:38,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1970346980, now seen corresponding path program 2 times [2021-03-26 10:10:38,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:38,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776379395] [2021-03-26 10:10:38,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:38,830 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,830 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:38,836 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:10:38,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,840 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-26 10:10:38,858 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,859 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:10:38,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:38,883 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:10:38,902 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:10:38,903 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776379395] [2021-03-26 10:10:38,903 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:38,903 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:38,903 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171246061] [2021-03-26 10:10:38,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:38,904 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:38,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:38,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:38,905 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 181 [2021-03-26 10:10:38,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 325 flow. Second operand has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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:10:38,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:38,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 181 [2021-03-26 10:10:38,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:38,995 INFO L129 PetriNetUnfolder]: 55/178 cut-off events. [2021-03-26 10:10:38,995 INFO L130 PetriNetUnfolder]: For 643/651 co-relation queries the response was YES. [2021-03-26 10:10:38,996 INFO L84 FinitePrefix]: Finished finitePrefix Result has 840 conditions, 178 events. 55/178 cut-off events. For 643/651 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 935 event pairs, 3 based on Foata normal form. 5/173 useless extension candidates. Maximal degree in co-relation 818. Up to 73 conditions per place. [2021-03-26 10:10:38,997 INFO L132 encePairwiseOnDemand]: 176/181 looper letters, 21 selfloop transitions, 9 changer transitions 0/46 dead transitions. [2021-03-26 10:10:38,997 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 46 transitions, 403 flow [2021-03-26 10:10:38,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:38,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:39,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 690 transitions. [2021-03-26 10:10:39,000 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7624309392265194 [2021-03-26 10:10:39,000 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 690 transitions. [2021-03-26 10:10:39,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 690 transitions. [2021-03-26 10:10:39,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:39,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 690 transitions. [2021-03-26 10:10:39,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.0) internal successors, (690), 5 states have internal predecessors, (690), 0 states have call successors, (0), 0 states 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:10:39,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,004 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 325 flow. Second operand 5 states and 690 transitions. [2021-03-26 10:10:39,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 46 transitions, 403 flow [2021-03-26 10:10:39,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 46 transitions, 387 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:39,007 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 334 flow [2021-03-26 10:10:39,008 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=334, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2021-03-26 10:10:39,008 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2021-03-26 10:10:39,008 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:39,009 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 334 flow [2021-03-26 10:10:39,009 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 334 flow [2021-03-26 10:10:39,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 56 places, 43 transitions, 334 flow [2021-03-26 10:10:39,022 INFO L129 PetriNetUnfolder]: 28/104 cut-off events. [2021-03-26 10:10:39,023 INFO L130 PetriNetUnfolder]: For 483/495 co-relation queries the response was YES. [2021-03-26 10:10:39,023 INFO L84 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 104 events. 28/104 cut-off events. For 483/495 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 444 event pairs, 5 based on Foata normal form. 1/98 useless extension candidates. Maximal degree in co-relation 400. Up to 36 conditions per place. [2021-03-26 10:10:39,024 INFO L142 LiptonReduction]: Number of co-enabled transitions 414 [2021-03-26 10:10:39,029 INFO L154 LiptonReduction]: Checked pairs total: 418 [2021-03-26 10:10:39,029 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:39,030 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-26 10:10:39,031 INFO L480 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 334 flow [2021-03-26 10:10:39,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states 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:10:39,031 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:39,031 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:39,031 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:10:39,031 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:39,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:39,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1971109890, now seen corresponding path program 1 times [2021-03-26 10:10:39,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:39,033 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899861833] [2021-03-26 10:10:39,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:39,097 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,100 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,101 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:39,104 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:10:39,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899861833] [2021-03-26 10:10:39,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:39,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:39,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772510705] [2021-03-26 10:10:39,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:39,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:39,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:39,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:39,106 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:10:39,107 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:10:39,107 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:39,107 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:10:39,107 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:39,206 INFO L129 PetriNetUnfolder]: 178/417 cut-off events. [2021-03-26 10:10:39,206 INFO L130 PetriNetUnfolder]: For 1021/1195 co-relation queries the response was YES. [2021-03-26 10:10:39,208 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 417 events. 178/417 cut-off events. For 1021/1195 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 2667 event pairs, 63 based on Foata normal form. 85/420 useless extension candidates. Maximal degree in co-relation 1314. Up to 251 conditions per place. [2021-03-26 10:10:39,210 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 13 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2021-03-26 10:10:39,210 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 54 transitions, 398 flow [2021-03-26 10:10:39,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:10:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:10:39,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 770 transitions. [2021-03-26 10:10:39,213 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.850828729281768 [2021-03-26 10:10:39,213 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 770 transitions. [2021-03-26 10:10:39,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 770 transitions. [2021-03-26 10:10:39,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:39,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 770 transitions. [2021-03-26 10:10:39,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 154.0) internal successors, (770), 5 states have internal predecessors, (770), 0 states have call successors, (0), 0 states 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:10:39,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,217 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,217 INFO L185 Difference]: Start difference. First operand has 56 places, 43 transitions, 334 flow. Second operand 5 states and 770 transitions. [2021-03-26 10:10:39,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 54 transitions, 398 flow [2021-03-26 10:10:39,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 54 transitions, 389 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:39,221 INFO L241 Difference]: Finished difference. Result has 61 places, 50 transitions, 397 flow [2021-03-26 10:10:39,221 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2021-03-26 10:10:39,221 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2021-03-26 10:10:39,221 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:39,221 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 50 transitions, 397 flow [2021-03-26 10:10:39,221 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 50 transitions, 397 flow [2021-03-26 10:10:39,222 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 50 transitions, 397 flow [2021-03-26 10:10:39,260 INFO L129 PetriNetUnfolder]: 138/357 cut-off events. [2021-03-26 10:10:39,261 INFO L130 PetriNetUnfolder]: For 1217/1341 co-relation queries the response was YES. [2021-03-26 10:10:39,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1450 conditions, 357 events. 138/357 cut-off events. For 1217/1341 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 2278 event pairs, 42 based on Foata normal form. 12/329 useless extension candidates. Maximal degree in co-relation 1426. Up to 181 conditions per place. [2021-03-26 10:10:39,266 INFO L142 LiptonReduction]: Number of co-enabled transitions 524 [2021-03-26 10:10:39,278 INFO L154 LiptonReduction]: Checked pairs total: 231 [2021-03-26 10:10:39,278 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:39,278 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-03-26 10:10:39,281 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 397 flow [2021-03-26 10:10:39,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states 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:10:39,281 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:39,281 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:39,281 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:10:39,281 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:39,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:39,282 INFO L82 PathProgramCache]: Analyzing trace with hash -125433117, now seen corresponding path program 1 times [2021-03-26 10:10:39,282 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:39,282 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876176539] [2021-03-26 10:10:39,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:39,331 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,340 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,341 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:39,341 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:10:39,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876176539] [2021-03-26 10:10:39,341 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:39,341 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:10:39,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502304849] [2021-03-26 10:10:39,341 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:10:39,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:39,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:10:39,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:10:39,343 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:10:39,343 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 397 flow. Second operand has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states 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:10:39,343 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:39,343 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:10:39,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:39,429 INFO L129 PetriNetUnfolder]: 114/305 cut-off events. [2021-03-26 10:10:39,429 INFO L130 PetriNetUnfolder]: For 1367/2326 co-relation queries the response was YES. [2021-03-26 10:10:39,431 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 305 events. 114/305 cut-off events. For 1367/2326 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 1809 event pairs, 7 based on Foata normal form. 181/444 useless extension candidates. Maximal degree in co-relation 1220. Up to 182 conditions per place. [2021-03-26 10:10:39,433 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 8 selfloop transitions, 15 changer transitions 5/56 dead transitions. [2021-03-26 10:10:39,433 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 56 transitions, 447 flow [2021-03-26 10:10:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:39,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:39,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1078 transitions. [2021-03-26 10:10:39,436 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.850828729281768 [2021-03-26 10:10:39,436 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1078 transitions. [2021-03-26 10:10:39,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1078 transitions. [2021-03-26 10:10:39,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:39,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1078 transitions. [2021-03-26 10:10:39,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 154.0) internal successors, (1078), 7 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states 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:10:39,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,441 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,441 INFO L185 Difference]: Start difference. First operand has 61 places, 50 transitions, 397 flow. Second operand 7 states and 1078 transitions. [2021-03-26 10:10:39,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 56 transitions, 447 flow [2021-03-26 10:10:39,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 56 transitions, 436 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:10:39,446 INFO L241 Difference]: Finished difference. Result has 68 places, 49 transitions, 399 flow [2021-03-26 10:10:39,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=399, PETRI_PLACES=68, PETRI_TRANSITIONS=49} [2021-03-26 10:10:39,446 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2021-03-26 10:10:39,446 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:39,446 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 49 transitions, 399 flow [2021-03-26 10:10:39,446 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 49 transitions, 399 flow [2021-03-26 10:10:39,447 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 68 places, 49 transitions, 399 flow [2021-03-26 10:10:39,469 INFO L129 PetriNetUnfolder]: 63/222 cut-off events. [2021-03-26 10:10:39,469 INFO L130 PetriNetUnfolder]: For 1089/1323 co-relation queries the response was YES. [2021-03-26 10:10:39,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1033 conditions, 222 events. 63/222 cut-off events. For 1089/1323 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1372 event pairs, 7 based on Foata normal form. 10/215 useless extension candidates. Maximal degree in co-relation 1006. Up to 128 conditions per place. [2021-03-26 10:10:39,472 INFO L142 LiptonReduction]: Number of co-enabled transitions 566 [2021-03-26 10:10:39,485 INFO L154 LiptonReduction]: Checked pairs total: 424 [2021-03-26 10:10:39,486 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:10:39,486 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 10:10:39,486 INFO L480 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 383 flow [2021-03-26 10:10:39,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 150.8) internal successors, (754), 5 states have internal predecessors, (754), 0 states have call successors, (0), 0 states 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:10:39,487 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:39,487 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:39,487 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:10:39,487 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash -350858341, now seen corresponding path program 1 times [2021-03-26 10:10:39,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:39,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203508008] [2021-03-26 10:10:39,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:39,528 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:39,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,532 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:10:39,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203508008] [2021-03-26 10:10:39,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:39,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:10:39,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631377385] [2021-03-26 10:10:39,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:10:39,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:39,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:10:39,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:10:39,534 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 181 [2021-03-26 10:10:39,534 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 383 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:10:39,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:39,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 181 [2021-03-26 10:10:39,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:39,567 INFO L129 PetriNetUnfolder]: 63/206 cut-off events. [2021-03-26 10:10:39,567 INFO L130 PetriNetUnfolder]: For 1031/1077 co-relation queries the response was YES. [2021-03-26 10:10:39,568 INFO L84 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 206 events. 63/206 cut-off events. For 1031/1077 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1101 event pairs, 12 based on Foata normal form. 7/200 useless extension candidates. Maximal degree in co-relation 951. Up to 112 conditions per place. [2021-03-26 10:10:39,569 INFO L132 encePairwiseOnDemand]: 178/181 looper letters, 3 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2021-03-26 10:10:39,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 41 transitions, 338 flow [2021-03-26 10:10:39,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:10:39,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:10:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2021-03-26 10:10:39,571 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8895027624309392 [2021-03-26 10:10:39,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 483 transitions. [2021-03-26 10:10:39,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 483 transitions. [2021-03-26 10:10:39,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:39,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 483 transitions. [2021-03-26 10:10:39,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.0) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states 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:10:39,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,574 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 181.0) internal successors, (724), 4 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,574 INFO L185 Difference]: Start difference. First operand has 68 places, 47 transitions, 383 flow. Second operand 3 states and 483 transitions. [2021-03-26 10:10:39,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 41 transitions, 338 flow [2021-03-26 10:10:39,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 41 transitions, 302 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-03-26 10:10:39,580 INFO L241 Difference]: Finished difference. Result has 60 places, 41 transitions, 301 flow [2021-03-26 10:10:39,580 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=301, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2021-03-26 10:10:39,580 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2021-03-26 10:10:39,580 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:39,580 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 60 places, 41 transitions, 301 flow [2021-03-26 10:10:39,580 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 60 places, 41 transitions, 301 flow [2021-03-26 10:10:39,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 60 places, 41 transitions, 301 flow [2021-03-26 10:10:39,601 INFO L129 PetriNetUnfolder]: 63/206 cut-off events. [2021-03-26 10:10:39,601 INFO L130 PetriNetUnfolder]: For 568/583 co-relation queries the response was YES. [2021-03-26 10:10:39,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 206 events. 63/206 cut-off events. For 568/583 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1135 event pairs, 12 based on Foata normal form. 1/195 useless extension candidates. Maximal degree in co-relation 780. Up to 76 conditions per place. [2021-03-26 10:10:39,603 INFO L142 LiptonReduction]: Number of co-enabled transitions 368 [2021-03-26 10:10:39,608 INFO L154 LiptonReduction]: Checked pairs total: 150 [2021-03-26 10:10:39,608 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:10:39,608 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-26 10:10:39,609 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 301 flow [2021-03-26 10:10:39,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states 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:10:39,609 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:39,609 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:39,609 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:10:39,609 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:39,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:39,610 INFO L82 PathProgramCache]: Analyzing trace with hash -390612706, now seen corresponding path program 1 times [2021-03-26 10:10:39,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:39,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379472781] [2021-03-26 10:10:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:39,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,664 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,669 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:39,677 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:39,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:39,678 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:10:39,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379472781] [2021-03-26 10:10:39,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:39,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:10:39,678 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796593065] [2021-03-26 10:10:39,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:10:39,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:10:39,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:10:39,680 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 181 [2021-03-26 10:10:39,681 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 301 flow. Second operand has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,681 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:39,681 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 181 [2021-03-26 10:10:39,681 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:39,749 INFO L129 PetriNetUnfolder]: 105/251 cut-off events. [2021-03-26 10:10:39,749 INFO L130 PetriNetUnfolder]: For 511/780 co-relation queries the response was YES. [2021-03-26 10:10:39,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 999 conditions, 251 events. 105/251 cut-off events. For 511/780 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1272 event pairs, 0 based on Foata normal form. 68/281 useless extension candidates. Maximal degree in co-relation 973. Up to 109 conditions per place. [2021-03-26 10:10:39,751 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 11 changer transitions 6/48 dead transitions. [2021-03-26 10:10:39,751 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 48 transitions, 377 flow [2021-03-26 10:10:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:10:39,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:10:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1072 transitions. [2021-03-26 10:10:39,755 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.846093133385951 [2021-03-26 10:10:39,755 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1072 transitions. [2021-03-26 10:10:39,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1072 transitions. [2021-03-26 10:10:39,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:39,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1072 transitions. [2021-03-26 10:10:39,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 153.14285714285714) internal successors, (1072), 7 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states 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:10:39,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,760 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:39,760 INFO L185 Difference]: Start difference. First operand has 60 places, 41 transitions, 301 flow. Second operand 7 states and 1072 transitions. [2021-03-26 10:10:39,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 48 transitions, 377 flow [2021-03-26 10:10:39,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 48 transitions, 339 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-03-26 10:10:39,764 INFO L241 Difference]: Finished difference. Result has 66 places, 40 transitions, 301 flow [2021-03-26 10:10:39,764 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=301, PETRI_PLACES=66, PETRI_TRANSITIONS=40} [2021-03-26 10:10:39,764 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2021-03-26 10:10:39,764 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:39,764 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 40 transitions, 301 flow [2021-03-26 10:10:39,764 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 40 transitions, 301 flow [2021-03-26 10:10:39,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 40 transitions, 301 flow [2021-03-26 10:10:39,773 INFO L129 PetriNetUnfolder]: 17/76 cut-off events. [2021-03-26 10:10:39,774 INFO L130 PetriNetUnfolder]: For 206/220 co-relation queries the response was YES. [2021-03-26 10:10:39,774 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 76 events. 17/76 cut-off events. For 206/220 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 283 event pairs, 0 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 300. Up to 30 conditions per place. [2021-03-26 10:10:39,775 INFO L142 LiptonReduction]: Number of co-enabled transitions 242 [2021-03-26 10:10:40,100 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:10:40,232 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-03-26 10:10:40,611 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:10:40,742 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:10:41,352 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 194 [2021-03-26 10:10:41,569 WARN L205 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-26 10:10:42,957 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 348 DAG size of output: 270 [2021-03-26 10:10:43,511 WARN L205 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 252 [2021-03-26 10:10:43,518 INFO L154 LiptonReduction]: Checked pairs total: 323 [2021-03-26 10:10:43,518 INFO L156 LiptonReduction]: Total number of compositions: 8 [2021-03-26 10:10:43,518 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3754 [2021-03-26 10:10:43,519 INFO L480 AbstractCegarLoop]: Abstraction has has 60 places, 35 transitions, 289 flow [2021-03-26 10:10:43,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 150.83333333333334) internal successors, (905), 6 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,519 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:43,519 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:10:43,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:10:43,519 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:43,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:43,520 INFO L82 PathProgramCache]: Analyzing trace with hash -441172230, now seen corresponding path program 1 times [2021-03-26 10:10:43,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:43,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896217721] [2021-03-26 10:10:43,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:10:43,572 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:10:43,573 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:43,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:10:43,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:10:43,579 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:10:43,579 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896217721] [2021-03-26 10:10:43,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:10:43,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:10:43,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844063492] [2021-03-26 10:10:43,580 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:10:43,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:10:43,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:10:43,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:10:43,581 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 188 [2021-03-26 10:10:43,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 35 transitions, 289 flow. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:43,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:10:43,582 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 188 [2021-03-26 10:10:43,582 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:10:43,608 INFO L129 PetriNetUnfolder]: 29/97 cut-off events. [2021-03-26 10:10:43,608 INFO L130 PetriNetUnfolder]: For 833/867 co-relation queries the response was YES. [2021-03-26 10:10:43,608 INFO L84 FinitePrefix]: Finished finitePrefix Result has 435 conditions, 97 events. 29/97 cut-off events. For 833/867 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 383 event pairs, 0 based on Foata normal form. 11/104 useless extension candidates. Maximal degree in co-relation 407. Up to 45 conditions per place. [2021-03-26 10:10:43,609 INFO L132 encePairwiseOnDemand]: 185/188 looper letters, 3 selfloop transitions, 1 changer transitions 11/36 dead transitions. [2021-03-26 10:10:43,609 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 36 transitions, 301 flow [2021-03-26 10:10:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:10:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:10:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2021-03-26 10:10:43,611 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8803191489361702 [2021-03-26 10:10:43,611 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2021-03-26 10:10:43,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2021-03-26 10:10:43,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:10:43,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2021-03-26 10:10:43,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 0 states 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:10:43,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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:10:43,615 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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:10:43,615 INFO L185 Difference]: Start difference. First operand has 60 places, 35 transitions, 289 flow. Second operand 4 states and 662 transitions. [2021-03-26 10:10:43,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 36 transitions, 301 flow [2021-03-26 10:10:43,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 36 transitions, 261 flow, removed 9 selfloop flow, removed 9 redundant places. [2021-03-26 10:10:43,618 INFO L241 Difference]: Finished difference. Result has 56 places, 25 transitions, 162 flow [2021-03-26 10:10:43,618 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=188, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=56, PETRI_TRANSITIONS=25} [2021-03-26 10:10:43,618 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2021-03-26 10:10:43,618 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:10:43,618 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 25 transitions, 162 flow [2021-03-26 10:10:43,619 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 25 transitions, 162 flow [2021-03-26 10:10:43,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 25 transitions, 162 flow [2021-03-26 10:10:43,624 INFO L129 PetriNetUnfolder]: 8/38 cut-off events. [2021-03-26 10:10:43,624 INFO L130 PetriNetUnfolder]: For 145/149 co-relation queries the response was YES. [2021-03-26 10:10:43,624 INFO L84 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 38 events. 8/38 cut-off events. For 145/149 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 67 event pairs, 0 based on Foata normal form. 3/40 useless extension candidates. Maximal degree in co-relation 124. Up to 12 conditions per place. [2021-03-26 10:10:43,624 INFO L142 LiptonReduction]: Number of co-enabled transitions 76 [2021-03-26 10:10:43,784 WARN L205 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-26 10:10:44,191 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-26 10:10:44,320 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-26 10:10:44,474 INFO L154 LiptonReduction]: Checked pairs total: 16 [2021-03-26 10:10:44,474 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:10:44,474 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 856 [2021-03-26 10:10:44,475 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 24 transitions, 175 flow [2021-03-26 10:10:44,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:10:44,475 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:10:44,475 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:10:44,475 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-26 10:10:44,476 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:10:44,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:10:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash -226648767, now seen corresponding path program 1 times [2021-03-26 10:10:44,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:10:44,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891019822] [2021-03-26 10:10:44,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:10:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:44,496 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:10:44,517 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:10:44,541 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:10:44,541 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:10:44,541 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-03-26 10:10:44,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:10:44 BasicIcfg [2021-03-26 10:10:44,625 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:10:44,625 INFO L168 Benchmark]: Toolchain (without parser) took 23965.56 ms. Allocated memory was 255.9 MB in the beginning and 700.4 MB in the end (delta: 444.6 MB). Free memory was 234.5 MB in the beginning and 668.9 MB in the end (delta: -434.4 MB). Peak memory consumption was 417.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:44,626 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.6 MB in the end (delta: 174.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:10:44,626 INFO L168 Benchmark]: CACSL2BoogieTranslator took 491.93 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.5 MB in the beginning and 294.7 MB in the end (delta: -60.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:44,626 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.13 ms. Allocated memory is still 335.5 MB. Free memory was 294.7 MB in the beginning and 291.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:44,626 INFO L168 Benchmark]: Boogie Preprocessor took 36.69 ms. Allocated memory is still 335.5 MB. Free memory was 291.9 MB in the beginning and 289.8 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:10:44,626 INFO L168 Benchmark]: RCFGBuilder took 1506.47 ms. Allocated memory is still 335.5 MB. Free memory was 289.8 MB in the beginning and 225.1 MB in the end (delta: 64.8 MB). Peak memory consumption was 70.0 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:44,627 INFO L168 Benchmark]: TraceAbstraction took 21841.51 ms. Allocated memory was 335.5 MB in the beginning and 700.4 MB in the end (delta: 364.9 MB). Free memory was 225.1 MB in the beginning and 668.9 MB in the end (delta: -443.8 MB). Peak memory consumption was 327.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:10:44,636 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.45 ms. Allocated memory is still 255.9 MB. Free memory was 237.8 MB in the beginning and 237.6 MB in the end (delta: 174.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 491.93 ms. Allocated memory was 255.9 MB in the beginning and 335.5 MB in the end (delta: 79.7 MB). Free memory was 234.5 MB in the beginning and 294.7 MB in the end (delta: -60.2 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 71.13 ms. Allocated memory is still 335.5 MB. Free memory was 294.7 MB in the beginning and 291.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 36.69 ms. Allocated memory is still 335.5 MB. Free memory was 291.9 MB in the beginning and 289.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1506.47 ms. Allocated memory is still 335.5 MB. Free memory was 289.8 MB in the beginning and 225.1 MB in the end (delta: 64.8 MB). Peak memory consumption was 70.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21841.51 ms. Allocated memory was 335.5 MB in the beginning and 700.4 MB in the end (delta: 364.9 MB). Free memory was 225.1 MB in the beginning and 668.9 MB in the end (delta: -443.8 MB). Peak memory consumption was 327.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7749.7ms, 105 PlacesBefore, 49 PlacesAfterwards, 97 TransitionsBefore, 40 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 26 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2726 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 1527, positive unconditional: 0, negative: 74, negative conditional: 74, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1601, positive: 1527, positive conditional: 0, positive unconditional: 1527, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1212, positive: 1177, positive conditional: 0, positive unconditional: 1177, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1212, positive: 1171, positive conditional: 0, positive unconditional: 1171, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 498, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 479, negative conditional: 0, negative unconditional: 479, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1601, positive: 350, positive conditional: 0, positive unconditional: 350, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 1212, unknown conditional: 0, unknown unconditional: 1212] , Statistics on independence cache: Total cache size (in pairs): 1212, Positive cache size: 1177, Positive conditional cache size: 0, Positive unconditional cache size: 1177, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3830.3ms, 46 PlacesBefore, 32 PlacesAfterwards, 34 TransitionsBefore, 23 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 9 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1054 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 306, positive unconditional: 0, negative: 78, negative conditional: 78, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 384, positive: 306, positive conditional: 9, positive unconditional: 297, negative: 78, negative conditional: 2, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 384, positive: 306, positive conditional: 9, positive unconditional: 297, negative: 78, negative conditional: 2, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 68, positive: 46, positive conditional: 2, positive unconditional: 44, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 68, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 28, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 22, negative conditional: 2, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 500, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 442, negative conditional: 74, negative unconditional: 367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 384, positive: 260, positive conditional: 7, positive unconditional: 253, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 68, unknown conditional: 4, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 1280, Positive cache size: 1223, Positive conditional cache size: 2, Positive unconditional cache size: 1221, Negative cache size: 57, Negative conditional cache size: 2, Negative unconditional cache size: 55, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1228.4ms, 33 PlacesBefore, 31 PlacesAfterwards, 25 TransitionsBefore, 23 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 633 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 148, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 196, positive: 148, positive conditional: 0, positive unconditional: 148, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 13, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 94, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 196, positive: 141, positive conditional: 0, positive unconditional: 141, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 13, unknown conditional: 0, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 1293, Positive cache size: 1230, Positive conditional cache size: 2, Positive unconditional cache size: 1228, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4ms, 33 PlacesBefore, 33 PlacesAfterwards, 23 TransitionsBefore, 23 TransitionsAfterwards, 236 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 198 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 71, positive: 56, positive conditional: 56, 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: 71, positive: 56, positive conditional: 0, positive unconditional: 56, 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: 71, positive: 56, positive conditional: 0, positive unconditional: 56, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 71, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1299, Positive cache size: 1236, Positive conditional cache size: 2, Positive unconditional cache size: 1234, Negative cache size: 63, Negative conditional cache size: 2, Negative unconditional cache size: 61, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 81.7ms, 36 PlacesBefore, 36 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 278 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 162 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 11, negative conditional: 11, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, positive: 29, positive conditional: 1, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 29, positive conditional: 1, positive unconditional: 28, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 2, positive conditional: 0, positive unconditional: 2, 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 27, positive conditional: 1, positive unconditional: 26, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1303, Positive cache size: 1238, Positive conditional cache size: 2, Positive unconditional cache size: 1236, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8ms, 42 PlacesBefore, 42 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 344 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 153 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 47, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 47, positive: 39, positive conditional: 2, positive unconditional: 37, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 47, positive: 39, positive conditional: 2, positive unconditional: 37, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 47, positive: 35, positive conditional: 2, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 1307, Positive cache size: 1242, Positive conditional cache size: 2, Positive unconditional cache size: 1240, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 775.1ms, 47 PlacesBefore, 47 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 370 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 515 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 160, positive: 132, positive conditional: 132, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 160, positive: 132, positive conditional: 12, positive unconditional: 120, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 160, positive: 132, positive conditional: 12, positive unconditional: 120, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 160, positive: 127, positive conditional: 12, positive unconditional: 115, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1247, Positive conditional cache size: 2, Positive unconditional cache size: 1245, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 41 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.9ms, 51 PlacesBefore, 51 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 335 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, positive: 66, positive conditional: 66, 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: 84, positive: 66, positive conditional: 10, positive unconditional: 56, 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: 84, positive: 66, positive conditional: 10, positive unconditional: 56, 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: 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: 84, positive: 66, positive conditional: 10, positive unconditional: 56, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1312, Positive cache size: 1247, Positive conditional cache size: 2, Positive unconditional cache size: 1245, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.2ms, 53 PlacesBefore, 53 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 379 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 94, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 20, negative conditional: 20, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 94, positive: 74, positive conditional: 9, positive unconditional: 65, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 94, positive: 74, positive conditional: 9, positive unconditional: 65, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 94, positive: 73, positive conditional: 8, positive unconditional: 65, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1313, Positive cache size: 1248, Positive conditional cache size: 3, Positive unconditional cache size: 1245, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.8ms, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 416 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 371 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 112, positive: 93, positive conditional: 93, positive unconditional: 0, negative: 19, negative conditional: 19, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 112, positive: 93, positive conditional: 32, positive unconditional: 61, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 112, positive: 93, positive conditional: 32, positive unconditional: 61, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 112, positive: 92, positive conditional: 31, positive unconditional: 61, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1249, Positive conditional cache size: 4, Positive unconditional cache size: 1245, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.6ms, 56 PlacesBefore, 56 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 418 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 126, positive: 104, positive conditional: 104, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 126, positive: 104, positive conditional: 34, positive unconditional: 70, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 104, positive conditional: 34, positive unconditional: 70, negative: 22, negative conditional: 0, negative unconditional: 22, 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: 126, positive: 104, positive conditional: 34, positive unconditional: 70, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1249, Positive conditional cache size: 4, Positive unconditional cache size: 1245, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.8ms, 61 PlacesBefore, 61 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 231 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 56, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 56, positive: 47, positive conditional: 19, positive unconditional: 28, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 47, positive conditional: 19, positive unconditional: 28, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 56, positive: 47, positive conditional: 19, positive unconditional: 28, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1314, Positive cache size: 1249, Positive conditional cache size: 4, Positive unconditional cache size: 1245, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 11 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.5ms, 68 PlacesBefore, 68 PlacesAfterwards, 49 TransitionsBefore, 47 TransitionsAfterwards, 566 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 424 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 162, positive: 146, positive conditional: 146, 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: 162, positive: 146, positive conditional: 85, positive unconditional: 61, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 162, positive: 146, positive conditional: 85, positive unconditional: 61, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 7, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, positive: 136, positive conditional: 78, positive unconditional: 58, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 10, unknown conditional: 7, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1324, Positive cache size: 1259, Positive conditional cache size: 11, Positive unconditional cache size: 1248, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.6ms, 60 PlacesBefore, 60 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 368 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 150 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 60, positive: 52, positive conditional: 52, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 60, positive: 52, positive conditional: 28, positive unconditional: 24, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 60, positive: 52, positive conditional: 28, positive unconditional: 24, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 2, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 60, positive: 50, positive conditional: 26, positive unconditional: 24, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1326, Positive cache size: 1261, Positive conditional cache size: 13, Positive unconditional cache size: 1248, Negative cache size: 65, Negative conditional cache size: 2, Negative unconditional cache size: 63, Eliminated conditions: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3753.8ms, 66 PlacesBefore, 60 PlacesAfterwards, 40 TransitionsBefore, 35 TransitionsAfterwards, 242 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 5 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 8 TotalNumberOfCompositions, 323 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 131, positive: 109, positive conditional: 109, positive unconditional: 0, negative: 22, negative conditional: 22, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 131, positive: 109, positive conditional: 44, positive unconditional: 65, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 131, positive: 109, positive conditional: 44, positive unconditional: 65, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 5, positive conditional: 2, positive unconditional: 3, 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: 7, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 6, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 131, positive: 104, positive conditional: 42, positive unconditional: 62, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 7, unknown conditional: 2, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 1333, Positive cache size: 1266, Positive conditional cache size: 15, Positive unconditional cache size: 1251, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 75 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 855.5ms, 56 PlacesBefore, 49 PlacesAfterwards, 25 TransitionsBefore, 24 TransitionsAfterwards, 76 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 16 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16, positive: 16, positive conditional: 16, 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: 16, positive: 16, positive conditional: 11, 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: 16, positive: 16, positive conditional: 11, 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: 8, positive: 8, positive conditional: 6, 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: 8, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 16, positive: 8, positive conditional: 5, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 8, unknown conditional: 6, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1341, Positive cache size: 1274, Positive conditional cache size: 21, Positive unconditional cache size: 1253, Negative cache size: 67, Negative conditional cache size: 2, Negative unconditional cache size: 65, Eliminated conditions: 5 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff0_thd3; [L728] 0 _Bool y$r_buff1_thd0; [L729] 0 _Bool y$r_buff1_thd1; [L730] 0 _Bool y$r_buff1_thd2; [L731] 0 _Bool y$r_buff1_thd3; [L732] 0 _Bool y$read_delayed; [L733] 0 int *y$read_delayed_var; [L734] 0 int y$w_buff0; [L735] 0 _Bool y$w_buff0_used; [L736] 0 int y$w_buff1; [L737] 0 _Bool y$w_buff1_used; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L823] 0 pthread_t t1196; [L824] FCALL, FORK 0 pthread_create(&t1196, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L825] 0 pthread_t t1197; [L826] FCALL, FORK 0 pthread_create(&t1197, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1198; [L828] FCALL, FORK 0 pthread_create(&t1198, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y$w_buff1 = y$w_buff0 [L781] 3 y$w_buff0 = 2 [L782] 3 y$w_buff1_used = y$w_buff0_used [L783] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L785] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 3 y$r_buff0_thd3 = (_Bool)1 [L792] 3 z = 1 [L795] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L745] 1 a = 1 [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 2 x = 2 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L766] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L768] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L770] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 2 return 0; [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 y$flush_delayed = weak$$choice2 [L844] 0 y$mem_tmp = y [L845] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L845] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L846] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L846] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L847] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L847] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L848] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L848] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L849] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L850] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L850] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L851] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L851] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L853] 0 y = y$flush_delayed ? y$mem_tmp : y [L854] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 99 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 6.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21652.6ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1307.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7858.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 42 SDslu, 17 SDs, 0 SdLazy, 314 SolverSat, 99 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 377.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 324.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=12, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 45.0ms SsaConstructionTime, 412.9ms SatisfiabilityAnalysisTime, 994.0ms InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 199 ConstructedInterpolants, 0 QuantifiedInterpolants, 1002 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...