/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-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 07:00:39,276 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 07:00:39,278 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 07:00:39,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 07:00:39,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 07:00:39,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 07:00:39,310 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 07:00:39,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 07:00:39,317 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 07:00:39,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 07:00:39,318 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 07:00:39,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 07:00:39,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 07:00:39,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 07:00:39,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 07:00:39,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 07:00:39,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 07:00:39,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 07:00:39,329 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 07:00:39,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 07:00:39,350 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 07:00:39,355 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 07:00:39,357 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 07:00:39,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 07:00:39,362 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 07:00:39,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 07:00:39,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 07:00:39,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 07:00:39,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 07:00:39,364 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 07:00:39,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 07:00:39,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 07:00:39,365 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 07:00:39,366 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 07:00:39,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 07:00:39,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 07:00:39,367 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 07:00:39,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 07:00:39,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 07:00:39,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 07:00:39,369 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 07:00:39,378 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-RepeatedSemanticLbe.epf [2021-06-11 07:00:39,415 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 07:00:39,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 07:00:39,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 07:00:39,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 07:00:39,417 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 07:00:39,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 07:00:39,417 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 07:00:39,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 07:00:39,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 07:00:39,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 07:00:39,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 07:00:39,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 07:00:39,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 07:00:39,418 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 07:00:39,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 07:00:39,418 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 07:00:39,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 07:00:39,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 07:00:39,419 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 07:00:39,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 07:00:39,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 07:00:39,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 07:00:39,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 07:00:39,419 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 07:00:39,419 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 07:00:39,419 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 07:00:39,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 07:00:39,420 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 07:00:39,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 07:00:39,420 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 07:00:39,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 07:00:39,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 07:00:39,714 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 07:00:39,715 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 07:00:39,717 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 07:00:39,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2021-06-11 07:00:39,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b460116a/4b77f6ad2ca0476cbb64efc58f36e817/FLAGe951e5184 [2021-06-11 07:00:40,631 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 07:00:40,632 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_rmo.oepc.i [2021-06-11 07:00:40,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b460116a/4b77f6ad2ca0476cbb64efc58f36e817/FLAGe951e5184 [2021-06-11 07:00:41,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b460116a/4b77f6ad2ca0476cbb64efc58f36e817 [2021-06-11 07:00:41,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 07:00:41,144 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 07:00:41,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 07:00:41,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 07:00:41,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 07:00:41,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d59aa0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41, skipping insertion in model container [2021-06-11 07:00:41,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 07:00:41,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 07:00:41,346 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/safe032_rmo.oepc.i[993,1006] [2021-06-11 07:00:41,589 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 07:00:41,595 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 07:00:41,611 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/safe032_rmo.oepc.i[993,1006] [2021-06-11 07:00:41,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 07:00:41,746 INFO L208 MainTranslator]: Completed translation [2021-06-11 07:00:41,747 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41 WrapperNode [2021-06-11 07:00:41,747 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 07:00:41,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 07:00:41,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 07:00:41,750 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 07:00:41,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 07:00:41,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 07:00:41,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 07:00:41,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 07:00:41,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,856 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,856 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,873 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... [2021-06-11 07:00:41,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 07:00:41,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 07:00:41,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 07:00:41,879 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 07:00:41,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 07:00:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 07:00:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 07:00:41,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 07:00:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 07:00:41,960 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 07:00:41,960 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 07:00:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 07:00:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 07:00:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 07:00:41,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 07:00:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 07:00:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 07:00:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 07:00:41,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 07:00:41,964 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 07:00:44,663 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 07:00:44,664 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 07:00:44,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 07:00:44 BoogieIcfgContainer [2021-06-11 07:00:44,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 07:00:44,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 07:00:44,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 07:00:44,670 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 07:00:44,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 07:00:41" (1/3) ... [2021-06-11 07:00:44,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b30418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 07:00:44, skipping insertion in model container [2021-06-11 07:00:44,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 07:00:41" (2/3) ... [2021-06-11 07:00:44,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59b30418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 07:00:44, skipping insertion in model container [2021-06-11 07:00:44,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 07:00:44" (3/3) ... [2021-06-11 07:00:44,673 INFO L111 eAbstractionObserver]: Analyzing ICFG safe032_rmo.oepc.i [2021-06-11 07:00:44,679 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 07:00:44,683 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 07:00:44,683 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 07:00:44,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,739 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,741 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,742 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,743 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,746 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,746 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,747 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,751 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,752 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,758 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,759 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,760 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,761 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,764 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,765 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,766 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,767 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,769 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,770 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,771 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,771 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,771 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,772 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,772 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,772 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,772 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,772 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,772 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,773 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,773 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,773 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,782 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,783 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,784 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,786 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,790 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,792 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,793 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,794 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,795 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,797 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,798 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,799 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,800 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,801 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,802 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,803 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,804 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 07:00:44,805 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 07:00:44,820 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-06-11 07:00:44,848 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 07:00:44,848 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 07:00:44,848 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 07:00:44,848 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 07:00:44,848 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 07:00:44,849 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 07:00:44,849 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 07:00:44,849 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 07:00:44,861 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-06-11 07:00:44,904 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-11 07:00:44,905 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 07:00:44,918 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 07:00:44,918 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2021-06-11 07:00:44,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2021-06-11 07:00:44,927 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:00:44,937 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2021-06-11 07:00:44,940 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2021-06-11 07:00:44,944 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2021-06-11 07:00:44,969 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-06-11 07:00:44,969 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 07:00:44,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-06-11 07:00:44,973 INFO L151 LiptonReduction]: Number of co-enabled transitions 1668 [2021-06-11 07:00:45,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,065 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:45,067 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,067 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:00:45,069 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:00:45,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,213 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,235 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,255 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,270 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,376 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,402 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,404 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,512 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:45,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:00:45,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:00:45,569 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,591 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,592 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,608 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,609 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,628 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,629 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,644 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,755 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,756 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,812 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:45,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,814 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:00:45,815 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:00:45,844 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:45,907 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:45,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,063 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 07:00:46,063 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:00:46,088 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,322 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,323 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,523 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:46,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:00:46,531 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-06-11 07:00:46,625 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,626 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,659 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,660 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,705 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,706 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,870 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,872 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,898 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:46,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:46,982 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:47,192 WARN L205 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 07:00:47,627 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 07:00:47,744 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 07:00:47,752 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:47,764 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:47,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:47,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 07:00:47,768 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:47,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:47,770 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 07:00:47,770 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:00:47,773 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:47,775 INFO L147 QuantifierPusher]: treesize reduction 50, result has 50.0 percent of original size 50 [2021-06-11 07:00:47,775 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:47,777 INFO L142 QuantifierPusher]: treesize reduction 50, result has 68.8 percent of original size [2021-06-11 07:00:47,778 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 1] term [2021-06-11 07:00:47,778 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:00:47,780 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:47,782 INFO L147 QuantifierPusher]: treesize reduction 76, result has 39.7 percent of original size 50 [2021-06-11 07:00:47,782 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 3, 2, 1] term [2021-06-11 07:00:47,782 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:00:47,784 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:47,786 INFO L147 QuantifierPusher]: treesize reduction 141, result has 44.3 percent of original size 112 [2021-06-11 07:00:48,505 WARN L205 SmtUtils]: Spent 674.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-06-11 07:00:48,845 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-06-11 07:00:50,109 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2021-06-11 07:00:50,806 WARN L205 SmtUtils]: Spent 695.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-06-11 07:00:50,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:50,809 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:50,868 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:50,869 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:50,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:50,926 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:50,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:50,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:00:50,928 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:00:50,956 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:50,957 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:50,985 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:50,986 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:51,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:51,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,272 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:51,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:51,274 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,275 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 07:00:51,276 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 07:00:51,276 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:51,276 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,277 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:51,278 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 07:00:51,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-06-11 07:00:51,280 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:51,280 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 42 [2021-06-11 07:00:51,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-06-11 07:00:51,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,490 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:51,634 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:51,651 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 07:00:52,114 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 07:00:52,459 WARN L205 SmtUtils]: Spent 344.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-06-11 07:00:53,061 WARN L205 SmtUtils]: Spent 599.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-06-11 07:00:53,750 WARN L205 SmtUtils]: Spent 687.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-06-11 07:00:53,754 INFO L142 QuantifierPusher]: treesize reduction 16, result has 20.0 percent of original size [2021-06-11 07:00:53,755 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:54,158 WARN L205 SmtUtils]: Spent 401.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-06-11 07:00:54,519 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-06-11 07:00:55,122 WARN L205 SmtUtils]: Spent 600.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 07:00:55,733 WARN L205 SmtUtils]: Spent 609.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-06-11 07:00:55,766 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:55,767 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:55,793 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:55,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:55,909 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:55,921 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:55,925 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:55,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:00:55,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:00:55,976 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:55,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:56,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:56,019 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:56,941 WARN L205 SmtUtils]: Spent 824.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 200 [2021-06-11 07:00:57,331 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 200 [2021-06-11 07:00:58,131 WARN L205 SmtUtils]: Spent 798.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-06-11 07:00:59,015 WARN L205 SmtUtils]: Spent 883.00 ms on a formula simplification that was a NOOP. DAG size: 279 [2021-06-11 07:00:59,030 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:59,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:59,142 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:59,147 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:59,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:59,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:00:59,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:59,393 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:00:59,393 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:59,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:00:59,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:00:59,647 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:00:59,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:01:00,172 WARN L205 SmtUtils]: Spent 468.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 07:01:00,586 WARN L205 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 202 [2021-06-11 07:01:01,255 WARN L205 SmtUtils]: Spent 666.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-06-11 07:01:01,885 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 281 [2021-06-11 07:01:01,887 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:01,888 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:01:02,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:02,072 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:02,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:02,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:02,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:01:02,438 WARN L205 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-11 07:01:02,573 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 07:01:02,867 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-06-11 07:01:03,006 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-06-11 07:01:03,011 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:03,016 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:03,016 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:03,017 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:03,021 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:01:03,031 INFO L163 LiptonReduction]: Checked pairs total: 4547 [2021-06-11 07:01:03,031 INFO L165 LiptonReduction]: Total number of compositions: 85 [2021-06-11 07:01:03,033 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 18107 [2021-06-11 07:01:03,041 INFO L129 PetriNetUnfolder]: 1/15 cut-off events. [2021-06-11 07:01:03,042 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 07:01:03,042 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:03,042 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:03,042 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-06-11 07:01:03,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:03,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1451604129, now seen corresponding path program 1 times [2021-06-11 07:01:03,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:03,053 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988633083] [2021-06-11 07:01:03,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:03,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:03,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:03,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:03,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988633083] [2021-06-11 07:01:03,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:03,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 07:01:03,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281993564] [2021-06-11 07:01:03,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 07:01:03,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:03,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 07:01:03,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 07:01:03,220 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-11 07:01:03,224 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 63 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,225 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:03,225 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-11 07:01:03,225 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:03,444 INFO L129 PetriNetUnfolder]: 161/337 cut-off events. [2021-06-11 07:01:03,444 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 07:01:03,445 INFO L84 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 337 events. 161/337 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1704 event pairs, 33 based on Foata normal form. 23/331 useless extension candidates. Maximal degree in co-relation 595. Up to 193 conditions per place. [2021-06-11 07:01:03,448 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 13 selfloop transitions, 2 changer transitions 2/30 dead transitions. [2021-06-11 07:01:03,448 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 103 flow [2021-06-11 07:01:03,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 07:01:03,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 07:01:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2021-06-11 07:01:03,466 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8296703296703297 [2021-06-11 07:01:03,466 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2021-06-11 07:01:03,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2021-06-11 07:01:03,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:03,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2021-06-11 07:01:03,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,490 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,491 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 63 flow. Second operand 3 states and 453 transitions. [2021-06-11 07:01:03,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 103 flow [2021-06-11 07:01:03,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 30 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-06-11 07:01:03,495 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2021-06-11 07:01:03,496 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=52, 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=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2021-06-11 07:01:03,497 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 07:01:03,497 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:03,497 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 54 flow [2021-06-11 07:01:03,498 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 54 flow [2021-06-11 07:01:03,498 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 22 transitions, 54 flow [2021-06-11 07:01:03,502 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-06-11 07:01:03,502 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 07:01:03,503 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 22 events. 0/22 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 33 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 07:01:03,503 INFO L151 LiptonReduction]: Number of co-enabled transitions 234 [2021-06-11 07:01:03,572 INFO L163 LiptonReduction]: Checked pairs total: 268 [2021-06-11 07:01:03,572 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:03,572 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 75 [2021-06-11 07:01:03,573 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-06-11 07:01:03,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,574 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:03,574 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:03,574 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 07:01:03,574 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-06-11 07:01:03,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:03,574 INFO L82 PathProgramCache]: Analyzing trace with hash 872869630, now seen corresponding path program 1 times [2021-06-11 07:01:03,575 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:03,575 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694080775] [2021-06-11 07:01:03,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:03,713 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:03,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:03,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:03,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694080775] [2021-06-11 07:01:03,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:03,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 07:01:03,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740089055] [2021-06-11 07:01:03,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 07:01:03,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:03,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 07:01:03,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 07:01:03,718 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-06-11 07:01:03,719 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,719 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:03,719 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-06-11 07:01:03,719 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:03,747 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 07:01:03,747 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 07:01:03,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 1 based on Foata normal form. 1/31 useless extension candidates. Maximal degree in co-relation 44. Up to 10 conditions per place. [2021-06-11 07:01:03,747 INFO L132 encePairwiseOnDemand]: 178/182 looper letters, 3 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-06-11 07:01:03,748 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 70 flow [2021-06-11 07:01:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 07:01:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 07:01:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-06-11 07:01:03,749 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424908424908425 [2021-06-11 07:01:03,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-06-11 07:01:03,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-06-11 07:01:03,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:03,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-06-11 07:01:03,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,753 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 460 transitions. [2021-06-11 07:01:03,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 70 flow [2021-06-11 07:01:03,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 07:01:03,754 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 69 flow [2021-06-11 07:01:03,754 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-06-11 07:01:03,754 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -3 predicate places. [2021-06-11 07:01:03,755 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:03,755 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 69 flow [2021-06-11 07:01:03,755 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 69 flow [2021-06-11 07:01:03,755 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 69 flow [2021-06-11 07:01:03,759 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 07:01:03,759 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 07:01:03,760 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 32 events. 3/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 69 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-06-11 07:01:03,760 INFO L151 LiptonReduction]: Number of co-enabled transitions 260 [2021-06-11 07:01:03,762 INFO L163 LiptonReduction]: Checked pairs total: 244 [2021-06-11 07:01:03,762 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:03,762 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 07:01:03,763 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2021-06-11 07:01:03,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,764 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:03,764 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:03,764 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 07:01:03,764 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-06-11 07:01:03,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:03,764 INFO L82 PathProgramCache]: Analyzing trace with hash 884328165, now seen corresponding path program 1 times [2021-06-11 07:01:03,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:03,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43914253] [2021-06-11 07:01:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:03,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:03,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:03,846 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:03,851 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43914253] [2021-06-11 07:01:03,851 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:03,851 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 07:01:03,851 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332729306] [2021-06-11 07:01:03,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 07:01:03,852 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 07:01:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 07:01:03,854 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 182 [2021-06-11 07:01:03,854 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,855 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:03,855 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 182 [2021-06-11 07:01:03,855 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:03,873 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 07:01:03,873 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-06-11 07:01:03,873 INFO L84 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 32 events. 3/32 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 68 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-06-11 07:01:03,873 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 1 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2021-06-11 07:01:03,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 75 flow [2021-06-11 07:01:03,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 07:01:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 07:01:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2021-06-11 07:01:03,876 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8424908424908425 [2021-06-11 07:01:03,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2021-06-11 07:01:03,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2021-06-11 07:01:03,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:03,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2021-06-11 07:01:03,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,879 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 460 transitions. [2021-06-11 07:01:03,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 75 flow [2021-06-11 07:01:03,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 72 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 07:01:03,880 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 74 flow [2021-06-11 07:01:03,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2021-06-11 07:01:03,882 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, -1 predicate places. [2021-06-11 07:01:03,882 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:03,882 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 34 places, 24 transitions, 74 flow [2021-06-11 07:01:03,883 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 34 places, 24 transitions, 74 flow [2021-06-11 07:01:03,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 74 flow [2021-06-11 07:01:03,888 INFO L129 PetriNetUnfolder]: 3/32 cut-off events. [2021-06-11 07:01:03,889 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-06-11 07:01:03,889 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 32 events. 3/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 70 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 48. Up to 10 conditions per place. [2021-06-11 07:01:03,889 INFO L151 LiptonReduction]: Number of co-enabled transitions 254 [2021-06-11 07:01:03,891 INFO L163 LiptonReduction]: Checked pairs total: 210 [2021-06-11 07:01:03,891 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:03,891 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-06-11 07:01:03,892 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 74 flow [2021-06-11 07:01:03,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:03,893 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:03,893 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:03,893 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 07:01:03,893 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-06-11 07:01:03,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:03,894 INFO L82 PathProgramCache]: Analyzing trace with hash -380094159, now seen corresponding path program 1 times [2021-06-11 07:01:03,894 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:03,894 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510083566] [2021-06-11 07:01:03,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:04,060 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:04,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,073 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:04,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 07:01:04,090 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:01:04,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,102 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 07:01:04,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:04,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510083566] [2021-06-11 07:01:04,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:04,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 07:01:04,115 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861669075] [2021-06-11 07:01:04,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 07:01:04,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:04,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 07:01:04,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-06-11 07:01:04,118 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 182 [2021-06-11 07:01:04,119 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,119 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:04,119 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 182 [2021-06-11 07:01:04,119 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:04,276 INFO L129 PetriNetUnfolder]: 145/311 cut-off events. [2021-06-11 07:01:04,276 INFO L130 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2021-06-11 07:01:04,279 INFO L84 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 311 events. 145/311 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1509 event pairs, 24 based on Foata normal form. 4/309 useless extension candidates. Maximal degree in co-relation 637. Up to 175 conditions per place. [2021-06-11 07:01:04,281 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 13 selfloop transitions, 7 changer transitions 0/34 dead transitions. [2021-06-11 07:01:04,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 137 flow [2021-06-11 07:01:04,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 07:01:04,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 07:01:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2021-06-11 07:01:04,284 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7156593406593407 [2021-06-11 07:01:04,284 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2021-06-11 07:01:04,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2021-06-11 07:01:04,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:04,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2021-06-11 07:01:04,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,287 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,287 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 74 flow. Second operand 4 states and 521 transitions. [2021-06-11 07:01:04,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 137 flow [2021-06-11 07:01:04,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 07:01:04,289 INFO L241 Difference]: Finished difference. Result has 37 places, 29 transitions, 115 flow [2021-06-11 07:01:04,289 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2021-06-11 07:01:04,289 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2021-06-11 07:01:04,289 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:04,290 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 37 places, 29 transitions, 115 flow [2021-06-11 07:01:04,290 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 37 places, 29 transitions, 115 flow [2021-06-11 07:01:04,290 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 37 places, 29 transitions, 115 flow [2021-06-11 07:01:04,306 INFO L129 PetriNetUnfolder]: 30/109 cut-off events. [2021-06-11 07:01:04,306 INFO L130 PetriNetUnfolder]: For 32/32 co-relation queries the response was YES. [2021-06-11 07:01:04,307 INFO L84 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 109 events. 30/109 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 471 event pairs, 9 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 222. Up to 34 conditions per place. [2021-06-11 07:01:04,308 INFO L151 LiptonReduction]: Number of co-enabled transitions 284 [2021-06-11 07:01:04,354 INFO L163 LiptonReduction]: Checked pairs total: 90 [2021-06-11 07:01:04,354 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:04,355 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-06-11 07:01:04,355 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 115 flow [2021-06-11 07:01:04,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.0) internal successors, (756), 6 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,356 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:04,356 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:04,356 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 07:01:04,356 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-06-11 07:01:04,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:04,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1102007694, now seen corresponding path program 1 times [2021-06-11 07:01:04,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:04,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35177349] [2021-06-11 07:01:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:04,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:04,486 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,486 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:04,490 INFO L142 QuantifierPusher]: treesize reduction 17, result has 70.2 percent of original size [2021-06-11 07:01:04,493 INFO L147 QuantifierPusher]: treesize reduction 9, result has 77.5 percent of original size 31 [2021-06-11 07:01:04,516 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,517 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:04,526 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,526 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:04,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:04,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35177349] [2021-06-11 07:01:04,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:04,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 07:01:04,536 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565014905] [2021-06-11 07:01:04,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 07:01:04,537 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:04,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 07:01:04,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-06-11 07:01:04,538 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 182 [2021-06-11 07:01:04,539 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 115 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,539 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:04,539 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 182 [2021-06-11 07:01:04,539 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:04,697 INFO L129 PetriNetUnfolder]: 161/335 cut-off events. [2021-06-11 07:01:04,697 INFO L130 PetriNetUnfolder]: For 217/265 co-relation queries the response was YES. [2021-06-11 07:01:04,698 INFO L84 FinitePrefix]: Finished finitePrefix Result has 875 conditions, 335 events. 161/335 cut-off events. For 217/265 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1619 event pairs, 13 based on Foata normal form. 9/337 useless extension candidates. Maximal degree in co-relation 861. Up to 184 conditions per place. [2021-06-11 07:01:04,700 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 19 selfloop transitions, 13 changer transitions 0/46 dead transitions. [2021-06-11 07:01:04,700 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 240 flow [2021-06-11 07:01:04,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 07:01:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 07:01:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 785 transitions. [2021-06-11 07:01:04,703 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7188644688644689 [2021-06-11 07:01:04,703 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 785 transitions. [2021-06-11 07:01:04,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 785 transitions. [2021-06-11 07:01:04,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:04,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 785 transitions. [2021-06-11 07:01:04,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,708 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,708 INFO L185 Difference]: Start difference. First operand has 37 places, 29 transitions, 115 flow. Second operand 6 states and 785 transitions. [2021-06-11 07:01:04,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 240 flow [2021-06-11 07:01:04,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 07:01:04,710 INFO L241 Difference]: Finished difference. Result has 44 places, 38 transitions, 199 flow [2021-06-11 07:01:04,710 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=199, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2021-06-11 07:01:04,710 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2021-06-11 07:01:04,710 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:04,711 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 38 transitions, 199 flow [2021-06-11 07:01:04,711 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 38 transitions, 199 flow [2021-06-11 07:01:04,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 199 flow [2021-06-11 07:01:04,750 INFO L129 PetriNetUnfolder]: 126/278 cut-off events. [2021-06-11 07:01:04,751 INFO L130 PetriNetUnfolder]: For 280/290 co-relation queries the response was YES. [2021-06-11 07:01:04,752 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 278 events. 126/278 cut-off events. For 280/290 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1444 event pairs, 51 based on Foata normal form. 3/251 useless extension candidates. Maximal degree in co-relation 762. Up to 130 conditions per place. [2021-06-11 07:01:04,754 INFO L151 LiptonReduction]: Number of co-enabled transitions 350 [2021-06-11 07:01:04,760 INFO L163 LiptonReduction]: Checked pairs total: 78 [2021-06-11 07:01:04,760 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:04,760 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 50 [2021-06-11 07:01:04,762 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 199 flow [2021-06-11 07:01:04,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,763 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:04,763 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:04,763 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 07:01:04,763 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-06-11 07:01:04,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:04,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1516072984, now seen corresponding path program 2 times [2021-06-11 07:01:04,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:04,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140918424] [2021-06-11 07:01:04,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:04,888 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,889 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:04,899 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,899 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 07:01:04,912 INFO L142 QuantifierPusher]: treesize reduction 17, result has 73.0 percent of original size [2021-06-11 07:01:04,914 INFO L147 QuantifierPusher]: treesize reduction 9, result has 80.4 percent of original size 37 [2021-06-11 07:01:04,942 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:04,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:04,964 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:04,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:04,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140918424] [2021-06-11 07:01:04,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:04,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 07:01:04,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689263704] [2021-06-11 07:01:04,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 07:01:04,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:04,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 07:01:04,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-06-11 07:01:04,969 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 182 [2021-06-11 07:01:04,970 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 199 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:04,970 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:04,970 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 182 [2021-06-11 07:01:04,970 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:05,217 INFO L129 PetriNetUnfolder]: 188/383 cut-off events. [2021-06-11 07:01:05,217 INFO L130 PetriNetUnfolder]: For 538/603 co-relation queries the response was YES. [2021-06-11 07:01:05,219 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 383 events. 188/383 cut-off events. For 538/603 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1999 event pairs, 5 based on Foata normal form. 16/387 useless extension candidates. Maximal degree in co-relation 1276. Up to 207 conditions per place. [2021-06-11 07:01:05,221 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 24 selfloop transitions, 14 changer transitions 0/52 dead transitions. [2021-06-11 07:01:05,221 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 352 flow [2021-06-11 07:01:05,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 07:01:05,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 07:01:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 661 transitions. [2021-06-11 07:01:05,224 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7263736263736263 [2021-06-11 07:01:05,224 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 661 transitions. [2021-06-11 07:01:05,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 661 transitions. [2021-06-11 07:01:05,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:05,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 661 transitions. [2021-06-11 07:01:05,226 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,228 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,228 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 199 flow. Second operand 5 states and 661 transitions. [2021-06-11 07:01:05,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 352 flow [2021-06-11 07:01:05,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 52 transitions, 341 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 07:01:05,234 INFO L241 Difference]: Finished difference. Result has 48 places, 45 transitions, 280 flow [2021-06-11 07:01:05,234 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=280, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2021-06-11 07:01:05,234 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 13 predicate places. [2021-06-11 07:01:05,234 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:05,235 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 45 transitions, 280 flow [2021-06-11 07:01:05,235 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 45 transitions, 280 flow [2021-06-11 07:01:05,235 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 45 transitions, 280 flow [2021-06-11 07:01:05,289 INFO L129 PetriNetUnfolder]: 165/345 cut-off events. [2021-06-11 07:01:05,290 INFO L130 PetriNetUnfolder]: For 573/582 co-relation queries the response was YES. [2021-06-11 07:01:05,292 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 345 events. 165/345 cut-off events. For 573/582 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 1757 event pairs, 36 based on Foata normal form. 1/323 useless extension candidates. Maximal degree in co-relation 1131. Up to 178 conditions per place. [2021-06-11 07:01:05,295 INFO L151 LiptonReduction]: Number of co-enabled transitions 414 [2021-06-11 07:01:05,305 INFO L163 LiptonReduction]: Checked pairs total: 96 [2021-06-11 07:01:05,305 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:05,305 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 71 [2021-06-11 07:01:05,307 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 280 flow [2021-06-11 07:01:05,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,307 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:05,307 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:05,307 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 07:01:05,307 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-06-11 07:01:05,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -981764322, now seen corresponding path program 3 times [2021-06-11 07:01:05,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:05,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285430761] [2021-06-11 07:01:05,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:05,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:05,407 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:05,408 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:05,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,418 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:05,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:05,434 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 07:01:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:05,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285430761] [2021-06-11 07:01:05,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:05,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 07:01:05,447 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617456045] [2021-06-11 07:01:05,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 07:01:05,447 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:05,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 07:01:05,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-11 07:01:05,449 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 182 [2021-06-11 07:01:05,450 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,450 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:05,450 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 182 [2021-06-11 07:01:05,450 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:05,690 INFO L129 PetriNetUnfolder]: 234/481 cut-off events. [2021-06-11 07:01:05,690 INFO L130 PetriNetUnfolder]: For 1027/1125 co-relation queries the response was YES. [2021-06-11 07:01:05,692 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 481 events. 234/481 cut-off events. For 1027/1125 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2598 event pairs, 10 based on Foata normal form. 26/500 useless extension candidates. Maximal degree in co-relation 1942. Up to 257 conditions per place. [2021-06-11 07:01:05,695 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 44 selfloop transitions, 25 changer transitions 0/83 dead transitions. [2021-06-11 07:01:05,695 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 83 transitions, 704 flow [2021-06-11 07:01:05,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 07:01:05,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 07:01:05,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 793 transitions. [2021-06-11 07:01:05,697 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7261904761904762 [2021-06-11 07:01:05,697 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 793 transitions. [2021-06-11 07:01:05,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 793 transitions. [2021-06-11 07:01:05,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:05,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 793 transitions. [2021-06-11 07:01:05,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,701 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,702 INFO L185 Difference]: Start difference. First operand has 48 places, 45 transitions, 280 flow. Second operand 6 states and 793 transitions. [2021-06-11 07:01:05,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 83 transitions, 704 flow [2021-06-11 07:01:05,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 83 transitions, 668 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-06-11 07:01:05,707 INFO L241 Difference]: Finished difference. Result has 53 places, 62 transitions, 492 flow [2021-06-11 07:01:05,707 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=492, PETRI_PLACES=53, PETRI_TRANSITIONS=62} [2021-06-11 07:01:05,707 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 18 predicate places. [2021-06-11 07:01:05,707 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:05,707 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 62 transitions, 492 flow [2021-06-11 07:01:05,708 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 62 transitions, 492 flow [2021-06-11 07:01:05,708 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 62 transitions, 492 flow [2021-06-11 07:01:05,777 INFO L129 PetriNetUnfolder]: 204/452 cut-off events. [2021-06-11 07:01:05,777 INFO L130 PetriNetUnfolder]: For 1141/1159 co-relation queries the response was YES. [2021-06-11 07:01:05,780 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1775 conditions, 452 events. 204/452 cut-off events. For 1141/1159 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2649 event pairs, 51 based on Foata normal form. 6/438 useless extension candidates. Maximal degree in co-relation 1754. Up to 228 conditions per place. [2021-06-11 07:01:05,784 INFO L151 LiptonReduction]: Number of co-enabled transitions 526 [2021-06-11 07:01:05,793 INFO L163 LiptonReduction]: Checked pairs total: 270 [2021-06-11 07:01:05,793 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:05,794 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 87 [2021-06-11 07:01:05,794 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 62 transitions, 492 flow [2021-06-11 07:01:05,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,795 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:05,795 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:05,795 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 07:01:05,795 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-06-11 07:01:05,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1913296264, now seen corresponding path program 1 times [2021-06-11 07:01:05,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:05,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664554129] [2021-06-11 07:01:05,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:05,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,896 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:05,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:05,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,905 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:05,914 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 07:01:05,926 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:05,936 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:05,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 07:01:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:05,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664554129] [2021-06-11 07:01:05,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:05,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 07:01:05,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802351066] [2021-06-11 07:01:05,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 07:01:05,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 07:01:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-06-11 07:01:05,951 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 182 [2021-06-11 07:01:05,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 62 transitions, 492 flow. Second operand has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:05,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:05,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 182 [2021-06-11 07:01:05,953 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:06,177 INFO L129 PetriNetUnfolder]: 253/581 cut-off events. [2021-06-11 07:01:06,177 INFO L130 PetriNetUnfolder]: For 2117/2241 co-relation queries the response was YES. [2021-06-11 07:01:06,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2668 conditions, 581 events. 253/581 cut-off events. For 2117/2241 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3742 event pairs, 26 based on Foata normal form. 52/626 useless extension candidates. Maximal degree in co-relation 2645. Up to 286 conditions per place. [2021-06-11 07:01:06,184 INFO L132 encePairwiseOnDemand]: 176/182 looper letters, 47 selfloop transitions, 29 changer transitions 1/91 dead transitions. [2021-06-11 07:01:06,184 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 91 transitions, 873 flow [2021-06-11 07:01:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 07:01:06,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 07:01:06,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2021-06-11 07:01:06,187 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7252747252747253 [2021-06-11 07:01:06,187 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2021-06-11 07:01:06,187 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2021-06-11 07:01:06,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:06,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2021-06-11 07:01:06,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,191 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,191 INFO L185 Difference]: Start difference. First operand has 53 places, 62 transitions, 492 flow. Second operand 5 states and 660 transitions. [2021-06-11 07:01:06,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 91 transitions, 873 flow [2021-06-11 07:01:06,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 91 transitions, 866 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-06-11 07:01:06,196 INFO L241 Difference]: Finished difference. Result has 59 places, 71 transitions, 682 flow [2021-06-11 07:01:06,196 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=682, PETRI_PLACES=59, PETRI_TRANSITIONS=71} [2021-06-11 07:01:06,196 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 24 predicate places. [2021-06-11 07:01:06,196 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:06,196 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 71 transitions, 682 flow [2021-06-11 07:01:06,196 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 71 transitions, 682 flow [2021-06-11 07:01:06,197 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 71 transitions, 682 flow [2021-06-11 07:01:06,314 INFO L129 PetriNetUnfolder]: 231/560 cut-off events. [2021-06-11 07:01:06,314 INFO L130 PetriNetUnfolder]: For 2273/2305 co-relation queries the response was YES. [2021-06-11 07:01:06,317 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2492 conditions, 560 events. 231/560 cut-off events. For 2273/2305 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3717 event pairs, 60 based on Foata normal form. 17/553 useless extension candidates. Maximal degree in co-relation 2467. Up to 281 conditions per place. [2021-06-11 07:01:06,323 INFO L151 LiptonReduction]: Number of co-enabled transitions 594 [2021-06-11 07:01:06,341 INFO L163 LiptonReduction]: Checked pairs total: 306 [2021-06-11 07:01:06,341 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:06,341 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 145 [2021-06-11 07:01:06,342 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 71 transitions, 682 flow [2021-06-11 07:01:06,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,343 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:06,343 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:06,343 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 07:01:06,343 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-06-11 07:01:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -590238700, now seen corresponding path program 2 times [2021-06-11 07:01:06,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:06,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332080438] [2021-06-11 07:01:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:06,436 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:06,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:06,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-06-11 07:01:06,467 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 07:01:06,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,485 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-06-11 07:01:06,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:06,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332080438] [2021-06-11 07:01:06,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:06,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 07:01:06,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310175929] [2021-06-11 07:01:06,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 07:01:06,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:06,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 07:01:06,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 07:01:06,488 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 182 [2021-06-11 07:01:06,489 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 71 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,489 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:06,489 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 182 [2021-06-11 07:01:06,489 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:06,773 INFO L129 PetriNetUnfolder]: 256/610 cut-off events. [2021-06-11 07:01:06,773 INFO L130 PetriNetUnfolder]: For 2867/3001 co-relation queries the response was YES. [2021-06-11 07:01:06,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3109 conditions, 610 events. 256/610 cut-off events. For 2867/3001 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 4084 event pairs, 12 based on Foata normal form. 48/654 useless extension candidates. Maximal degree in co-relation 3082. Up to 334 conditions per place. [2021-06-11 07:01:06,780 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 48 selfloop transitions, 32 changer transitions 0/94 dead transitions. [2021-06-11 07:01:06,780 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 94 transitions, 1083 flow [2021-06-11 07:01:06,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 07:01:06,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 07:01:06,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1008 transitions. [2021-06-11 07:01:06,783 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6923076923076923 [2021-06-11 07:01:06,783 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1008 transitions. [2021-06-11 07:01:06,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1008 transitions. [2021-06-11 07:01:06,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:06,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1008 transitions. [2021-06-11 07:01:06,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.0) internal successors, (1008), 8 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,788 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,788 INFO L185 Difference]: Start difference. First operand has 59 places, 71 transitions, 682 flow. Second operand 8 states and 1008 transitions. [2021-06-11 07:01:06,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 94 transitions, 1083 flow [2021-06-11 07:01:06,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 94 transitions, 1066 flow, removed 5 selfloop flow, removed 2 redundant places. [2021-06-11 07:01:06,795 INFO L241 Difference]: Finished difference. Result has 66 places, 84 transitions, 936 flow [2021-06-11 07:01:06,795 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=936, PETRI_PLACES=66, PETRI_TRANSITIONS=84} [2021-06-11 07:01:06,796 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2021-06-11 07:01:06,796 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:06,796 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 84 transitions, 936 flow [2021-06-11 07:01:06,796 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 84 transitions, 936 flow [2021-06-11 07:01:06,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 84 transitions, 936 flow [2021-06-11 07:01:06,883 INFO L129 PetriNetUnfolder]: 221/567 cut-off events. [2021-06-11 07:01:06,883 INFO L130 PetriNetUnfolder]: For 2978/3030 co-relation queries the response was YES. [2021-06-11 07:01:06,886 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2739 conditions, 567 events. 221/567 cut-off events. For 2978/3030 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 3853 event pairs, 45 based on Foata normal form. 21/576 useless extension candidates. Maximal degree in co-relation 2712. Up to 278 conditions per place. [2021-06-11 07:01:06,891 INFO L151 LiptonReduction]: Number of co-enabled transitions 684 [2021-06-11 07:01:06,910 INFO L163 LiptonReduction]: Checked pairs total: 372 [2021-06-11 07:01:06,910 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:06,910 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 114 [2021-06-11 07:01:06,910 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 84 transitions, 936 flow [2021-06-11 07:01:06,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,911 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:06,911 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:06,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 07:01:06,911 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-06-11 07:01:06,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:06,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1950773776, now seen corresponding path program 3 times [2021-06-11 07:01:06,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:06,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900777548] [2021-06-11 07:01:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:06,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:06,965 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,965 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:06,970 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:06,971 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,972 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:06,981 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:06,981 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:06,989 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900777548] [2021-06-11 07:01:06,990 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:06,990 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 07:01:06,990 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753065489] [2021-06-11 07:01:06,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 07:01:06,990 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:06,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 07:01:06,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 07:01:06,991 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 182 [2021-06-11 07:01:06,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 84 transitions, 936 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:06,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:06,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 182 [2021-06-11 07:01:06,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:07,178 INFO L129 PetriNetUnfolder]: 267/667 cut-off events. [2021-06-11 07:01:07,178 INFO L130 PetriNetUnfolder]: For 4001/4211 co-relation queries the response was YES. [2021-06-11 07:01:07,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3605 conditions, 667 events. 267/667 cut-off events. For 4001/4211 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4733 event pairs, 30 based on Foata normal form. 53/714 useless extension candidates. Maximal degree in co-relation 3576. Up to 391 conditions per place. [2021-06-11 07:01:07,185 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 52 selfloop transitions, 30 changer transitions 4/100 dead transitions. [2021-06-11 07:01:07,185 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 100 transitions, 1268 flow [2021-06-11 07:01:07,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 07:01:07,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 07:01:07,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2021-06-11 07:01:07,188 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7293956043956044 [2021-06-11 07:01:07,188 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2021-06-11 07:01:07,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2021-06-11 07:01:07,188 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:07,188 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2021-06-11 07:01:07,189 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,190 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,191 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,191 INFO L185 Difference]: Start difference. First operand has 66 places, 84 transitions, 936 flow. Second operand 4 states and 531 transitions. [2021-06-11 07:01:07,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 100 transitions, 1268 flow [2021-06-11 07:01:07,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 100 transitions, 1203 flow, removed 17 selfloop flow, removed 4 redundant places. [2021-06-11 07:01:07,201 INFO L241 Difference]: Finished difference. Result has 66 places, 92 transitions, 1043 flow [2021-06-11 07:01:07,201 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1043, PETRI_PLACES=66, PETRI_TRANSITIONS=92} [2021-06-11 07:01:07,201 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 31 predicate places. [2021-06-11 07:01:07,201 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:07,201 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 92 transitions, 1043 flow [2021-06-11 07:01:07,201 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 92 transitions, 1043 flow [2021-06-11 07:01:07,202 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 92 transitions, 1043 flow [2021-06-11 07:01:07,362 INFO L129 PetriNetUnfolder]: 225/613 cut-off events. [2021-06-11 07:01:07,362 INFO L130 PetriNetUnfolder]: For 3536/3599 co-relation queries the response was YES. [2021-06-11 07:01:07,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2972 conditions, 613 events. 225/613 cut-off events. For 3536/3599 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 4466 event pairs, 46 based on Foata normal form. 43/643 useless extension candidates. Maximal degree in co-relation 2945. Up to 234 conditions per place. [2021-06-11 07:01:07,373 INFO L151 LiptonReduction]: Number of co-enabled transitions 764 [2021-06-11 07:01:07,399 INFO L163 LiptonReduction]: Checked pairs total: 420 [2021-06-11 07:01:07,400 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:07,400 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 199 [2021-06-11 07:01:07,401 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 92 transitions, 1043 flow [2021-06-11 07:01:07,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,402 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:07,402 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:07,402 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 07:01:07,402 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-06-11 07:01:07,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:07,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1644700524, now seen corresponding path program 1 times [2021-06-11 07:01:07,402 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:07,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822172873] [2021-06-11 07:01:07,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:07,446 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:07,448 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:01:07,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:07,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:07,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822172873] [2021-06-11 07:01:07,460 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:07,460 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 07:01:07,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222816433] [2021-06-11 07:01:07,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 07:01:07,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 07:01:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 07:01:07,462 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 182 [2021-06-11 07:01:07,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 92 transitions, 1043 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,462 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:07,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 182 [2021-06-11 07:01:07,463 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:07,639 INFO L129 PetriNetUnfolder]: 275/785 cut-off events. [2021-06-11 07:01:07,639 INFO L130 PetriNetUnfolder]: For 4860/4949 co-relation queries the response was YES. [2021-06-11 07:01:07,643 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 785 events. 275/785 cut-off events. For 4860/4949 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 6191 event pairs, 64 based on Foata normal form. 23/795 useless extension candidates. Maximal degree in co-relation 3910. Up to 313 conditions per place. [2021-06-11 07:01:07,646 INFO L132 encePairwiseOnDemand]: 179/182 looper letters, 3 selfloop transitions, 3 changer transitions 22/92 dead transitions. [2021-06-11 07:01:07,646 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 92 transitions, 1055 flow [2021-06-11 07:01:07,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 07:01:07,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 07:01:07,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2021-06-11 07:01:07,648 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8406593406593407 [2021-06-11 07:01:07,648 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2021-06-11 07:01:07,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2021-06-11 07:01:07,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:07,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2021-06-11 07:01:07,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,651 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,651 INFO L185 Difference]: Start difference. First operand has 66 places, 92 transitions, 1043 flow. Second operand 3 states and 459 transitions. [2021-06-11 07:01:07,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 92 transitions, 1055 flow [2021-06-11 07:01:07,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 92 transitions, 1042 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-06-11 07:01:07,664 INFO L241 Difference]: Finished difference. Result has 68 places, 70 transitions, 773 flow [2021-06-11 07:01:07,665 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1030, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2021-06-11 07:01:07,665 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 33 predicate places. [2021-06-11 07:01:07,665 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:07,665 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 70 transitions, 773 flow [2021-06-11 07:01:07,665 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 70 transitions, 773 flow [2021-06-11 07:01:07,666 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 67 places, 70 transitions, 773 flow [2021-06-11 07:01:07,761 INFO L129 PetriNetUnfolder]: 205/625 cut-off events. [2021-06-11 07:01:07,761 INFO L130 PetriNetUnfolder]: For 4225/4407 co-relation queries the response was YES. [2021-06-11 07:01:07,764 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 625 events. 205/625 cut-off events. For 4225/4407 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4851 event pairs, 46 based on Foata normal form. 43/653 useless extension candidates. Maximal degree in co-relation 3099. Up to 265 conditions per place. [2021-06-11 07:01:07,769 INFO L151 LiptonReduction]: Number of co-enabled transitions 562 [2021-06-11 07:01:07,785 INFO L163 LiptonReduction]: Checked pairs total: 208 [2021-06-11 07:01:07,786 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:07,786 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 121 [2021-06-11 07:01:07,786 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 773 flow [2021-06-11 07:01:07,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,787 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:07,787 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:07,787 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 07:01:07,787 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-06-11 07:01:07,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1704715806, now seen corresponding path program 1 times [2021-06-11 07:01:07,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:07,787 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009498994] [2021-06-11 07:01:07,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:07,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:07,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:07,901 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:07,902 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 07:01:07,912 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:07,912 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 07:01:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:07,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009498994] [2021-06-11 07:01:07,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:07,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 07:01:07,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144981001] [2021-06-11 07:01:07,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 07:01:07,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:07,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 07:01:07,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-06-11 07:01:07,922 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-06-11 07:01:07,923 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 773 flow. Second operand has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:07,923 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:07,923 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-06-11 07:01:07,923 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:08,243 INFO L129 PetriNetUnfolder]: 265/776 cut-off events. [2021-06-11 07:01:08,243 INFO L130 PetriNetUnfolder]: For 5207/5373 co-relation queries the response was YES. [2021-06-11 07:01:08,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4378 conditions, 776 events. 265/776 cut-off events. For 5207/5373 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 6166 event pairs, 5 based on Foata normal form. 41/805 useless extension candidates. Maximal degree in co-relation 4348. Up to 340 conditions per place. [2021-06-11 07:01:08,249 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 59 selfloop transitions, 31 changer transitions 26/130 dead transitions. [2021-06-11 07:01:08,249 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 130 transitions, 1770 flow [2021-06-11 07:01:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 07:01:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 07:01:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1154 transitions. [2021-06-11 07:01:08,253 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7045177045177046 [2021-06-11 07:01:08,253 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1154 transitions. [2021-06-11 07:01:08,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1154 transitions. [2021-06-11 07:01:08,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:08,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1154 transitions. [2021-06-11 07:01:08,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 128.22222222222223) internal successors, (1154), 9 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:08,258 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:08,259 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:08,259 INFO L185 Difference]: Start difference. First operand has 67 places, 70 transitions, 773 flow. Second operand 9 states and 1154 transitions. [2021-06-11 07:01:08,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 130 transitions, 1770 flow [2021-06-11 07:01:08,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 130 transitions, 1710 flow, removed 16 selfloop flow, removed 2 redundant places. [2021-06-11 07:01:08,272 INFO L241 Difference]: Finished difference. Result has 79 places, 88 transitions, 1116 flow [2021-06-11 07:01:08,272 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1116, PETRI_PLACES=79, PETRI_TRANSITIONS=88} [2021-06-11 07:01:08,272 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 44 predicate places. [2021-06-11 07:01:08,272 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:08,272 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 88 transitions, 1116 flow [2021-06-11 07:01:08,273 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 88 transitions, 1116 flow [2021-06-11 07:01:08,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 79 places, 88 transitions, 1116 flow [2021-06-11 07:01:08,368 INFO L129 PetriNetUnfolder]: 195/581 cut-off events. [2021-06-11 07:01:08,368 INFO L130 PetriNetUnfolder]: For 5463/5610 co-relation queries the response was YES. [2021-06-11 07:01:08,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3327 conditions, 581 events. 195/581 cut-off events. For 5463/5610 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4299 event pairs, 20 based on Foata normal form. 33/607 useless extension candidates. Maximal degree in co-relation 3293. Up to 235 conditions per place. [2021-06-11 07:01:08,376 INFO L151 LiptonReduction]: Number of co-enabled transitions 632 [2021-06-11 07:01:08,396 INFO L163 LiptonReduction]: Checked pairs total: 448 [2021-06-11 07:01:08,396 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:08,396 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-06-11 07:01:08,399 INFO L480 AbstractCegarLoop]: Abstraction has has 79 places, 88 transitions, 1116 flow [2021-06-11 07:01:08,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 124.8) internal successors, (624), 5 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:08,400 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:08,400 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:08,400 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 07:01:08,400 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-06-11 07:01:08,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:08,401 INFO L82 PathProgramCache]: Analyzing trace with hash 2087628070, now seen corresponding path program 2 times [2021-06-11 07:01:08,401 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:08,401 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814100720] [2021-06-11 07:01:08,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:08,543 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:08,544 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:08,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:08,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:08,560 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:08,560 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 07:01:08,573 INFO L142 QuantifierPusher]: treesize reduction 3, result has 78.6 percent of original size [2021-06-11 07:01:08,574 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 07:01:08,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:08,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814100720] [2021-06-11 07:01:08,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:08,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 07:01:08,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137453983] [2021-06-11 07:01:08,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 07:01:08,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:08,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 07:01:08,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-11 07:01:08,585 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 182 [2021-06-11 07:01:08,586 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 88 transitions, 1116 flow. Second operand has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:08,586 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:08,586 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 182 [2021-06-11 07:01:08,586 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:08,930 INFO L129 PetriNetUnfolder]: 248/716 cut-off events. [2021-06-11 07:01:08,930 INFO L130 PetriNetUnfolder]: For 7005/7167 co-relation queries the response was YES. [2021-06-11 07:01:08,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4612 conditions, 716 events. 248/716 cut-off events. For 7005/7167 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 5493 event pairs, 2 based on Foata normal form. 57/761 useless extension candidates. Maximal degree in co-relation 4576. Up to 297 conditions per place. [2021-06-11 07:01:08,936 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 60 selfloop transitions, 41 changer transitions 20/135 dead transitions. [2021-06-11 07:01:08,937 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 135 transitions, 2013 flow [2021-06-11 07:01:08,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-06-11 07:01:08,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-06-11 07:01:08,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1020 transitions. [2021-06-11 07:01:08,940 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7005494505494505 [2021-06-11 07:01:08,940 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1020 transitions. [2021-06-11 07:01:08,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1020 transitions. [2021-06-11 07:01:08,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:08,941 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1020 transitions. [2021-06-11 07:01:08,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.5) internal successors, (1020), 8 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:08,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:08,945 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 182.0) internal successors, (1638), 9 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:08,945 INFO L185 Difference]: Start difference. First operand has 79 places, 88 transitions, 1116 flow. Second operand 8 states and 1020 transitions. [2021-06-11 07:01:08,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 135 transitions, 2013 flow [2021-06-11 07:01:08,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 1959 flow, removed 13 selfloop flow, removed 3 redundant places. [2021-06-11 07:01:08,962 INFO L241 Difference]: Finished difference. Result has 86 places, 103 transitions, 1433 flow [2021-06-11 07:01:08,962 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1433, PETRI_PLACES=86, PETRI_TRANSITIONS=103} [2021-06-11 07:01:08,962 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2021-06-11 07:01:08,962 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:08,963 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 103 transitions, 1433 flow [2021-06-11 07:01:08,963 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 103 transitions, 1433 flow [2021-06-11 07:01:08,964 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 103 transitions, 1433 flow [2021-06-11 07:01:09,064 INFO L129 PetriNetUnfolder]: 204/613 cut-off events. [2021-06-11 07:01:09,064 INFO L130 PetriNetUnfolder]: For 6972/7122 co-relation queries the response was YES. [2021-06-11 07:01:09,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3919 conditions, 613 events. 204/613 cut-off events. For 6972/7122 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 4673 event pairs, 4 based on Foata normal form. 37/639 useless extension candidates. Maximal degree in co-relation 3882. Up to 253 conditions per place. [2021-06-11 07:01:09,073 INFO L151 LiptonReduction]: Number of co-enabled transitions 700 [2021-06-11 07:01:09,104 INFO L163 LiptonReduction]: Checked pairs total: 627 [2021-06-11 07:01:09,104 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:09,104 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 142 [2021-06-11 07:01:09,105 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 103 transitions, 1433 flow [2021-06-11 07:01:09,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 124.5) internal successors, (747), 6 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:09,105 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:09,105 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:09,105 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 07:01:09,105 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-06-11 07:01:09,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:09,106 INFO L82 PathProgramCache]: Analyzing trace with hash -74416126, now seen corresponding path program 3 times [2021-06-11 07:01:09,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:09,106 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685377776] [2021-06-11 07:01:09,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:09,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:09,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-06-11 07:01:09,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:09,222 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-06-11 07:01:09,251 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:09,252 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 07:01:09,263 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:09,264 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 07:01:09,279 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:09,280 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-06-11 07:01:09,293 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:09,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 07:01:09,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:09,305 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685377776] [2021-06-11 07:01:09,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:09,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-11 07:01:09,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596840333] [2021-06-11 07:01:09,305 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-11 07:01:09,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:09,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-11 07:01:09,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-06-11 07:01:09,309 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 182 [2021-06-11 07:01:09,310 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 103 transitions, 1433 flow. Second operand has 8 states, 8 states have (on average 120.125) internal successors, (961), 8 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:09,310 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:09,310 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 182 [2021-06-11 07:01:09,310 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:09,733 INFO L129 PetriNetUnfolder]: 235/694 cut-off events. [2021-06-11 07:01:09,734 INFO L130 PetriNetUnfolder]: For 8447/8651 co-relation queries the response was YES. [2021-06-11 07:01:09,737 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4957 conditions, 694 events. 235/694 cut-off events. For 8447/8651 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 5353 event pairs, 1 based on Foata normal form. 105/785 useless extension candidates. Maximal degree in co-relation 4918. Up to 273 conditions per place. [2021-06-11 07:01:09,740 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 60 selfloop transitions, 49 changer transitions 18/141 dead transitions. [2021-06-11 07:01:09,740 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 141 transitions, 2298 flow [2021-06-11 07:01:09,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 07:01:09,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 07:01:09,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1236 transitions. [2021-06-11 07:01:09,744 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6791208791208792 [2021-06-11 07:01:09,744 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1236 transitions. [2021-06-11 07:01:09,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1236 transitions. [2021-06-11 07:01:09,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:09,745 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1236 transitions. [2021-06-11 07:01:09,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.6) internal successors, (1236), 10 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:09,750 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:09,750 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:09,751 INFO L185 Difference]: Start difference. First operand has 86 places, 103 transitions, 1433 flow. Second operand 10 states and 1236 transitions. [2021-06-11 07:01:09,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 141 transitions, 2298 flow [2021-06-11 07:01:09,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 141 transitions, 2227 flow, removed 30 selfloop flow, removed 3 redundant places. [2021-06-11 07:01:09,772 INFO L241 Difference]: Finished difference. Result has 97 places, 111 transitions, 1686 flow [2021-06-11 07:01:09,772 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1686, PETRI_PLACES=97, PETRI_TRANSITIONS=111} [2021-06-11 07:01:09,773 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 62 predicate places. [2021-06-11 07:01:09,773 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:09,773 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 111 transitions, 1686 flow [2021-06-11 07:01:09,773 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 111 transitions, 1686 flow [2021-06-11 07:01:09,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 97 places, 111 transitions, 1686 flow [2021-06-11 07:01:09,873 INFO L129 PetriNetUnfolder]: 194/591 cut-off events. [2021-06-11 07:01:09,874 INFO L130 PetriNetUnfolder]: For 7905/8125 co-relation queries the response was YES. [2021-06-11 07:01:09,877 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4010 conditions, 591 events. 194/591 cut-off events. For 7905/8125 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4478 event pairs, 4 based on Foata normal form. 55/636 useless extension candidates. Maximal degree in co-relation 3968. Up to 216 conditions per place. [2021-06-11 07:01:09,883 INFO L151 LiptonReduction]: Number of co-enabled transitions 732 [2021-06-11 07:01:09,939 INFO L163 LiptonReduction]: Checked pairs total: 660 [2021-06-11 07:01:09,939 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:09,939 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 166 [2021-06-11 07:01:09,940 INFO L480 AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 1686 flow [2021-06-11 07:01:09,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 120.125) internal successors, (961), 8 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:09,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:09,941 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:09,941 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 07:01:09,941 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-06-11 07:01:09,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:09,941 INFO L82 PathProgramCache]: Analyzing trace with hash 804193206, now seen corresponding path program 4 times [2021-06-11 07:01:09,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:09,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273311454] [2021-06-11 07:01:09,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:10,007 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:10,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:10,015 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:10,016 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 07:01:10,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:10,041 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 07:01:10,071 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:10,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 07:01:10,098 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:10,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 07:01:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:10,111 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273311454] [2021-06-11 07:01:10,111 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:10,111 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 07:01:10,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247974155] [2021-06-11 07:01:10,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 07:01:10,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:10,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 07:01:10,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 07:01:10,113 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 182 [2021-06-11 07:01:10,114 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 111 transitions, 1686 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,114 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:10,114 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 182 [2021-06-11 07:01:10,114 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:10,454 INFO L129 PetriNetUnfolder]: 192/594 cut-off events. [2021-06-11 07:01:10,454 INFO L130 PetriNetUnfolder]: For 8256/8442 co-relation queries the response was YES. [2021-06-11 07:01:10,457 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4452 conditions, 594 events. 192/594 cut-off events. For 8256/8442 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4430 event pairs, 0 based on Foata normal form. 74/652 useless extension candidates. Maximal degree in co-relation 4408. Up to 215 conditions per place. [2021-06-11 07:01:10,460 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 43 selfloop transitions, 53 changer transitions 18/128 dead transitions. [2021-06-11 07:01:10,460 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 128 transitions, 2209 flow [2021-06-11 07:01:10,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 07:01:10,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 07:01:10,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1106 transitions. [2021-06-11 07:01:10,463 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2021-06-11 07:01:10,464 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1106 transitions. [2021-06-11 07:01:10,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1106 transitions. [2021-06-11 07:01:10,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:10,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1106 transitions. [2021-06-11 07:01:10,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 122.88888888888889) internal successors, (1106), 9 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,469 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,469 INFO L185 Difference]: Start difference. First operand has 97 places, 111 transitions, 1686 flow. Second operand 9 states and 1106 transitions. [2021-06-11 07:01:10,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 128 transitions, 2209 flow [2021-06-11 07:01:10,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 128 transitions, 2109 flow, removed 29 selfloop flow, removed 5 redundant places. [2021-06-11 07:01:10,493 INFO L241 Difference]: Finished difference. Result has 103 places, 104 transitions, 1638 flow [2021-06-11 07:01:10,493 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1638, PETRI_PLACES=103, PETRI_TRANSITIONS=104} [2021-06-11 07:01:10,493 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 68 predicate places. [2021-06-11 07:01:10,494 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:10,494 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 104 transitions, 1638 flow [2021-06-11 07:01:10,494 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 104 transitions, 1638 flow [2021-06-11 07:01:10,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 104 transitions, 1638 flow [2021-06-11 07:01:10,574 INFO L129 PetriNetUnfolder]: 152/481 cut-off events. [2021-06-11 07:01:10,575 INFO L130 PetriNetUnfolder]: For 6152/6191 co-relation queries the response was YES. [2021-06-11 07:01:10,577 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 481 events. 152/481 cut-off events. For 6152/6191 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3459 event pairs, 0 based on Foata normal form. 22/488 useless extension candidates. Maximal degree in co-relation 3389. Up to 147 conditions per place. [2021-06-11 07:01:10,582 INFO L151 LiptonReduction]: Number of co-enabled transitions 664 [2021-06-11 07:01:10,594 INFO L163 LiptonReduction]: Checked pairs total: 572 [2021-06-11 07:01:10,594 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:10,594 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 100 [2021-06-11 07:01:10,595 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 104 transitions, 1638 flow [2021-06-11 07:01:10,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,595 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:10,595 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:10,595 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-11 07:01:10,595 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-06-11 07:01:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:10,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2094376863, now seen corresponding path program 1 times [2021-06-11 07:01:10,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:10,596 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883795332] [2021-06-11 07:01:10,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:10,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:10,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:10,657 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 07:01:10,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:10,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:10,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:01:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:10,665 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883795332] [2021-06-11 07:01:10,667 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:10,667 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 07:01:10,667 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072000253] [2021-06-11 07:01:10,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 07:01:10,668 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:10,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 07:01:10,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 07:01:10,669 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-11 07:01:10,669 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 104 transitions, 1638 flow. Second operand has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,669 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:10,669 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-11 07:01:10,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:10,854 INFO L129 PetriNetUnfolder]: 494/1081 cut-off events. [2021-06-11 07:01:10,855 INFO L130 PetriNetUnfolder]: For 17269/17775 co-relation queries the response was YES. [2021-06-11 07:01:10,861 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4920 conditions, 1081 events. 494/1081 cut-off events. For 17269/17775 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 7860 event pairs, 137 based on Foata normal form. 293/1169 useless extension candidates. Maximal degree in co-relation 4874. Up to 516 conditions per place. [2021-06-11 07:01:10,864 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 14 selfloop transitions, 10 changer transitions 0/92 dead transitions. [2021-06-11 07:01:10,865 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 92 transitions, 1309 flow [2021-06-11 07:01:10,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 07:01:10,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 07:01:10,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 735 transitions. [2021-06-11 07:01:10,867 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2021-06-11 07:01:10,867 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 735 transitions. [2021-06-11 07:01:10,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 735 transitions. [2021-06-11 07:01:10,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:10,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 735 transitions. [2021-06-11 07:01:10,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.0) internal successors, (735), 5 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,877 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 182.0) internal successors, (1092), 6 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:10,877 INFO L185 Difference]: Start difference. First operand has 103 places, 104 transitions, 1638 flow. Second operand 5 states and 735 transitions. [2021-06-11 07:01:10,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 92 transitions, 1309 flow [2021-06-11 07:01:10,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 92 transitions, 1152 flow, removed 29 selfloop flow, removed 12 redundant places. [2021-06-11 07:01:10,902 INFO L241 Difference]: Finished difference. Result has 98 places, 89 transitions, 1175 flow [2021-06-11 07:01:10,902 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=1082, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1175, PETRI_PLACES=98, PETRI_TRANSITIONS=89} [2021-06-11 07:01:10,902 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 63 predicate places. [2021-06-11 07:01:10,902 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:10,902 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 89 transitions, 1175 flow [2021-06-11 07:01:10,902 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 89 transitions, 1175 flow [2021-06-11 07:01:10,903 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 98 places, 89 transitions, 1175 flow [2021-06-11 07:01:11,019 INFO L129 PetriNetUnfolder]: 418/974 cut-off events. [2021-06-11 07:01:11,019 INFO L130 PetriNetUnfolder]: For 9663/10029 co-relation queries the response was YES. [2021-06-11 07:01:11,025 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4974 conditions, 974 events. 418/974 cut-off events. For 9663/10029 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 7518 event pairs, 115 based on Foata normal form. 70/926 useless extension candidates. Maximal degree in co-relation 4933. Up to 554 conditions per place. [2021-06-11 07:01:11,035 INFO L151 LiptonReduction]: Number of co-enabled transitions 722 [2021-06-11 07:01:11,041 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 07:01:11,041 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:11,041 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 139 [2021-06-11 07:01:11,042 INFO L480 AbstractCegarLoop]: Abstraction has has 98 places, 89 transitions, 1175 flow [2021-06-11 07:01:11,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,043 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:11,043 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:11,043 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-06-11 07:01:11,043 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:11,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:11,043 INFO L82 PathProgramCache]: Analyzing trace with hash 679992921, now seen corresponding path program 1 times [2021-06-11 07:01:11,043 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:11,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746266642] [2021-06-11 07:01:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:11,134 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:11,137 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,138 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:11,142 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 07:01:11,143 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:11,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:01:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:11,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746266642] [2021-06-11 07:01:11,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:11,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 07:01:11,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284447381] [2021-06-11 07:01:11,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 07:01:11,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:11,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 07:01:11,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 07:01:11,153 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-11 07:01:11,153 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 1175 flow. Second operand has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,154 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:11,154 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-11 07:01:11,154 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:11,308 INFO L129 PetriNetUnfolder]: 323/812 cut-off events. [2021-06-11 07:01:11,308 INFO L130 PetriNetUnfolder]: For 14285/16551 co-relation queries the response was YES. [2021-06-11 07:01:11,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 812 events. 323/812 cut-off events. For 14285/16551 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 6096 event pairs, 18 based on Foata normal form. 548/1255 useless extension candidates. Maximal degree in co-relation 3912. Up to 475 conditions per place. [2021-06-11 07:01:11,315 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 6 selfloop transitions, 18 changer transitions 5/87 dead transitions. [2021-06-11 07:01:11,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 87 transitions, 1097 flow [2021-06-11 07:01:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 07:01:11,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 07:01:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1029 transitions. [2021-06-11 07:01:11,318 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2021-06-11 07:01:11,318 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1029 transitions. [2021-06-11 07:01:11,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1029 transitions. [2021-06-11 07:01:11,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:11,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1029 transitions. [2021-06-11 07:01:11,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 147.0) internal successors, (1029), 7 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,323 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,323 INFO L185 Difference]: Start difference. First operand has 98 places, 89 transitions, 1175 flow. Second operand 7 states and 1029 transitions. [2021-06-11 07:01:11,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 87 transitions, 1097 flow [2021-06-11 07:01:11,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 87 transitions, 1048 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-06-11 07:01:11,340 INFO L241 Difference]: Finished difference. Result has 103 places, 82 transitions, 1024 flow [2021-06-11 07:01:11,341 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1024, PETRI_PLACES=103, PETRI_TRANSITIONS=82} [2021-06-11 07:01:11,341 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 68 predicate places. [2021-06-11 07:01:11,341 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:11,341 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 82 transitions, 1024 flow [2021-06-11 07:01:11,342 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 82 transitions, 1024 flow [2021-06-11 07:01:11,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 103 places, 82 transitions, 1024 flow [2021-06-11 07:01:11,412 INFO L129 PetriNetUnfolder]: 279/755 cut-off events. [2021-06-11 07:01:11,412 INFO L130 PetriNetUnfolder]: For 8001/8751 co-relation queries the response was YES. [2021-06-11 07:01:11,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4040 conditions, 755 events. 279/755 cut-off events. For 8001/8751 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 6027 event pairs, 18 based on Foata normal form. 45/700 useless extension candidates. Maximal degree in co-relation 3996. Up to 419 conditions per place. [2021-06-11 07:01:11,424 INFO L151 LiptonReduction]: Number of co-enabled transitions 750 [2021-06-11 07:01:11,428 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 07:01:11,428 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:11,428 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 87 [2021-06-11 07:01:11,429 INFO L480 AbstractCegarLoop]: Abstraction has has 103 places, 82 transitions, 1024 flow [2021-06-11 07:01:11,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,429 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:11,429 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:11,429 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-06-11 07:01:11,429 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:11,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:11,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1590730555, now seen corresponding path program 1 times [2021-06-11 07:01:11,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:11,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175558934] [2021-06-11 07:01:11,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:11,513 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,513 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:11,518 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,518 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:11,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:11,527 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-06-11 07:01:11,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:11,536 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,537 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:01:11,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:11,538 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175558934] [2021-06-11 07:01:11,538 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:11,538 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 07:01:11,538 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205973086] [2021-06-11 07:01:11,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 07:01:11,539 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:11,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 07:01:11,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 07:01:11,540 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 182 [2021-06-11 07:01:11,541 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 82 transitions, 1024 flow. Second operand has 6 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-06-11 07:01:11,541 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:11,541 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 182 [2021-06-11 07:01:11,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:11,707 INFO L129 PetriNetUnfolder]: 243/678 cut-off events. [2021-06-11 07:01:11,707 INFO L130 PetriNetUnfolder]: For 12262/14935 co-relation queries the response was YES. [2021-06-11 07:01:11,711 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3923 conditions, 678 events. 243/678 cut-off events. For 12262/14935 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 5216 event pairs, 0 based on Foata normal form. 495/1074 useless extension candidates. Maximal degree in co-relation 3877. Up to 395 conditions per place. [2021-06-11 07:01:11,718 INFO L132 encePairwiseOnDemand]: 175/182 looper letters, 2 selfloop transitions, 22 changer transitions 8/83 dead transitions. [2021-06-11 07:01:11,718 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 83 transitions, 1069 flow [2021-06-11 07:01:11,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 07:01:11,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 07:01:11,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1317 transitions. [2021-06-11 07:01:11,722 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8040293040293041 [2021-06-11 07:01:11,722 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1317 transitions. [2021-06-11 07:01:11,722 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1317 transitions. [2021-06-11 07:01:11,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:11,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1317 transitions. [2021-06-11 07:01:11,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 146.33333333333334) internal successors, (1317), 9 states have internal predecessors, (1317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,728 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 182.0) internal successors, (1820), 10 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:11,728 INFO L185 Difference]: Start difference. First operand has 103 places, 82 transitions, 1024 flow. Second operand 9 states and 1317 transitions. [2021-06-11 07:01:11,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 83 transitions, 1069 flow [2021-06-11 07:01:11,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 83 transitions, 972 flow, removed 21 selfloop flow, removed 6 redundant places. [2021-06-11 07:01:11,757 INFO L241 Difference]: Finished difference. Result has 108 places, 75 transitions, 907 flow [2021-06-11 07:01:11,757 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=907, PETRI_PLACES=108, PETRI_TRANSITIONS=75} [2021-06-11 07:01:11,757 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 73 predicate places. [2021-06-11 07:01:11,758 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:11,758 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 75 transitions, 907 flow [2021-06-11 07:01:11,758 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 75 transitions, 907 flow [2021-06-11 07:01:11,759 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 75 transitions, 907 flow [2021-06-11 07:01:11,815 INFO L129 PetriNetUnfolder]: 212/594 cut-off events. [2021-06-11 07:01:11,815 INFO L130 PetriNetUnfolder]: For 4734/5089 co-relation queries the response was YES. [2021-06-11 07:01:11,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2983 conditions, 594 events. 212/594 cut-off events. For 4734/5089 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 4501 event pairs, 0 based on Foata normal form. 33/544 useless extension candidates. Maximal degree in co-relation 2938. Up to 224 conditions per place. [2021-06-11 07:01:11,820 INFO L151 LiptonReduction]: Number of co-enabled transitions 674 [2021-06-11 07:01:11,824 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 07:01:11,824 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:11,824 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-06-11 07:01:11,825 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 75 transitions, 907 flow [2021-06-11 07:01:11,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 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-06-11 07:01:11,825 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:11,825 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-06-11 07:01:11,825 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-06-11 07:01:11,826 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:11,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash 42220718, now seen corresponding path program 1 times [2021-06-11 07:01:11,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:11,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776838784] [2021-06-11 07:01:11,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:11,918 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,919 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:11,927 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 07:01:11,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:11,938 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:11,948 INFO L142 QuantifierPusher]: treesize reduction 14, result has 69.6 percent of original size [2021-06-11 07:01:11,949 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 07:01:11,977 INFO L142 QuantifierPusher]: treesize reduction 17, result has 76.1 percent of original size [2021-06-11 07:01:11,978 INFO L147 QuantifierPusher]: treesize reduction 8, result has 85.2 percent of original size 46 [2021-06-11 07:01:12,013 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:12,014 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-11 07:01:12,032 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:12,032 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 07:01:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:12,045 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776838784] [2021-06-11 07:01:12,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:12,046 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 07:01:12,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107768745] [2021-06-11 07:01:12,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 07:01:12,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:12,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 07:01:12,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-11 07:01:12,048 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 182 [2021-06-11 07:01:12,048 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 75 transitions, 907 flow. Second operand has 9 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:12,048 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:12,048 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 182 [2021-06-11 07:01:12,049 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:12,460 INFO L129 PetriNetUnfolder]: 306/850 cut-off events. [2021-06-11 07:01:12,460 INFO L130 PetriNetUnfolder]: For 7575/8120 co-relation queries the response was YES. [2021-06-11 07:01:12,465 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4316 conditions, 850 events. 306/850 cut-off events. For 7575/8120 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 6965 event pairs, 0 based on Foata normal form. 69/794 useless extension candidates. Maximal degree in co-relation 4269. Up to 336 conditions per place. [2021-06-11 07:01:12,467 INFO L132 encePairwiseOnDemand]: 173/182 looper letters, 23 selfloop transitions, 24 changer transitions 10/88 dead transitions. [2021-06-11 07:01:12,468 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 88 transitions, 1251 flow [2021-06-11 07:01:12,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-11 07:01:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-06-11 07:01:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1321 transitions. [2021-06-11 07:01:12,470 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6598401598401599 [2021-06-11 07:01:12,470 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1321 transitions. [2021-06-11 07:01:12,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1321 transitions. [2021-06-11 07:01:12,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:12,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1321 transitions. [2021-06-11 07:01:12,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.0909090909091) internal successors, (1321), 11 states have internal predecessors, (1321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:12,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:12,475 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 182.0) internal successors, (2184), 12 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:12,475 INFO L185 Difference]: Start difference. First operand has 106 places, 75 transitions, 907 flow. Second operand 11 states and 1321 transitions. [2021-06-11 07:01:12,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 88 transitions, 1251 flow [2021-06-11 07:01:12,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 88 transitions, 1172 flow, removed 18 selfloop flow, removed 9 redundant places. [2021-06-11 07:01:12,519 INFO L241 Difference]: Finished difference. Result has 110 places, 76 transitions, 961 flow [2021-06-11 07:01:12,519 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=961, PETRI_PLACES=110, PETRI_TRANSITIONS=76} [2021-06-11 07:01:12,519 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2021-06-11 07:01:12,519 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:12,520 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 76 transitions, 961 flow [2021-06-11 07:01:12,522 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 76 transitions, 961 flow [2021-06-11 07:01:12,523 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 76 transitions, 961 flow [2021-06-11 07:01:12,618 INFO L129 PetriNetUnfolder]: 246/693 cut-off events. [2021-06-11 07:01:12,618 INFO L130 PetriNetUnfolder]: For 4420/4561 co-relation queries the response was YES. [2021-06-11 07:01:12,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 693 events. 246/693 cut-off events. For 4420/4561 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 5695 event pairs, 0 based on Foata normal form. 37/636 useless extension candidates. Maximal degree in co-relation 3035. Up to 272 conditions per place. [2021-06-11 07:01:12,630 INFO L151 LiptonReduction]: Number of co-enabled transitions 728 [2021-06-11 07:01:12,634 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 07:01:12,634 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:12,635 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 116 [2021-06-11 07:01:12,636 INFO L480 AbstractCegarLoop]: Abstraction has has 106 places, 76 transitions, 961 flow [2021-06-11 07:01:12,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 118.11111111111111) internal successors, (1063), 9 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:12,636 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:12,636 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-06-11 07:01:12,637 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-06-11 07:01:12,637 INFO L428 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:12,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1151610996, now seen corresponding path program 2 times [2021-06-11 07:01:12,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:12,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089167478] [2021-06-11 07:01:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:12,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:12,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:12,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:12,733 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:12,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-11 07:01:12,745 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:12,746 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:12,758 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:12,758 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:01:12,772 INFO L142 QuantifierPusher]: treesize reduction 3, result has 72.7 percent of original size [2021-06-11 07:01:12,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-06-11 07:01:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:12,783 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089167478] [2021-06-11 07:01:12,783 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:12,783 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 07:01:12,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316575591] [2021-06-11 07:01:12,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 07:01:12,783 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 07:01:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 07:01:12,786 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 182 [2021-06-11 07:01:12,787 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 76 transitions, 961 flow. Second operand has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:12,787 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:12,787 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 182 [2021-06-11 07:01:12,787 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:13,108 INFO L129 PetriNetUnfolder]: 296/821 cut-off events. [2021-06-11 07:01:13,109 INFO L130 PetriNetUnfolder]: For 6024/6268 co-relation queries the response was YES. [2021-06-11 07:01:13,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3708 conditions, 821 events. 296/821 cut-off events. For 6024/6268 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 6686 event pairs, 0 based on Foata normal form. 53/748 useless extension candidates. Maximal degree in co-relation 3661. Up to 336 conditions per place. [2021-06-11 07:01:13,116 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 18 selfloop transitions, 15 changer transitions 19/83 dead transitions. [2021-06-11 07:01:13,116 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 83 transitions, 1198 flow [2021-06-11 07:01:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 07:01:13,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 07:01:13,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2021-06-11 07:01:13,121 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6789638932496075 [2021-06-11 07:01:13,121 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2021-06-11 07:01:13,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2021-06-11 07:01:13,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:13,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2021-06-11 07:01:13,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,127 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 182.0) internal successors, (1456), 8 states have internal predecessors, (1456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,127 INFO L185 Difference]: Start difference. First operand has 106 places, 76 transitions, 961 flow. Second operand 7 states and 865 transitions. [2021-06-11 07:01:13,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 83 transitions, 1198 flow [2021-06-11 07:01:13,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 83 transitions, 1114 flow, removed 27 selfloop flow, removed 9 redundant places. [2021-06-11 07:01:13,166 INFO L241 Difference]: Finished difference. Result has 105 places, 64 transitions, 750 flow [2021-06-11 07:01:13,166 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=750, PETRI_PLACES=105, PETRI_TRANSITIONS=64} [2021-06-11 07:01:13,166 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2021-06-11 07:01:13,166 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:13,166 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 64 transitions, 750 flow [2021-06-11 07:01:13,167 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 64 transitions, 750 flow [2021-06-11 07:01:13,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 64 transitions, 750 flow [2021-06-11 07:01:13,213 INFO L129 PetriNetUnfolder]: 184/512 cut-off events. [2021-06-11 07:01:13,213 INFO L130 PetriNetUnfolder]: For 2651/2749 co-relation queries the response was YES. [2021-06-11 07:01:13,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2246 conditions, 512 events. 184/512 cut-off events. For 2651/2749 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 3824 event pairs, 0 based on Foata normal form. 19/455 useless extension candidates. Maximal degree in co-relation 2207. Up to 208 conditions per place. [2021-06-11 07:01:13,220 INFO L151 LiptonReduction]: Number of co-enabled transitions 564 [2021-06-11 07:01:13,223 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 07:01:13,223 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:13,223 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 57 [2021-06-11 07:01:13,224 INFO L480 AbstractCegarLoop]: Abstraction has has 101 places, 64 transitions, 750 flow [2021-06-11 07:01:13,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,224 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:13,224 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-06-11 07:01:13,224 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-06-11 07:01:13,225 INFO L428 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:13,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:13,225 INFO L82 PathProgramCache]: Analyzing trace with hash -481372606, now seen corresponding path program 3 times [2021-06-11 07:01:13,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:13,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314638528] [2021-06-11 07:01:13,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:13,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:13,327 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 07:01:13,333 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:13,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 07:01:13,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:13,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-06-11 07:01:13,367 INFO L142 QuantifierPusher]: treesize reduction 56, result has 47.7 percent of original size [2021-06-11 07:01:13,368 INFO L147 QuantifierPusher]: treesize reduction 8, result has 84.3 percent of original size 43 [2021-06-11 07:01:13,406 INFO L142 QuantifierPusher]: treesize reduction 37, result has 72.6 percent of original size [2021-06-11 07:01:13,409 INFO L147 QuantifierPusher]: treesize reduction 18, result has 81.6 percent of original size 80 [2021-06-11 07:01:13,466 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 07:01:13,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 07:01:13,496 INFO L142 QuantifierPusher]: treesize reduction 3, result has 82.4 percent of original size [2021-06-11 07:01:13,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 07:01:13,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:13,515 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314638528] [2021-06-11 07:01:13,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:13,515 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-11 07:01:13,515 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808328330] [2021-06-11 07:01:13,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 07:01:13,516 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:13,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 07:01:13,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-06-11 07:01:13,517 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 182 [2021-06-11 07:01:13,518 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 64 transitions, 750 flow. Second operand has 9 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,518 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:13,518 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 182 [2021-06-11 07:01:13,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:13,863 INFO L129 PetriNetUnfolder]: 318/848 cut-off events. [2021-06-11 07:01:13,863 INFO L130 PetriNetUnfolder]: For 5208/5411 co-relation queries the response was YES. [2021-06-11 07:01:13,867 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3716 conditions, 848 events. 318/848 cut-off events. For 5208/5411 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 6957 event pairs, 0 based on Foata normal form. 39/758 useless extension candidates. Maximal degree in co-relation 3675. Up to 368 conditions per place. [2021-06-11 07:01:13,868 INFO L132 encePairwiseOnDemand]: 172/182 looper letters, 20 selfloop transitions, 17 changer transitions 9/77 dead transitions. [2021-06-11 07:01:13,868 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 77 transitions, 1077 flow [2021-06-11 07:01:13,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 07:01:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 07:01:13,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1179 transitions. [2021-06-11 07:01:13,871 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6478021978021978 [2021-06-11 07:01:13,871 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1179 transitions. [2021-06-11 07:01:13,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1179 transitions. [2021-06-11 07:01:13,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:13,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1179 transitions. [2021-06-11 07:01:13,873 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 117.9) internal successors, (1179), 10 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,875 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,875 INFO L185 Difference]: Start difference. First operand has 101 places, 64 transitions, 750 flow. Second operand 10 states and 1179 transitions. [2021-06-11 07:01:13,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 77 transitions, 1077 flow [2021-06-11 07:01:13,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 77 transitions, 912 flow, removed 35 selfloop flow, removed 16 redundant places. [2021-06-11 07:01:13,911 INFO L241 Difference]: Finished difference. Result has 99 places, 67 transitions, 753 flow [2021-06-11 07:01:13,911 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=626, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=753, PETRI_PLACES=99, PETRI_TRANSITIONS=67} [2021-06-11 07:01:13,911 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 64 predicate places. [2021-06-11 07:01:13,912 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:13,912 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 67 transitions, 753 flow [2021-06-11 07:01:13,912 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 67 transitions, 753 flow [2021-06-11 07:01:13,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 99 places, 67 transitions, 753 flow [2021-06-11 07:01:13,963 INFO L129 PetriNetUnfolder]: 235/638 cut-off events. [2021-06-11 07:01:13,963 INFO L130 PetriNetUnfolder]: For 3379/3504 co-relation queries the response was YES. [2021-06-11 07:01:13,965 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2693 conditions, 638 events. 235/638 cut-off events. For 3379/3504 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 5047 event pairs, 0 based on Foata normal form. 25/567 useless extension candidates. Maximal degree in co-relation 2653. Up to 272 conditions per place. [2021-06-11 07:01:13,968 INFO L151 LiptonReduction]: Number of co-enabled transitions 620 [2021-06-11 07:01:13,971 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 07:01:13,971 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:13,971 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-06-11 07:01:13,972 INFO L480 AbstractCegarLoop]: Abstraction has has 99 places, 67 transitions, 753 flow [2021-06-11 07:01:13,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 116.11111111111111) internal successors, (1045), 9 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:13,972 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:13,972 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-06-11 07:01:13,973 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-06-11 07:01:13,973 INFO L428 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:13,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1650404630, now seen corresponding path program 4 times [2021-06-11 07:01:13,973 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:13,973 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119539213] [2021-06-11 07:01:13,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:14,031 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:14,031 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:14,034 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:14,035 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:14,041 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 07:01:14,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 07:01:14,058 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:14,059 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:14,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119539213] [2021-06-11 07:01:14,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:14,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 07:01:14,066 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440493208] [2021-06-11 07:01:14,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 07:01:14,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:14,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 07:01:14,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 07:01:14,068 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 182 [2021-06-11 07:01:14,069 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 67 transitions, 753 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:14,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:14,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 182 [2021-06-11 07:01:14,069 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:14,197 INFO L129 PetriNetUnfolder]: 259/698 cut-off events. [2021-06-11 07:01:14,198 INFO L130 PetriNetUnfolder]: For 3911/4055 co-relation queries the response was YES. [2021-06-11 07:01:14,201 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3007 conditions, 698 events. 259/698 cut-off events. For 3911/4055 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 5413 event pairs, 0 based on Foata normal form. 29/618 useless extension candidates. Maximal degree in co-relation 2965. Up to 304 conditions per place. [2021-06-11 07:01:14,203 INFO L132 encePairwiseOnDemand]: 177/182 looper letters, 25 selfloop transitions, 2 changer transitions 13/69 dead transitions. [2021-06-11 07:01:14,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 69 transitions, 864 flow [2021-06-11 07:01:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 07:01:14,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 07:01:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2021-06-11 07:01:14,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7042124542124543 [2021-06-11 07:01:14,205 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2021-06-11 07:01:14,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2021-06-11 07:01:14,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:14,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2021-06-11 07:01:14,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:14,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:14,208 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 182.0) internal successors, (1274), 7 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:14,208 INFO L185 Difference]: Start difference. First operand has 99 places, 67 transitions, 753 flow. Second operand 6 states and 769 transitions. [2021-06-11 07:01:14,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 69 transitions, 864 flow [2021-06-11 07:01:14,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 69 transitions, 791 flow, removed 26 selfloop flow, removed 5 redundant places. [2021-06-11 07:01:14,237 INFO L241 Difference]: Finished difference. Result has 100 places, 56 transitions, 562 flow [2021-06-11 07:01:14,237 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=100, PETRI_TRANSITIONS=56} [2021-06-11 07:01:14,238 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 65 predicate places. [2021-06-11 07:01:14,238 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:14,238 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 56 transitions, 562 flow [2021-06-11 07:01:14,238 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 56 transitions, 562 flow [2021-06-11 07:01:14,238 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 91 places, 56 transitions, 562 flow [2021-06-11 07:01:14,262 INFO L129 PetriNetUnfolder]: 90/254 cut-off events. [2021-06-11 07:01:14,262 INFO L130 PetriNetUnfolder]: For 1257/1303 co-relation queries the response was YES. [2021-06-11 07:01:14,263 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 254 events. 90/254 cut-off events. For 1257/1303 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 1593 event pairs, 0 based on Foata normal form. 8/224 useless extension candidates. Maximal degree in co-relation 1038. Up to 104 conditions per place. [2021-06-11 07:01:14,265 INFO L151 LiptonReduction]: Number of co-enabled transitions 420 [2021-06-11 07:01:14,267 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 07:01:14,268 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:14,268 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 30 [2021-06-11 07:01:14,268 INFO L480 AbstractCegarLoop]: Abstraction has has 91 places, 56 transitions, 562 flow [2021-06-11 07:01:14,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:14,268 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:14,269 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-06-11 07:01:14,269 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-06-11 07:01:14,269 INFO L428 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:14,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:14,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1230295214, now seen corresponding path program 5 times [2021-06-11 07:01:14,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:14,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26293547] [2021-06-11 07:01:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:14,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:14,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-11 07:01:14,394 INFO L142 QuantifierPusher]: treesize reduction 15, result has 83.1 percent of original size [2021-06-11 07:01:14,395 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 74 [2021-06-11 07:01:14,465 INFO L142 QuantifierPusher]: treesize reduction 15, result has 83.7 percent of original size [2021-06-11 07:01:14,466 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 77 [2021-06-11 07:01:14,528 INFO L142 QuantifierPusher]: treesize reduction 48, result has 53.4 percent of original size [2021-06-11 07:01:14,529 INFO L147 QuantifierPusher]: treesize reduction 4, result has 92.7 percent of original size 51 [2021-06-11 07:01:14,609 INFO L142 QuantifierPusher]: treesize reduction 50, result has 67.1 percent of original size [2021-06-11 07:01:14,611 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 102 [2021-06-11 07:01:14,721 INFO L142 QuantifierPusher]: treesize reduction 33, result has 47.6 percent of original size [2021-06-11 07:01:14,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-06-11 07:01:14,750 INFO L142 QuantifierPusher]: treesize reduction 28, result has 55.6 percent of original size [2021-06-11 07:01:14,750 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 35 [2021-06-11 07:01:14,790 INFO L142 QuantifierPusher]: treesize reduction 9, result has 87.1 percent of original size [2021-06-11 07:01:14,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-06-11 07:01:14,833 INFO L142 QuantifierPusher]: treesize reduction 29, result has 46.3 percent of original size [2021-06-11 07:01:14,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-06-11 07:01:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:14,847 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26293547] [2021-06-11 07:01:14,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:14,847 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 07:01:14,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166420693] [2021-06-11 07:01:14,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-11 07:01:14,847 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:14,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-11 07:01:14,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-06-11 07:01:14,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 182 [2021-06-11 07:01:14,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 56 transitions, 562 flow. Second operand has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:14,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:14,850 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 182 [2021-06-11 07:01:14,850 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:15,264 INFO L129 PetriNetUnfolder]: 132/361 cut-off events. [2021-06-11 07:01:15,264 INFO L130 PetriNetUnfolder]: For 1940/2006 co-relation queries the response was YES. [2021-06-11 07:01:15,266 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1532 conditions, 361 events. 132/361 cut-off events. For 1940/2006 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 2347 event pairs, 0 based on Foata normal form. 16/322 useless extension candidates. Maximal degree in co-relation 1490. Up to 160 conditions per place. [2021-06-11 07:01:15,266 INFO L132 encePairwiseOnDemand]: 174/182 looper letters, 11 selfloop transitions, 12 changer transitions 14/64 dead transitions. [2021-06-11 07:01:15,266 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 64 transitions, 772 flow [2021-06-11 07:01:15,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-11 07:01:15,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-06-11 07:01:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1118 transitions. [2021-06-11 07:01:15,268 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2021-06-11 07:01:15,268 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1118 transitions. [2021-06-11 07:01:15,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1118 transitions. [2021-06-11 07:01:15,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:15,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1118 transitions. [2021-06-11 07:01:15,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 111.8) internal successors, (1118), 10 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:15,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:15,272 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 182.0) internal successors, (2002), 11 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:15,272 INFO L185 Difference]: Start difference. First operand has 91 places, 56 transitions, 562 flow. Second operand 10 states and 1118 transitions. [2021-06-11 07:01:15,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 64 transitions, 772 flow [2021-06-11 07:01:15,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 64 transitions, 718 flow, removed 9 selfloop flow, removed 15 redundant places. [2021-06-11 07:01:15,282 INFO L241 Difference]: Finished difference. Result has 87 places, 47 transitions, 438 flow [2021-06-11 07:01:15,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=182, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=438, PETRI_PLACES=87, PETRI_TRANSITIONS=47} [2021-06-11 07:01:15,283 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 52 predicate places. [2021-06-11 07:01:15,283 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:15,283 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 47 transitions, 438 flow [2021-06-11 07:01:15,283 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 47 transitions, 438 flow [2021-06-11 07:01:15,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 47 transitions, 438 flow [2021-06-11 07:01:15,300 INFO L129 PetriNetUnfolder]: 47/170 cut-off events. [2021-06-11 07:01:15,300 INFO L130 PetriNetUnfolder]: For 1026/1067 co-relation queries the response was YES. [2021-06-11 07:01:15,301 INFO L84 FinitePrefix]: Finished finitePrefix Result has 722 conditions, 170 events. 47/170 cut-off events. For 1026/1067 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 917 event pairs, 0 based on Foata normal form. 7/159 useless extension candidates. Maximal degree in co-relation 689. Up to 60 conditions per place. [2021-06-11 07:01:15,302 INFO L151 LiptonReduction]: Number of co-enabled transitions 260 [2021-06-11 07:01:15,958 WARN L205 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-06-11 07:01:16,263 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 175 [2021-06-11 07:01:17,624 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 302 DAG size of output: 257 [2021-06-11 07:01:18,250 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-06-11 07:01:18,279 INFO L142 QuantifierPusher]: treesize reduction 168, result has 90.8 percent of original size [2021-06-11 07:01:18,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:01:18,285 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,286 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,289 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 07:01:18,292 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 07:01:18,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,303 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 07:01:18,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,307 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 07:01:18,308 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 07:01:18,312 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,313 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 07:01:18,314 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 07:01:18,314 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,315 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,316 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 07:01:18,316 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,317 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,317 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 07:01:18,317 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,318 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,320 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 07:01:18,321 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,323 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 07:01:18,323 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 07:01:18,323 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,324 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,325 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 2, 2, 1] term [2021-06-11 07:01:18,325 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,326 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,326 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 07:01:18,326 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,327 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,330 INFO L147 QuantifierPusher]: treesize reduction 499, result has 19.9 percent of original size 124 [2021-06-11 07:01:18,331 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 07:01:18,331 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,332 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,332 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 07:01:18,333 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,333 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,334 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 07:01:18,334 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,335 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,344 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 07:01:18,346 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,347 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,349 INFO L147 QuantifierPusher]: treesize reduction 6, result has 90.2 percent of original size 55 [2021-06-11 07:01:18,351 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,352 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 07:01:18,356 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,357 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,360 INFO L147 QuantifierPusher]: treesize reduction 13, result has 82.4 percent of original size 61 [2021-06-11 07:01:18,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,362 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,364 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 07:01:18,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,368 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 103 [2021-06-11 07:01:18,369 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,370 INFO L142 QuantifierPusher]: treesize reduction 13, result has 92.7 percent of original size [2021-06-11 07:01:18,370 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 4, 3, 2, 1] term [2021-06-11 07:01:18,370 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,372 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,372 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 4, 3, 2, 1] term [2021-06-11 07:01:18,372 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,373 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,373 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 5, 2, 2, 1] term [2021-06-11 07:01:18,374 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,374 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,376 INFO L147 QuantifierPusher]: treesize reduction 148, result has 52.1 percent of original size 161 [2021-06-11 07:01:18,376 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 07:01:18,378 INFO L142 QuantifierPusher]: treesize reduction 148, result has 64.3 percent of original size [2021-06-11 07:01:18,379 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 07:01:18,379 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,380 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,380 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 4, 4, 2, 2, 1] term [2021-06-11 07:01:18,380 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,381 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,382 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 4, 2, 2, 1] term [2021-06-11 07:01:18,382 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,382 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,385 INFO L147 QuantifierPusher]: treesize reduction 499, result has 19.9 percent of original size 124 [2021-06-11 07:01:18,385 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 4, 3, 4, 4, 4, 4, 3, 4, 2, 2, 1] term [2021-06-11 07:01:18,386 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 07:01:18,386 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:18,397 INFO L147 QuantifierPusher]: treesize reduction 4028, result has 7.2 percent of original size 311 [2021-06-11 07:01:19,130 WARN L205 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-06-11 07:01:19,432 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-06-11 07:01:20,813 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-06-11 07:01:21,434 WARN L205 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 255 [2021-06-11 07:01:21,438 INFO L163 LiptonReduction]: Checked pairs total: 6 [2021-06-11 07:01:21,438 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 07:01:21,438 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6155 [2021-06-11 07:01:21,439 INFO L480 AbstractCegarLoop]: Abstraction has has 84 places, 46 transitions, 436 flow [2021-06-11 07:01:21,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 110.0) internal successors, (1100), 10 states have internal predecessors, (1100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:21,439 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:21,439 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-06-11 07:01:21,439 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-06-11 07:01:21,440 INFO L428 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1647347272, now seen corresponding path program 6 times [2021-06-11 07:01:21,440 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:21,440 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179254951] [2021-06-11 07:01:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 07:01:21,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:21,523 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 07:01:21,526 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-06-11 07:01:21,527 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-11 07:01:21,545 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-06-11 07:01:21,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-11 07:01:21,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 07:01:21,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 07:01:21,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 07:01:21,574 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179254951] [2021-06-11 07:01:21,574 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 07:01:21,574 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 07:01:21,574 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656403719] [2021-06-11 07:01:21,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 07:01:21,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 07:01:21,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 07:01:21,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-11 07:01:21,576 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 184 [2021-06-11 07:01:21,577 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 46 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:21,577 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 07:01:21,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 184 [2021-06-11 07:01:21,577 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 07:01:21,696 INFO L129 PetriNetUnfolder]: 52/189 cut-off events. [2021-06-11 07:01:21,696 INFO L130 PetriNetUnfolder]: For 1230/1276 co-relation queries the response was YES. [2021-06-11 07:01:21,697 INFO L84 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 189 events. 52/189 cut-off events. For 1230/1276 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1000 event pairs, 0 based on Foata normal form. 9/179 useless extension candidates. Maximal degree in co-relation 790. Up to 68 conditions per place. [2021-06-11 07:01:21,697 INFO L132 encePairwiseOnDemand]: 178/184 looper letters, 8 selfloop transitions, 4 changer transitions 20/48 dead transitions. [2021-06-11 07:01:21,697 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 48 transitions, 515 flow [2021-06-11 07:01:21,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 07:01:21,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 07:01:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 767 transitions. [2021-06-11 07:01:21,699 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6947463768115942 [2021-06-11 07:01:21,699 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 767 transitions. [2021-06-11 07:01:21,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 767 transitions. [2021-06-11 07:01:21,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 07:01:21,700 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 767 transitions. [2021-06-11 07:01:21,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.83333333333333) internal successors, (767), 6 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:21,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:21,702 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 184.0) internal successors, (1288), 7 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:21,702 INFO L185 Difference]: Start difference. First operand has 84 places, 46 transitions, 436 flow. Second operand 6 states and 767 transitions. [2021-06-11 07:01:21,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 48 transitions, 515 flow [2021-06-11 07:01:21,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 48 transitions, 423 flow, removed 22 selfloop flow, removed 15 redundant places. [2021-06-11 07:01:21,708 INFO L241 Difference]: Finished difference. Result has 75 places, 28 transitions, 209 flow [2021-06-11 07:01:21,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=184, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=209, PETRI_PLACES=75, PETRI_TRANSITIONS=28} [2021-06-11 07:01:21,708 INFO L343 CegarLoopForPetriNet]: 35 programPoint places, 40 predicate places. [2021-06-11 07:01:21,709 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 07:01:21,709 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 28 transitions, 209 flow [2021-06-11 07:01:21,709 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 28 transitions, 209 flow [2021-06-11 07:01:21,709 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 28 transitions, 209 flow [2021-06-11 07:01:21,715 INFO L129 PetriNetUnfolder]: 10/45 cut-off events. [2021-06-11 07:01:21,715 INFO L130 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2021-06-11 07:01:21,715 INFO L84 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 45 events. 10/45 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 82 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 162. Up to 15 conditions per place. [2021-06-11 07:01:21,716 INFO L151 LiptonReduction]: Number of co-enabled transitions 26 [2021-06-11 07:01:21,716 INFO L163 LiptonReduction]: Checked pairs total: 0 [2021-06-11 07:01:21,716 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 07:01:21,716 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-06-11 07:01:21,717 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 28 transitions, 209 flow [2021-06-11 07:01:21,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 07:01:21,717 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 07:01:21,717 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 07:01:21,717 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-06-11 07:01:21,718 INFO L428 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 07:01:21,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 07:01:21,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1222419138, now seen corresponding path program 1 times [2021-06-11 07:01:21,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 07:01:21,718 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062499147] [2021-06-11 07:01:21,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 07:01:21,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 07:01:21,781 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 07:01:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 07:01:21,849 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 07:01:21,890 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 07:01:21,890 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 07:01:21,890 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-06-11 07:01:22,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 07:01:21 BasicIcfg [2021-06-11 07:01:22,001 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 07:01:22,001 INFO L168 Benchmark]: Toolchain (without parser) took 40857.93 ms. Allocated memory was 362.8 MB in the beginning and 1.0 GB in the end (delta: 650.1 MB). Free memory was 325.5 MB in the beginning and 848.1 MB in the end (delta: -522.6 MB). Peak memory consumption was 129.6 MB. Max. memory is 16.0 GB. [2021-06-11 07:01:22,001 INFO L168 Benchmark]: CDTParser took 0.86 ms. Allocated memory is still 362.8 MB. Free memory was 344.1 MB in the beginning and 344.0 MB in the end (delta: 71.9 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 07:01:22,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 602.33 ms. Allocated memory is still 362.8 MB. Free memory was 325.2 MB in the beginning and 318.4 MB in the end (delta: 6.9 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.0 GB. [2021-06-11 07:01:22,002 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.46 ms. Allocated memory is still 362.8 MB. Free memory was 318.4 MB in the beginning and 315.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 07:01:22,002 INFO L168 Benchmark]: Boogie Preprocessor took 44.15 ms. Allocated memory is still 362.8 MB. Free memory was 315.2 MB in the beginning and 312.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 07:01:22,002 INFO L168 Benchmark]: RCFGBuilder took 2787.21 ms. Allocated memory is still 362.8 MB. Free memory was 312.1 MB in the beginning and 247.1 MB in the end (delta: 64.9 MB). Peak memory consumption was 175.0 MB. Max. memory is 16.0 GB. [2021-06-11 07:01:22,002 INFO L168 Benchmark]: TraceAbstraction took 37333.08 ms. Allocated memory was 362.8 MB in the beginning and 1.0 GB in the end (delta: 650.1 MB). Free memory was 247.1 MB in the beginning and 848.1 MB in the end (delta: -601.0 MB). Peak memory consumption was 50.2 MB. Max. memory is 16.0 GB. [2021-06-11 07:01:22,002 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.86 ms. Allocated memory is still 362.8 MB. Free memory was 344.1 MB in the beginning and 344.0 MB in the end (delta: 71.9 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 602.33 ms. Allocated memory is still 362.8 MB. Free memory was 325.2 MB in the beginning and 318.4 MB in the end (delta: 6.9 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 84.46 ms. Allocated memory is still 362.8 MB. Free memory was 318.4 MB in the beginning and 315.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 44.15 ms. Allocated memory is still 362.8 MB. Free memory was 315.2 MB in the beginning and 312.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2787.21 ms. Allocated memory is still 362.8 MB. Free memory was 312.1 MB in the beginning and 247.1 MB in the end (delta: 64.9 MB). Peak memory consumption was 175.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 37333.08 ms. Allocated memory was 362.8 MB in the beginning and 1.0 GB in the end (delta: 650.1 MB). Free memory was 247.1 MB in the beginning and 848.1 MB in the end (delta: -601.0 MB). Peak memory consumption was 50.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18091.2ms, 102 PlacesBefore, 35 PlacesAfterwards, 94 TransitionsBefore, 27 TransitionsAfterwards, 1668 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 85 TotalNumberOfCompositions, 4547 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1739, positive: 1588, positive conditional: 0, positive unconditional: 1588, negative: 151, negative conditional: 0, negative unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1129, positive: 1083, positive conditional: 0, positive unconditional: 1083, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1129, positive: 1083, positive conditional: 0, positive unconditional: 1083, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1129, positive: 1045, positive conditional: 0, positive unconditional: 1045, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 84, positive: 38, positive conditional: 0, positive unconditional: 38, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1167, positive: 111, positive conditional: 0, positive unconditional: 111, negative: 1056, negative conditional: 0, negative unconditional: 1056, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1739, positive: 505, positive conditional: 0, positive unconditional: 505, negative: 105, negative conditional: 0, negative unconditional: 105, unknown: 1129, unknown conditional: 0, unknown unconditional: 1129] , Statistics on independence cache: Total cache size (in pairs): 1884, Positive cache size: 1838, Positive conditional cache size: 0, Positive unconditional cache size: 1838, Negative cache size: 46, Negative conditional cache size: 0, Negative unconditional cache size: 46 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 74.0ms, 32 PlacesBefore, 31 PlacesAfterwards, 22 TransitionsBefore, 22 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 268 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 70, positive: 50, positive conditional: 0, positive unconditional: 50, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 22, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 22, positive: 20, positive conditional: 0, positive unconditional: 20, 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: 67, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 70, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 1906, Positive cache size: 1858, Positive conditional cache size: 0, Positive unconditional cache size: 1858, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.4ms, 32 PlacesBefore, 32 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 244 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 56, positive: 39, positive conditional: 0, positive unconditional: 39, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.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: 56, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 1912, Positive cache size: 1864, Positive conditional cache size: 0, Positive unconditional cache size: 1864, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.9ms, 34 PlacesBefore, 34 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 210 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 48, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1912, Positive cache size: 1864, Positive conditional cache size: 0, Positive unconditional cache size: 1864, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 64.7ms, 37 PlacesBefore, 37 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 284 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 17, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 44, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 17, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1914, Positive cache size: 1865, Positive conditional cache size: 0, Positive unconditional cache size: 1865, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 49.4ms, 44 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 350 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 78 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 1917, Positive cache size: 1868, Positive conditional cache size: 0, Positive unconditional cache size: 1868, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 70.3ms, 48 PlacesBefore, 48 PlacesAfterwards, 45 TransitionsBefore, 45 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 96 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1918, Positive cache size: 1869, Positive conditional cache size: 0, Positive unconditional cache size: 1869, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 85.7ms, 53 PlacesBefore, 53 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 526 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 270 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 66, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 1920, Positive cache size: 1871, Positive conditional cache size: 0, Positive unconditional cache size: 1871, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 144.8ms, 59 PlacesBefore, 59 PlacesAfterwards, 71 TransitionsBefore, 71 TransitionsAfterwards, 594 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 306 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1920, Positive cache size: 1871, Positive conditional cache size: 0, Positive unconditional cache size: 1871, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 113.6ms, 66 PlacesBefore, 66 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 684 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 372 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 24, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 24, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 198.1ms, 66 PlacesBefore, 66 PlacesAfterwards, 92 TransitionsBefore, 92 TransitionsAfterwards, 764 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 420 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 120.4ms, 68 PlacesBefore, 67 PlacesAfterwards, 70 TransitionsBefore, 70 TransitionsAfterwards, 562 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.5ms, 79 PlacesBefore, 79 PlacesAfterwards, 88 TransitionsBefore, 88 TransitionsAfterwards, 632 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 448 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 16, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 141.3ms, 86 PlacesBefore, 86 PlacesAfterwards, 103 TransitionsBefore, 103 TransitionsAfterwards, 700 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 627 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 44, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 44, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 166.3ms, 97 PlacesBefore, 97 PlacesAfterwards, 111 TransitionsBefore, 111 TransitionsAfterwards, 732 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 660 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 99, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 99, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 100.0ms, 103 PlacesBefore, 103 PlacesAfterwards, 104 TransitionsBefore, 104 TransitionsAfterwards, 664 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 572 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 22, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 22, positive: 11, positive conditional: 0, positive unconditional: 11, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 138.4ms, 98 PlacesBefore, 98 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 722 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 86.5ms, 103 PlacesBefore, 103 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 750 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.3ms, 108 PlacesBefore, 106 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 674 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 112.2ms, 110 PlacesBefore, 106 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 728 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 56.7ms, 105 PlacesBefore, 101 PlacesAfterwards, 64 TransitionsBefore, 64 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.4ms, 99 PlacesBefore, 99 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 620 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 29.6ms, 100 PlacesBefore, 91 PlacesAfterwards, 56 TransitionsBefore, 56 TransitionsAfterwards, 420 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1921, Positive cache size: 1872, Positive conditional cache size: 0, Positive unconditional cache size: 1872, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6155.1ms, 87 PlacesBefore, 84 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 260 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 6 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.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] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 6, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 2032, Positive cache size: 1983, Positive conditional cache size: 0, Positive unconditional cache size: 1983, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5ms, 75 PlacesBefore, 63 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 26 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2032, Positive cache size: 1983, Positive conditional cache size: 0, Positive unconditional cache size: 1983, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2549; [L850] FCALL, FORK 0 pthread_create(&t2549, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L851] 0 pthread_t t2550; [L852] FCALL, FORK 0 pthread_create(&t2550, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L853] 0 pthread_t t2551; [L854] FCALL, FORK 0 pthread_create(&t2551, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 3 !(!expression) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] 1 y = 2 [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L752] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L753] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L754] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L756] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L772] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=53, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0) [L787] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1) [L788] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L789] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L790] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2) [L791] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L792] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L798] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L799] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L802] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L829] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L831] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 2 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L862] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L864] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L871] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L872] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L873] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L874] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L876] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.7ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 37047.6ms, OverallIterations: 25, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 6400.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18189.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 86 SDtfs, 114 SDslu, 44 SDs, 0 SdLazy, 1088 SolverSat, 400 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1805.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 2487.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1686occurred in iteration=14, InterpolantAutomatonStates: 157, 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: 92.5ms SsaConstructionTime, 945.8ms SatisfiabilityAnalysisTime, 2830.0ms InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 3605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...