/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-6f4246e9f5583d222ebb38ff8175c901f3a528f0-6f4246e [2021-04-29 00:19:40,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-29 00:19:40,713 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-29 00:19:40,770 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-29 00:19:40,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-29 00:19:40,776 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-29 00:19:40,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-29 00:19:40,789 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-29 00:19:40,793 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-29 00:19:40,801 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-29 00:19:40,802 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-29 00:19:40,803 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-29 00:19:40,804 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-29 00:19:40,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-29 00:19:40,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-29 00:19:40,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-29 00:19:40,815 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-29 00:19:40,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-29 00:19:40,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-29 00:19:40,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-29 00:19:40,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-29 00:19:40,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-29 00:19:40,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-29 00:19:40,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-29 00:19:40,847 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-29 00:19:40,847 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-29 00:19:40,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-29 00:19:40,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-29 00:19:40,851 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-29 00:19:40,852 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-29 00:19:40,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-29 00:19:40,853 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-29 00:19:40,855 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-29 00:19:40,856 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-29 00:19:40,857 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-29 00:19:40,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-29 00:19:40,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-29 00:19:40,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-29 00:19:40,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-29 00:19:40,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-29 00:19:40,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-29 00:19:40,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithPredicates.epf [2021-04-29 00:19:40,908 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-29 00:19:40,908 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-29 00:19:40,913 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-29 00:19:40,913 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-29 00:19:40,913 INFO L138 SettingsManager]: * Use SBE=true [2021-04-29 00:19:40,914 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-29 00:19:40,914 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-29 00:19:40,914 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-29 00:19:40,914 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-29 00:19:40,915 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-29 00:19:40,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-29 00:19:40,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-29 00:19:40,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-29 00:19:40,916 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-29 00:19:40,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-29 00:19:40,917 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-29 00:19:40,917 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-29 00:19:40,917 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-29 00:19:40,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-29 00:19:40,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-29 00:19:40,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-29 00:19:40,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-29 00:19:40,918 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-29 00:19:40,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-29 00:19:40,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-29 00:19:40,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-29 00:19:40,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-29 00:19:40,920 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES [2021-04-29 00:19:40,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-04-29 00:19:40,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-04-29 00:19:40,920 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-04-29 00:19:41,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-29 00:19:41,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-29 00:19:41,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-29 00:19:41,314 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-29 00:19:41,315 INFO L275 PluginConnector]: CDTParser initialized [2021-04-29 00:19:41,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2021-04-29 00:19:41,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0900666/215300cb2ee64f15b36e0caf17b731ce/FLAGe0158777d [2021-04-29 00:19:42,204 INFO L306 CDTParser]: Found 1 translation units. [2021-04-29 00:19:42,205 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.oepc.i [2021-04-29 00:19:42,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0900666/215300cb2ee64f15b36e0caf17b731ce/FLAGe0158777d [2021-04-29 00:19:42,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d0900666/215300cb2ee64f15b36e0caf17b731ce [2021-04-29 00:19:42,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-29 00:19:42,450 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-29 00:19:42,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-29 00:19:42,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-29 00:19:42,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-29 00:19:42,456 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:19:42" (1/1) ... [2021-04-29 00:19:42,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404cee68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:42, skipping insertion in model container [2021-04-29 00:19:42,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 12:19:42" (1/1) ... [2021-04-29 00:19:42,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-29 00:19:42,514 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-29 00:19:42,710 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/safe023_rmo.oepc.i[993,1006] [2021-04-29 00:19:42,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:19:42,972 INFO L203 MainTranslator]: Completed pre-run [2021-04-29 00:19:42,987 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/safe023_rmo.oepc.i[993,1006] [2021-04-29 00:19:43,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-29 00:19:43,184 INFO L208 MainTranslator]: Completed translation [2021-04-29 00:19:43,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43 WrapperNode [2021-04-29 00:19:43,185 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-29 00:19:43,186 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-29 00:19:43,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-29 00:19:43,187 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-29 00:19:43,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-29 00:19:43,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-29 00:19:43,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-29 00:19:43,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-29 00:19:43,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (1/1) ... [2021-04-29 00:19:43,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-29 00:19:43,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-29 00:19:43,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-29 00:19:43,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-29 00:19:43,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (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-04-29 00:19:43,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-29 00:19:43,469 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-29 00:19:43,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-29 00:19:43,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-29 00:19:43,470 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-29 00:19:43,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-29 00:19:43,470 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-29 00:19:43,470 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-29 00:19:43,471 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-29 00:19:43,471 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-29 00:19:43,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-29 00:19:43,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-29 00:19:43,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-29 00:19:43,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-29 00:19:43,474 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-29 00:19:47,587 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-29 00:19:47,588 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-29 00:19:47,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:19:47 BoogieIcfgContainer [2021-04-29 00:19:47,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-29 00:19:47,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-29 00:19:47,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-29 00:19:47,597 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-29 00:19:47,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 12:19:42" (1/3) ... [2021-04-29 00:19:47,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b14fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:19:47, skipping insertion in model container [2021-04-29 00:19:47,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 12:19:43" (2/3) ... [2021-04-29 00:19:47,599 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b14fc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 12:19:47, skipping insertion in model container [2021-04-29 00:19:47,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 12:19:47" (3/3) ... [2021-04-29 00:19:47,601 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.oepc.i [2021-04-29 00:19:47,610 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-29 00:19:47,616 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-29 00:19:47,618 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-29 00:19:47,673 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,674 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,674 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,674 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,675 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,675 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,676 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,677 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,693 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,694 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,695 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,696 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,700 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,704 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,705 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,706 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,709 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,710 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,710 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,710 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,710 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,711 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,711 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,711 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,712 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,714 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,715 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,718 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,719 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,719 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,720 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,721 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,722 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,723 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,724 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,725 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,726 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,728 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,729 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,730 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,731 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,732 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,744 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,745 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,746 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,746 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,747 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,748 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,748 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,749 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,755 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,755 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,757 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,759 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,760 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,761 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,761 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,762 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,762 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,763 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,764 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,765 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,766 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-29 00:19:47,768 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-29 00:19:47,793 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-29 00:19:47,822 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-29 00:19:47,822 INFO L377 AbstractCegarLoop]: Hoare is false [2021-04-29 00:19:47,822 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-29 00:19:47,822 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-29 00:19:47,822 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-29 00:19:47,823 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-29 00:19:47,823 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-29 00:19:47,823 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-29 00:19:47,840 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2021-04-29 00:19:47,925 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-04-29 00:19:47,925 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:19:47,934 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 70 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-04-29 00:19:47,934 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 99 transitions, 213 flow [2021-04-29 00:19:47,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 96 transitions, 201 flow [2021-04-29 00:19:47,945 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:19:47,966 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 96 transitions, 201 flow [2021-04-29 00:19:47,974 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 96 transitions, 201 flow [2021-04-29 00:19:47,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 201 flow [2021-04-29 00:19:48,031 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2021-04-29 00:19:48,031 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:19:48,033 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-04-29 00:19:48,045 INFO L146 LiptonReduction]: Number of co-enabled transitions 1786 [2021-04-29 00:19:51,469 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-04-29 00:19:51,588 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-04-29 00:19:52,158 WARN L205 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-04-29 00:19:52,381 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-04-29 00:19:53,866 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2021-04-29 00:19:54,344 WARN L205 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-04-29 00:19:56,645 WARN L205 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-04-29 00:19:57,673 WARN L205 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:20:01,295 WARN L205 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-04-29 00:20:01,846 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-04-29 00:20:04,438 WARN L205 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-04-29 00:20:05,491 WARN L205 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:20:06,792 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:20:07,872 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-04-29 00:20:10,557 WARN L205 SmtUtils]: Spent 2.68 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-04-29 00:20:11,794 WARN L205 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:20:13,156 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2021-04-29 00:20:13,773 WARN L205 SmtUtils]: Spent 613.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-04-29 00:20:16,644 WARN L205 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2021-04-29 00:20:18,010 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 269 [2021-04-29 00:20:21,940 WARN L205 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 231 DAG size of output: 190 [2021-04-29 00:20:22,620 WARN L205 SmtUtils]: Spent 678.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:20:25,732 WARN L205 SmtUtils]: Spent 3.11 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2021-04-29 00:20:27,214 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:20:28,806 WARN L205 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-04-29 00:20:29,541 WARN L205 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:20:32,909 WARN L205 SmtUtils]: Spent 3.36 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-04-29 00:20:34,460 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:20:36,219 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:20:37,000 WARN L205 SmtUtils]: Spent 778.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-04-29 00:20:40,695 WARN L205 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-04-29 00:20:42,454 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:20:44,521 WARN L205 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2021-04-29 00:20:45,425 WARN L205 SmtUtils]: Spent 900.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-04-29 00:20:49,523 WARN L205 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2021-04-29 00:20:51,492 WARN L205 SmtUtils]: Spent 1.97 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:20:55,229 WARN L205 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-04-29 00:20:56,229 WARN L205 SmtUtils]: Spent 996.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-04-29 00:21:00,691 WARN L205 SmtUtils]: Spent 4.46 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-04-29 00:21:02,748 WARN L205 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 265 [2021-04-29 00:21:05,258 WARN L205 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 231 DAG size of output: 191 [2021-04-29 00:21:06,363 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 189 [2021-04-29 00:21:11,581 WARN L205 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 315 DAG size of output: 271 [2021-04-29 00:21:13,893 WARN L205 SmtUtils]: Spent 2.31 s on a formula simplification that was a NOOP. DAG size: 268 [2021-04-29 00:21:16,611 WARN L205 SmtUtils]: Spent 2.70 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-04-29 00:21:17,802 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 188 [2021-04-29 00:21:23,164 WARN L205 SmtUtils]: Spent 5.36 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-04-29 00:21:25,729 WARN L205 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 267 [2021-04-29 00:21:26,879 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-04-29 00:21:29,340 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:29,454 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:29,597 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:29,729 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:29,867 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:21:30,016 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:21:30,159 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:21:30,301 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:21:30,443 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:30,570 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:30,725 WARN L205 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:30,855 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:30,998 WARN L205 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:21:31,134 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:31,259 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:21:31,397 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:31,529 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:31,655 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:31,793 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:31,929 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:32,096 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:32,259 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:21:32,415 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:32,567 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:21:32,696 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:32,819 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-04-29 00:21:32,950 WARN L205 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:33,059 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-04-29 00:21:34,158 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:34,308 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:34,460 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:34,605 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:34,715 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:34,827 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:34,931 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:35,041 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2021-04-29 00:21:35,311 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-29 00:21:35,545 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-29 00:21:35,782 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-29 00:21:36,012 WARN L205 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-04-29 00:21:36,229 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-04-29 00:21:36,440 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-04-29 00:21:36,647 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-04-29 00:21:36,859 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2021-04-29 00:21:36,999 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:37,139 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:37,283 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:37,424 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:37,548 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:37,670 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:37,791 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:37,913 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:38,042 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:21:38,172 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:21:38,300 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:21:38,430 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:21:38,582 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:38,730 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:38,877 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:39,027 WARN L205 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:39,178 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:39,328 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:39,477 WARN L205 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:39,627 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:39,755 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:39,877 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:40,000 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:40,126 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:40,235 WARN L205 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-04-29 00:21:40,341 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-04-29 00:21:40,452 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-04-29 00:21:40,562 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-04-29 00:21:40,701 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:40,834 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:40,962 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:41,106 WARN L205 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:41,224 WARN L205 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:21:41,340 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:21:41,450 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:21:41,563 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2021-04-29 00:21:41,671 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:41,784 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:41,898 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:42,033 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2021-04-29 00:21:42,257 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:21:42,481 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:21:42,705 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:21:42,927 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:21:43,174 WARN L205 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:21:43,418 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:21:43,654 WARN L205 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:21:43,883 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2021-04-29 00:21:44,162 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:21:44,430 WARN L205 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:21:44,693 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:21:44,928 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-04-29 00:21:45,115 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:21:45,291 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:21:45,491 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:21:45,695 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2021-04-29 00:21:45,929 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:21:46,166 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:21:46,397 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:21:46,610 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:21:46,846 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:21:47,078 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:21:47,323 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:21:47,579 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-04-29 00:21:47,772 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:21:47,970 WARN L205 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:21:48,167 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:21:48,359 WARN L205 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2021-04-29 00:21:48,589 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:21:48,813 WARN L205 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:21:49,019 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:21:49,231 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2021-04-29 00:21:49,508 WARN L205 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:21:49,787 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:21:50,082 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:21:50,379 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-04-29 00:21:50,619 WARN L205 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:21:50,870 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:21:51,115 WARN L205 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:21:51,343 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2021-04-29 00:21:51,512 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:51,687 WARN L205 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:51,854 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:52,034 WARN L205 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:52,201 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:52,370 WARN L205 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:52,528 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:52,691 WARN L205 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:21:52,972 WARN L205 SmtUtils]: Spent 278.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:21:53,263 WARN L205 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:21:53,562 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:21:53,834 WARN L205 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-04-29 00:21:54,026 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:21:54,209 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:21:54,393 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:21:54,595 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-04-29 00:21:54,793 WARN L205 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:21:54,978 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:21:55,178 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:21:55,382 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2021-04-29 00:21:55,559 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:55,728 WARN L205 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:55,913 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:56,096 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2021-04-29 00:21:56,501 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:21:56,826 WARN L205 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:21:57,107 WARN L205 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:21:57,401 WARN L205 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2021-04-29 00:21:57,741 WARN L205 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:21:58,061 WARN L205 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:21:58,411 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:21:58,760 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-04-29 00:21:59,081 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:21:59,409 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:21:59,837 WARN L205 SmtUtils]: Spent 426.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:22:00,176 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2021-04-29 00:22:00,533 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:00,883 WARN L205 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:01,226 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:01,559 WARN L205 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:01,996 WARN L205 SmtUtils]: Spent 434.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:22:02,400 WARN L205 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:22:02,797 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:22:03,208 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-04-29 00:22:03,591 WARN L205 SmtUtils]: Spent 378.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:03,993 WARN L205 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:04,395 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:04,777 WARN L205 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:05,182 WARN L205 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:05,598 WARN L205 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:06,014 WARN L205 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:06,432 WARN L205 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:06,775 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:22:07,147 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:22:07,518 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:22:07,872 WARN L205 SmtUtils]: Spent 353.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2021-04-29 00:22:08,265 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:08,672 WARN L205 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:09,070 WARN L205 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:09,462 WARN L205 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:09,831 WARN L205 SmtUtils]: Spent 366.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:10,192 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:10,512 WARN L205 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:10,897 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:11,270 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:11,648 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:12,000 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:12,338 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2021-04-29 00:22:12,693 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:22:13,039 WARN L205 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:22:13,389 WARN L205 SmtUtils]: Spent 346.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:22:13,730 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2021-04-29 00:22:14,897 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-04-29 00:22:15,412 WARN L205 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-04-29 00:22:16,493 WARN L205 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2021-04-29 00:22:17,033 WARN L205 SmtUtils]: Spent 535.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2021-04-29 00:22:18,138 WARN L205 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-04-29 00:22:18,643 WARN L205 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-04-29 00:22:19,774 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 111 DAG size of output: 109 [2021-04-29 00:22:20,320 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification that was a NOOP. DAG size: 105 [2021-04-29 00:22:20,737 WARN L205 SmtUtils]: Spent 413.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:21,146 WARN L205 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:21,546 WARN L205 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:21,944 WARN L205 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2021-04-29 00:22:21,993 INFO L158 LiptonReduction]: Checked pairs total: 16188 [2021-04-29 00:22:21,993 INFO L160 LiptonReduction]: Total number of compositions: 221 [2021-04-29 00:22:21,998 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 154055 [2021-04-29 00:22:22,022 INFO L129 PetriNetUnfolder]: 0/60 cut-off events. [2021-04-29 00:22:22,022 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:22:22,023 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:22,024 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2021-04-29 00:22:22,024 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:22,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:22,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1855050631, now seen corresponding path program 1 times [2021-04-29 00:22:22,044 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:22,044 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919542710] [2021-04-29 00:22:22,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:22,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:22,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:22,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:22,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919542710] [2021-04-29 00:22:22,404 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:22,405 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:22:22,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381063497] [2021-04-29 00:22:22,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:22:22,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:22,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:22:22,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:22:22,451 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 320 [2021-04-29 00:22:22,458 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 120 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:22,458 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:22,459 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 320 [2021-04-29 00:22:22,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:23,947 INFO L129 PetriNetUnfolder]: 1240/2812 cut-off events. [2021-04-29 00:22:23,947 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:22:23,960 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4686 conditions, 2812 events. 1240/2812 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 23985 event pairs, 734 based on Foata normal form. 33/1625 useless extension candidates. Maximal degree in co-relation 4618. Up to 1371 conditions per place. [2021-04-29 00:22:23,970 INFO L132 encePairwiseOnDemand]: 302/320 looper letters, 15 selfloop transitions, 2 changer transitions 87/136 dead transitions. [2021-04-29 00:22:23,970 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 136 transitions, 393 flow [2021-04-29 00:22:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:22:23,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:22:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2021-04-29 00:22:23,997 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8208333333333333 [2021-04-29 00:22:23,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 788 transitions. [2021-04-29 00:22:23,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 788 transitions. [2021-04-29 00:22:24,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:24,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 788 transitions. [2021-04-29 00:22:24,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.6666666666667) internal successors, (788), 3 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:24,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:24,028 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:24,032 INFO L185 Difference]: Start difference. First operand has 128 places, 120 transitions, 249 flow. Second operand 3 states and 788 transitions. [2021-04-29 00:22:24,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 136 transitions, 393 flow [2021-04-29 00:22:24,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 136 transitions, 390 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-04-29 00:22:24,044 INFO L241 Difference]: Finished difference. Result has 124 places, 42 transitions, 94 flow [2021-04-29 00:22:24,048 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=124, PETRI_TRANSITIONS=42} [2021-04-29 00:22:24,049 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -4 predicate places. [2021-04-29 00:22:24,050 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:24,050 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 42 transitions, 94 flow [2021-04-29 00:22:24,051 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 42 transitions, 94 flow [2021-04-29 00:22:24,051 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 42 transitions, 94 flow [2021-04-29 00:22:24,059 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-04-29 00:22:24,060 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:22:24,060 INFO L84 FinitePrefix]: Finished finitePrefix Result has 52 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 149 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-04-29 00:22:24,061 INFO L146 LiptonReduction]: Number of co-enabled transitions 1002 [2021-04-29 00:22:24,853 INFO L158 LiptonReduction]: Checked pairs total: 990 [2021-04-29 00:22:24,854 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:22:24,854 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 804 [2021-04-29 00:22:24,857 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 94 flow [2021-04-29 00:22:24,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:24,858 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:24,858 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:22:24,859 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-29 00:22:24,859 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:24,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:24,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1751841681, now seen corresponding path program 1 times [2021-04-29 00:22:24,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:24,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712069188] [2021-04-29 00:22:24,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:24,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:25,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:25,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:25,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:25,018 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712069188] [2021-04-29 00:22:25,018 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:25,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:22:25,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566540802] [2021-04-29 00:22:25,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:22:25,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:22:25,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:22:25,031 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 217 out of 320 [2021-04-29 00:22:25,033 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:25,033 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:25,033 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 217 of 320 [2021-04-29 00:22:25,033 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:25,082 INFO L129 PetriNetUnfolder]: 0/42 cut-off events. [2021-04-29 00:22:25,083 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:22:25,083 INFO L84 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 42 events. 0/42 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 147 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-29 00:22:25,084 INFO L132 encePairwiseOnDemand]: 317/320 looper letters, 1 selfloop transitions, 2 changer transitions 12/42 dead transitions. [2021-04-29 00:22:25,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 100 flow [2021-04-29 00:22:25,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:22:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:22:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2021-04-29 00:22:25,093 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6822916666666666 [2021-04-29 00:22:25,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 655 transitions. [2021-04-29 00:22:25,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 655 transitions. [2021-04-29 00:22:25,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:25,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 655 transitions. [2021-04-29 00:22:25,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.33333333333334) internal successors, (655), 3 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:25,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:25,102 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:25,103 INFO L185 Difference]: Start difference. First operand has 51 places, 42 transitions, 94 flow. Second operand 3 states and 655 transitions. [2021-04-29 00:22:25,103 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 100 flow [2021-04-29 00:22:25,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 96 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:22:25,105 INFO L241 Difference]: Finished difference. Result has 52 places, 30 transitions, 74 flow [2021-04-29 00:22:25,106 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2021-04-29 00:22:25,107 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -76 predicate places. [2021-04-29 00:22:25,107 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:25,107 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 30 transitions, 74 flow [2021-04-29 00:22:25,108 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 30 transitions, 74 flow [2021-04-29 00:22:25,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 30 transitions, 74 flow [2021-04-29 00:22:25,126 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-04-29 00:22:25,126 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-04-29 00:22:25,126 INFO L84 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 30 events. 0/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 75 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-29 00:22:25,127 INFO L146 LiptonReduction]: Number of co-enabled transitions 498 [2021-04-29 00:22:25,597 INFO L158 LiptonReduction]: Checked pairs total: 629 [2021-04-29 00:22:25,601 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:22:25,601 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 494 [2021-04-29 00:22:25,605 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 74 flow [2021-04-29 00:22:25,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:25,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:25,607 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:22:25,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-29 00:22:25,607 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:25,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1777254148, now seen corresponding path program 1 times [2021-04-29 00:22:25,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:25,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671379551] [2021-04-29 00:22:25,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:26,033 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:26,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:26,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:26,048 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671379551] [2021-04-29 00:22:26,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:26,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-04-29 00:22:26,049 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371319240] [2021-04-29 00:22:26,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-29 00:22:26,050 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:26,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-29 00:22:26,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-29 00:22:26,053 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 320 [2021-04-29 00:22:26,054 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:26,054 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:26,054 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 320 [2021-04-29 00:22:26,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:26,083 INFO L129 PetriNetUnfolder]: 0/30 cut-off events. [2021-04-29 00:22:26,083 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-04-29 00:22:26,084 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 30 events. 0/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 73 event pairs, 0 based on Foata normal form. 1/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-29 00:22:26,084 INFO L132 encePairwiseOnDemand]: 317/320 looper letters, 1 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2021-04-29 00:22:26,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 30 transitions, 80 flow [2021-04-29 00:22:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-29 00:22:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-04-29 00:22:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 661 transitions. [2021-04-29 00:22:26,092 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6885416666666667 [2021-04-29 00:22:26,093 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 661 transitions. [2021-04-29 00:22:26,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 661 transitions. [2021-04-29 00:22:26,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:26,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 661 transitions. [2021-04-29 00:22:26,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 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-04-29 00:22:26,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:26,101 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 320.0) internal successors, (1280), 4 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:26,101 INFO L185 Difference]: Start difference. First operand has 40 places, 30 transitions, 74 flow. Second operand 3 states and 661 transitions. [2021-04-29 00:22:26,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 30 transitions, 80 flow [2021-04-29 00:22:26,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:22:26,103 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 76 flow [2021-04-29 00:22:26,104 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-04-29 00:22:26,104 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -87 predicate places. [2021-04-29 00:22:26,104 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:26,104 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 76 flow [2021-04-29 00:22:26,105 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 76 flow [2021-04-29 00:22:26,105 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 29 transitions, 76 flow [2021-04-29 00:22:26,113 INFO L129 PetriNetUnfolder]: 0/29 cut-off events. [2021-04-29 00:22:26,114 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-04-29 00:22:26,114 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 29 events. 0/29 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 71 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-29 00:22:26,114 INFO L146 LiptonReduction]: Number of co-enabled transitions 462 [2021-04-29 00:22:26,191 INFO L158 LiptonReduction]: Checked pairs total: 572 [2021-04-29 00:22:26,192 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:22:26,192 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 88 [2021-04-29 00:22:26,193 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 76 flow [2021-04-29 00:22:26,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:26,195 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:26,195 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:22:26,195 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-29 00:22:26,195 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:26,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:26,196 INFO L82 PathProgramCache]: Analyzing trace with hash -613379474, now seen corresponding path program 1 times [2021-04-29 00:22:26,196 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:26,197 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638878128] [2021-04-29 00:22:26,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:26,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:26,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:26,327 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:26,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:26,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638878128] [2021-04-29 00:22:26,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:26,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-29 00:22:26,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097302066] [2021-04-29 00:22:26,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:22:26,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:22:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:22:26,346 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 320 [2021-04-29 00:22:26,348 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 212.75) internal successors, (851), 4 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:26,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:26,349 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 320 [2021-04-29 00:22:26,349 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:26,426 INFO L129 PetriNetUnfolder]: 0/40 cut-off events. [2021-04-29 00:22:26,428 INFO L130 PetriNetUnfolder]: For 9/11 co-relation queries the response was YES. [2021-04-29 00:22:26,428 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 40 events. 0/40 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 0 based on Foata normal form. 3/32 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2021-04-29 00:22:26,428 INFO L132 encePairwiseOnDemand]: 316/320 looper letters, 1 selfloop transitions, 3 changer transitions 2/30 dead transitions. [2021-04-29 00:22:26,428 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 30 transitions, 91 flow [2021-04-29 00:22:26,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:22:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:22:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 855 transitions. [2021-04-29 00:22:26,440 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.66796875 [2021-04-29 00:22:26,440 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 855 transitions. [2021-04-29 00:22:26,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 855 transitions. [2021-04-29 00:22:26,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:26,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 855 transitions. [2021-04-29 00:22:26,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 213.75) internal successors, (855), 4 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:26,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:26,451 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 320.0) internal successors, (1600), 5 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:26,451 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 76 flow. Second operand 4 states and 855 transitions. [2021-04-29 00:22:26,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 30 transitions, 91 flow [2021-04-29 00:22:26,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 85 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:22:26,455 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 84 flow [2021-04-29 00:22:26,456 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=320, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-04-29 00:22:26,456 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -85 predicate places. [2021-04-29 00:22:26,456 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:26,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 84 flow [2021-04-29 00:22:26,457 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 84 flow [2021-04-29 00:22:26,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 84 flow [2021-04-29 00:22:26,473 INFO L129 PetriNetUnfolder]: 0/28 cut-off events. [2021-04-29 00:22:26,473 INFO L130 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2021-04-29 00:22:26,474 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 28 events. 0/28 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 64 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-04-29 00:22:26,474 INFO L146 LiptonReduction]: Number of co-enabled transitions 398 [2021-04-29 00:22:26,609 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:22:26,741 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2021-04-29 00:22:26,865 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-04-29 00:22:26,978 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2021-04-29 00:22:27,031 INFO L158 LiptonReduction]: Checked pairs total: 948 [2021-04-29 00:22:27,031 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 00:22:27,031 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 575 [2021-04-29 00:22:27,033 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 84 flow [2021-04-29 00:22:27,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 212.75) internal successors, (851), 4 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:27,035 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:27,035 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:22:27,035 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-29 00:22:27,036 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:27,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:27,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1589247366, now seen corresponding path program 1 times [2021-04-29 00:22:27,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:27,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901259885] [2021-04-29 00:22:27,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:27,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:27,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:22:27,229 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:27,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-29 00:22:27,308 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:27,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:22:27,367 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:27,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:22:27,451 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:27,453 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:22:27,549 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:27,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:22:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:27,552 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901259885] [2021-04-29 00:22:27,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:27,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:22:27,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708516872] [2021-04-29 00:22:27,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:22:27,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:27,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:22:27,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:22:27,556 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 321 [2021-04-29 00:22:27,559 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 84 flow. Second operand has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:27,559 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:27,559 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 321 [2021-04-29 00:22:27,559 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:28,339 INFO L129 PetriNetUnfolder]: 155/386 cut-off events. [2021-04-29 00:22:28,339 INFO L130 PetriNetUnfolder]: For 156/156 co-relation queries the response was YES. [2021-04-29 00:22:28,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 386 events. 155/386 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2267 event pairs, 6 based on Foata normal form. 3/300 useless extension candidates. Maximal degree in co-relation 765. Up to 210 conditions per place. [2021-04-29 00:22:28,344 INFO L132 encePairwiseOnDemand]: 311/321 looper letters, 16 selfloop transitions, 13 changer transitions 2/47 dead transitions. [2021-04-29 00:22:28,345 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 47 transitions, 190 flow [2021-04-29 00:22:28,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:22:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:22:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1017 transitions. [2021-04-29 00:22:28,355 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5280373831775701 [2021-04-29 00:22:28,355 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1017 transitions. [2021-04-29 00:22:28,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1017 transitions. [2021-04-29 00:22:28,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:28,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1017 transitions. [2021-04-29 00:22:28,360 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 169.5) internal successors, (1017), 6 states have internal predecessors, (1017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:28,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:28,370 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:28,370 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 84 flow. Second operand 6 states and 1017 transitions. [2021-04-29 00:22:28,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 47 transitions, 190 flow [2021-04-29 00:22:28,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 47 transitions, 175 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-04-29 00:22:28,374 INFO L241 Difference]: Finished difference. Result has 45 places, 38 transitions, 151 flow [2021-04-29 00:22:28,375 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=45, PETRI_TRANSITIONS=38} [2021-04-29 00:22:28,375 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -83 predicate places. [2021-04-29 00:22:28,375 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:28,376 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 38 transitions, 151 flow [2021-04-29 00:22:28,376 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 38 transitions, 151 flow [2021-04-29 00:22:28,377 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 38 transitions, 151 flow [2021-04-29 00:22:28,406 INFO L129 PetriNetUnfolder]: 21/106 cut-off events. [2021-04-29 00:22:28,407 INFO L130 PetriNetUnfolder]: For 47/93 co-relation queries the response was YES. [2021-04-29 00:22:28,408 INFO L84 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 106 events. 21/106 cut-off events. For 47/93 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 516 event pairs, 3 based on Foata normal form. 1/78 useless extension candidates. Maximal degree in co-relation 216. Up to 32 conditions per place. [2021-04-29 00:22:28,410 INFO L146 LiptonReduction]: Number of co-enabled transitions 466 [2021-04-29 00:22:29,335 INFO L158 LiptonReduction]: Checked pairs total: 171 [2021-04-29 00:22:29,336 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:22:29,336 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 961 [2021-04-29 00:22:29,338 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 151 flow [2021-04-29 00:22:29,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 165.0) internal successors, (1155), 7 states have internal predecessors, (1155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:29,339 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:29,339 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:22:29,339 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-29 00:22:29,340 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash 836697734, now seen corresponding path program 1 times [2021-04-29 00:22:29,340 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:29,340 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387175819] [2021-04-29 00:22:29,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:29,452 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:29,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:22:29,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:29,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:22:29,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:29,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:22:29,521 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:29,525 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-04-29 00:22:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:29,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387175819] [2021-04-29 00:22:29,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:29,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:22:29,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552263061] [2021-04-29 00:22:29,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:22:29,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:29,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:22:29,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:22:29,581 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 321 [2021-04-29 00:22:29,583 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 165.4) internal successors, (827), 5 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:29,583 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:29,583 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 321 [2021-04-29 00:22:29,584 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:30,244 INFO L129 PetriNetUnfolder]: 152/368 cut-off events. [2021-04-29 00:22:30,245 INFO L130 PetriNetUnfolder]: For 279/325 co-relation queries the response was YES. [2021-04-29 00:22:30,247 INFO L84 FinitePrefix]: Finished finitePrefix Result has 942 conditions, 368 events. 152/368 cut-off events. For 279/325 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2061 event pairs, 9 based on Foata normal form. 13/301 useless extension candidates. Maximal degree in co-relation 929. Up to 213 conditions per place. [2021-04-29 00:22:30,250 INFO L132 encePairwiseOnDemand]: 312/321 looper letters, 18 selfloop transitions, 14 changer transitions 0/48 dead transitions. [2021-04-29 00:22:30,250 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 252 flow [2021-04-29 00:22:30,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:22:30,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:22:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1009 transitions. [2021-04-29 00:22:30,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5238836967808931 [2021-04-29 00:22:30,258 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1009 transitions. [2021-04-29 00:22:30,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1009 transitions. [2021-04-29 00:22:30,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:30,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1009 transitions. [2021-04-29 00:22:30,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 168.16666666666666) internal successors, (1009), 6 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:30,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:30,269 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 321.0) internal successors, (2247), 7 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:30,269 INFO L185 Difference]: Start difference. First operand has 44 places, 38 transitions, 151 flow. Second operand 6 states and 1009 transitions. [2021-04-29 00:22:30,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 252 flow [2021-04-29 00:22:30,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 48 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-04-29 00:22:30,273 INFO L241 Difference]: Finished difference. Result has 51 places, 43 transitions, 234 flow [2021-04-29 00:22:30,273 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=234, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2021-04-29 00:22:30,274 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -77 predicate places. [2021-04-29 00:22:30,274 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:30,274 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 43 transitions, 234 flow [2021-04-29 00:22:30,275 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 43 transitions, 234 flow [2021-04-29 00:22:30,275 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 43 transitions, 234 flow [2021-04-29 00:22:30,325 INFO L129 PetriNetUnfolder]: 58/187 cut-off events. [2021-04-29 00:22:30,325 INFO L130 PetriNetUnfolder]: For 243/306 co-relation queries the response was YES. [2021-04-29 00:22:30,326 INFO L84 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 187 events. 58/187 cut-off events. For 243/306 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 997 event pairs, 19 based on Foata normal form. 3/140 useless extension candidates. Maximal degree in co-relation 495. Up to 80 conditions per place. [2021-04-29 00:22:30,329 INFO L146 LiptonReduction]: Number of co-enabled transitions 512 [2021-04-29 00:22:30,474 INFO L158 LiptonReduction]: Checked pairs total: 102 [2021-04-29 00:22:30,474 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:22:30,474 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 200 [2021-04-29 00:22:30,476 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 234 flow [2021-04-29 00:22:30,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 165.4) internal successors, (827), 5 states have internal predecessors, (827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:30,478 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:30,478 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:22:30,478 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-29 00:22:30,479 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:30,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:30,479 INFO L82 PathProgramCache]: Analyzing trace with hash -752467428, now seen corresponding path program 1 times [2021-04-29 00:22:30,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:30,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641179664] [2021-04-29 00:22:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:30,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:30,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:30,643 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:30,658 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:22:30,659 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:22:30,690 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:30,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:22:30,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:30,693 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641179664] [2021-04-29 00:22:30,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:30,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-04-29 00:22:30,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49889355] [2021-04-29 00:22:30,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-04-29 00:22:30,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:30,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-04-29 00:22:30,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-04-29 00:22:30,696 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 321 [2021-04-29 00:22:30,698 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 234.75) internal successors, (939), 4 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:30,698 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:30,698 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 321 [2021-04-29 00:22:30,698 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:31,301 INFO L129 PetriNetUnfolder]: 894/1624 cut-off events. [2021-04-29 00:22:31,302 INFO L130 PetriNetUnfolder]: For 1430/1523 co-relation queries the response was YES. [2021-04-29 00:22:31,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3955 conditions, 1624 events. 894/1624 cut-off events. For 1430/1523 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 11487 event pairs, 457 based on Foata normal form. 158/952 useless extension candidates. Maximal degree in co-relation 3938. Up to 1090 conditions per place. [2021-04-29 00:22:31,321 INFO L132 encePairwiseOnDemand]: 309/321 looper letters, 20 selfloop transitions, 20 changer transitions 0/71 dead transitions. [2021-04-29 00:22:31,321 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 71 transitions, 370 flow [2021-04-29 00:22:31,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:22:31,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:22:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1212 transitions. [2021-04-29 00:22:31,329 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7551401869158878 [2021-04-29 00:22:31,329 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1212 transitions. [2021-04-29 00:22:31,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1212 transitions. [2021-04-29 00:22:31,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:31,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1212 transitions. [2021-04-29 00:22:31,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 242.4) internal successors, (1212), 5 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:31,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:31,341 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 321.0) internal successors, (1926), 6 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:31,341 INFO L185 Difference]: Start difference. First operand has 51 places, 43 transitions, 234 flow. Second operand 5 states and 1212 transitions. [2021-04-29 00:22:31,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 71 transitions, 370 flow [2021-04-29 00:22:31,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 71 transitions, 358 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-04-29 00:22:31,349 INFO L241 Difference]: Finished difference. Result has 55 places, 62 transitions, 372 flow [2021-04-29 00:22:31,349 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=55, PETRI_TRANSITIONS=62} [2021-04-29 00:22:31,349 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -73 predicate places. [2021-04-29 00:22:31,350 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:31,350 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 62 transitions, 372 flow [2021-04-29 00:22:31,350 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 62 transitions, 372 flow [2021-04-29 00:22:31,351 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 62 transitions, 372 flow [2021-04-29 00:22:31,604 INFO L129 PetriNetUnfolder]: 907/1706 cut-off events. [2021-04-29 00:22:31,604 INFO L130 PetriNetUnfolder]: For 1247/1440 co-relation queries the response was YES. [2021-04-29 00:22:31,614 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5203 conditions, 1706 events. 907/1706 cut-off events. For 1247/1440 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 12190 event pairs, 404 based on Foata normal form. 33/914 useless extension candidates. Maximal degree in co-relation 5185. Up to 1238 conditions per place. [2021-04-29 00:22:31,633 INFO L146 LiptonReduction]: Number of co-enabled transitions 708 [2021-04-29 00:22:31,810 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:22:31,810 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:22:31,811 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 461 [2021-04-29 00:22:31,812 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 62 transitions, 372 flow [2021-04-29 00:22:31,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 234.75) internal successors, (939), 4 states have internal predecessors, (939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:31,813 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:31,813 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:22:31,813 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-29 00:22:31,813 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:31,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:31,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1429740756, now seen corresponding path program 1 times [2021-04-29 00:22:31,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:31,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442136339] [2021-04-29 00:22:31,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:31,934 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:31,936 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:31,945 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:31,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:31,961 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:22:31,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:22:31,994 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:31,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:22:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:31,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442136339] [2021-04-29 00:22:31,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:31,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:22:31,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721562384] [2021-04-29 00:22:31,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-04-29 00:22:31,997 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:31,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-04-29 00:22:31,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-04-29 00:22:32,000 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 321 [2021-04-29 00:22:32,002 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 372 flow. Second operand has 5 states, 5 states have (on average 234.8) internal successors, (1174), 5 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:32,002 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:32,002 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 321 [2021-04-29 00:22:32,002 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:32,554 INFO L129 PetriNetUnfolder]: 588/1315 cut-off events. [2021-04-29 00:22:32,555 INFO L130 PetriNetUnfolder]: For 1194/4641 co-relation queries the response was YES. [2021-04-29 00:22:32,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5087 conditions, 1315 events. 588/1315 cut-off events. For 1194/4641 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 10072 event pairs, 88 based on Foata normal form. 215/841 useless extension candidates. Maximal degree in co-relation 5067. Up to 992 conditions per place. [2021-04-29 00:22:32,572 INFO L132 encePairwiseOnDemand]: 309/321 looper letters, 11 selfloop transitions, 39 changer transitions 9/90 dead transitions. [2021-04-29 00:22:32,573 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 90 transitions, 656 flow [2021-04-29 00:22:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:22:32,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:22:32,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1699 transitions. [2021-04-29 00:22:32,584 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7561192701379618 [2021-04-29 00:22:32,584 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1699 transitions. [2021-04-29 00:22:32,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1699 transitions. [2021-04-29 00:22:32,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:32,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1699 transitions. [2021-04-29 00:22:32,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 242.71428571428572) internal successors, (1699), 7 states have internal predecessors, (1699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:32,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:32,599 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 321.0) internal successors, (2568), 8 states have internal predecessors, (2568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:32,600 INFO L185 Difference]: Start difference. First operand has 55 places, 62 transitions, 372 flow. Second operand 7 states and 1699 transitions. [2021-04-29 00:22:32,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 90 transitions, 656 flow [2021-04-29 00:22:32,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 90 transitions, 646 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-04-29 00:22:32,616 INFO L241 Difference]: Finished difference. Result has 63 places, 81 transitions, 623 flow [2021-04-29 00:22:32,616 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=623, PETRI_PLACES=63, PETRI_TRANSITIONS=81} [2021-04-29 00:22:32,617 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -65 predicate places. [2021-04-29 00:22:32,617 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:32,617 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 81 transitions, 623 flow [2021-04-29 00:22:32,618 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 81 transitions, 623 flow [2021-04-29 00:22:32,619 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 81 transitions, 623 flow [2021-04-29 00:22:32,846 INFO L129 PetriNetUnfolder]: 532/1277 cut-off events. [2021-04-29 00:22:32,846 INFO L130 PetriNetUnfolder]: For 2196/2500 co-relation queries the response was YES. [2021-04-29 00:22:32,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5475 conditions, 1277 events. 532/1277 cut-off events. For 2196/2500 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 10057 event pairs, 84 based on Foata normal form. 10/712 useless extension candidates. Maximal degree in co-relation 5453. Up to 911 conditions per place. [2021-04-29 00:22:32,882 INFO L146 LiptonReduction]: Number of co-enabled transitions 822 [2021-04-29 00:22:33,024 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:22:33,025 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:22:33,025 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 408 [2021-04-29 00:22:33,026 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 81 transitions, 623 flow [2021-04-29 00:22:33,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 234.8) internal successors, (1174), 5 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:33,028 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:22:33,028 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-04-29 00:22:33,028 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-29 00:22:33,028 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:22:33,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:22:33,029 INFO L82 PathProgramCache]: Analyzing trace with hash 846793279, now seen corresponding path program 1 times [2021-04-29 00:22:33,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:22:33,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681928858] [2021-04-29 00:22:33,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:22:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:22:33,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:33,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:33,245 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:33,247 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:33,264 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:33,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:22:33,285 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-04-29 00:22:33,287 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:22:33,328 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:22:33,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-04-29 00:22:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:22:33,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681928858] [2021-04-29 00:22:33,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:22:33,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:22:33,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970533045] [2021-04-29 00:22:33,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:22:33,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:22:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:22:33,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:22:33,335 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 321 [2021-04-29 00:22:33,337 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 81 transitions, 623 flow. Second operand has 6 states, 6 states have (on average 234.83333333333334) internal successors, (1409), 6 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:33,337 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:22:33,337 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 321 [2021-04-29 00:22:33,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:22:34,012 INFO L129 PetriNetUnfolder]: 336/910 cut-off events. [2021-04-29 00:22:34,013 INFO L130 PetriNetUnfolder]: For 2642/13307 co-relation queries the response was YES. [2021-04-29 00:22:34,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4678 conditions, 910 events. 336/910 cut-off events. For 2642/13307 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 7016 event pairs, 7 based on Foata normal form. 171/599 useless extension candidates. Maximal degree in co-relation 4654. Up to 722 conditions per place. [2021-04-29 00:22:34,026 INFO L132 encePairwiseOnDemand]: 309/321 looper letters, 2 selfloop transitions, 49 changer transitions 9/91 dead transitions. [2021-04-29 00:22:34,026 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 91 transitions, 821 flow [2021-04-29 00:22:34,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:22:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:22:34,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2168 transitions. [2021-04-29 00:22:34,037 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7504326756663205 [2021-04-29 00:22:34,037 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 2168 transitions. [2021-04-29 00:22:34,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 2168 transitions. [2021-04-29 00:22:34,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:22:34,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 2168 transitions. [2021-04-29 00:22:34,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 240.88888888888889) internal successors, (2168), 9 states have internal predecessors, (2168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:34,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 321.0) internal successors, (3210), 10 states have internal predecessors, (3210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:34,055 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 321.0) internal successors, (3210), 10 states have internal predecessors, (3210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:22:34,055 INFO L185 Difference]: Start difference. First operand has 63 places, 81 transitions, 623 flow. Second operand 9 states and 2168 transitions. [2021-04-29 00:22:34,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 91 transitions, 821 flow [2021-04-29 00:22:34,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 712 flow, removed 41 selfloop flow, removed 4 redundant places. [2021-04-29 00:22:34,094 INFO L241 Difference]: Finished difference. Result has 70 places, 82 transitions, 653 flow [2021-04-29 00:22:34,094 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=653, PETRI_PLACES=70, PETRI_TRANSITIONS=82} [2021-04-29 00:22:34,095 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -58 predicate places. [2021-04-29 00:22:34,095 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:22:34,095 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 70 places, 82 transitions, 653 flow [2021-04-29 00:22:34,096 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 70 places, 82 transitions, 653 flow [2021-04-29 00:22:34,097 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 82 transitions, 653 flow [2021-04-29 00:22:34,244 INFO L129 PetriNetUnfolder]: 309/919 cut-off events. [2021-04-29 00:22:34,244 INFO L130 PetriNetUnfolder]: For 1518/1632 co-relation queries the response was YES. [2021-04-29 00:22:34,254 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3899 conditions, 919 events. 309/919 cut-off events. For 1518/1632 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 7803 event pairs, 9 based on Foata normal form. 1/477 useless extension candidates. Maximal degree in co-relation 3875. Up to 360 conditions per place. [2021-04-29 00:22:34,268 INFO L146 LiptonReduction]: Number of co-enabled transitions 786 [2021-04-29 00:22:37,393 WARN L205 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-04-29 00:22:38,774 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 176 [2021-04-29 00:22:44,795 WARN L205 SmtUtils]: Spent 6.02 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-29 00:22:47,686 WARN L205 SmtUtils]: Spent 2.89 s on a formula simplification that was a NOOP. DAG size: 255 [2021-04-29 00:22:51,281 WARN L205 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-04-29 00:22:52,753 WARN L205 SmtUtils]: Spent 1.47 s on a formula simplification that was a NOOP. DAG size: 175 [2021-04-29 00:22:59,549 WARN L205 SmtUtils]: Spent 6.79 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-29 00:23:02,620 WARN L205 SmtUtils]: Spent 3.07 s on a formula simplification that was a NOOP. DAG size: 255 [2021-04-29 00:23:06,401 WARN L205 SmtUtils]: Spent 3.78 s on a formula simplification. DAG size of input: 218 DAG size of output: 178 [2021-04-29 00:23:08,078 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification that was a NOOP. DAG size: 176 [2021-04-29 00:23:15,353 WARN L205 SmtUtils]: Spent 7.27 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-29 00:23:18,633 WARN L205 SmtUtils]: Spent 3.28 s on a formula simplification that was a NOOP. DAG size: 255 [2021-04-29 00:23:24,179 WARN L205 SmtUtils]: Spent 5.54 s on a formula simplification. DAG size of input: 218 DAG size of output: 177 [2021-04-29 00:23:26,075 WARN L205 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 175 [2021-04-29 00:23:33,744 WARN L205 SmtUtils]: Spent 7.66 s on a formula simplification. DAG size of input: 302 DAG size of output: 258 [2021-04-29 00:23:37,364 WARN L205 SmtUtils]: Spent 3.62 s on a formula simplification that was a NOOP. DAG size: 255 [2021-04-29 00:23:37,984 INFO L158 LiptonReduction]: Checked pairs total: 164 [2021-04-29 00:23:37,984 INFO L160 LiptonReduction]: Total number of compositions: 4 [2021-04-29 00:23:37,985 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 63890 [2021-04-29 00:23:37,986 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 82 transitions, 657 flow [2021-04-29 00:23:37,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 234.83333333333334) internal successors, (1409), 6 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:37,988 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:23:37,988 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-04-29 00:23:37,989 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-29 00:23:37,989 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:23:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:23:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1751805462, now seen corresponding path program 1 times [2021-04-29 00:23:37,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:23:37,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370677435] [2021-04-29 00:23:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:23:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:23:38,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:38,347 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:23:38,388 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-04-29 00:23:38,391 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-04-29 00:23:38,406 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:38,408 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:23:38,411 INFO L142 QuantifierPusher]: treesize reduction 9, result has 75.0 percent of original size [2021-04-29 00:23:38,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 27 [2021-04-29 00:23:38,493 INFO L142 QuantifierPusher]: treesize reduction 47, result has 60.8 percent of original size [2021-04-29 00:23:38,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 73 [2021-04-29 00:23:38,712 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 22 [2021-04-29 00:23:38,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:38,721 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:23:38,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:38,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:23:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:23:38,812 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370677435] [2021-04-29 00:23:38,812 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:23:38,812 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-04-29 00:23:38,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838227585] [2021-04-29 00:23:38,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-29 00:23:38,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:23:38,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-29 00:23:38,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-29 00:23:38,817 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 325 [2021-04-29 00:23:38,819 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 82 transitions, 657 flow. Second operand has 7 states, 7 states have (on average 164.57142857142858) internal successors, (1152), 7 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:38,820 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:23:38,820 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 325 [2021-04-29 00:23:38,820 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:23:40,423 INFO L129 PetriNetUnfolder]: 758/2126 cut-off events. [2021-04-29 00:23:40,423 INFO L130 PetriNetUnfolder]: For 6136/7515 co-relation queries the response was YES. [2021-04-29 00:23:40,443 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9544 conditions, 2126 events. 758/2126 cut-off events. For 6136/7515 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 21053 event pairs, 5 based on Foata normal form. 115/1113 useless extension candidates. Maximal degree in co-relation 9518. Up to 900 conditions per place. [2021-04-29 00:23:40,456 INFO L132 encePairwiseOnDemand]: 313/325 looper letters, 21 selfloop transitions, 10 changer transitions 22/108 dead transitions. [2021-04-29 00:23:40,456 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 942 flow [2021-04-29 00:23:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:23:40,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:23:40,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1184 transitions. [2021-04-29 00:23:40,471 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5204395604395604 [2021-04-29 00:23:40,471 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1184 transitions. [2021-04-29 00:23:40,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1184 transitions. [2021-04-29 00:23:40,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:23:40,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1184 transitions. [2021-04-29 00:23:40,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 169.14285714285714) internal successors, (1184), 7 states have internal predecessors, (1184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:40,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:40,490 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:40,490 INFO L185 Difference]: Start difference. First operand has 69 places, 82 transitions, 657 flow. Second operand 7 states and 1184 transitions. [2021-04-29 00:23:40,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 942 flow [2021-04-29 00:23:40,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 784 flow, removed 35 selfloop flow, removed 8 redundant places. [2021-04-29 00:23:40,672 INFO L241 Difference]: Finished difference. Result has 71 places, 84 transitions, 571 flow [2021-04-29 00:23:40,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=507, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=571, PETRI_PLACES=71, PETRI_TRANSITIONS=84} [2021-04-29 00:23:40,673 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -57 predicate places. [2021-04-29 00:23:40,673 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:23:40,673 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 84 transitions, 571 flow [2021-04-29 00:23:40,674 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 84 transitions, 571 flow [2021-04-29 00:23:40,675 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 84 transitions, 571 flow [2021-04-29 00:23:40,824 INFO L129 PetriNetUnfolder]: 308/921 cut-off events. [2021-04-29 00:23:40,825 INFO L130 PetriNetUnfolder]: For 763/795 co-relation queries the response was YES. [2021-04-29 00:23:40,831 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3170 conditions, 921 events. 308/921 cut-off events. For 763/795 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 8115 event pairs, 5 based on Foata normal form. 3/473 useless extension candidates. Maximal degree in co-relation 3145. Up to 360 conditions per place. [2021-04-29 00:23:40,845 INFO L146 LiptonReduction]: Number of co-enabled transitions 790 [2021-04-29 00:23:41,307 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:23:41,307 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:23:41,307 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 634 [2021-04-29 00:23:41,309 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 84 transitions, 571 flow [2021-04-29 00:23:41,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 164.57142857142858) internal successors, (1152), 7 states have internal predecessors, (1152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:41,310 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:23:41,311 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-04-29 00:23:41,311 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-29 00:23:41,311 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:23:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:23:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2071348845, now seen corresponding path program 1 times [2021-04-29 00:23:41,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:23:41,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790504962] [2021-04-29 00:23:41,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:23:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:23:41,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:41,581 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:23:41,642 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:41,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:23:41,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:41,720 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:23:41,791 INFO L142 QuantifierPusher]: treesize reduction 18, result has 76.6 percent of original size [2021-04-29 00:23:41,797 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 59 [2021-04-29 00:23:42,030 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2021-04-29 00:23:42,035 INFO L142 QuantifierPusher]: treesize reduction 8, result has 70.4 percent of original size [2021-04-29 00:23:42,039 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:23:42,149 INFO L142 QuantifierPusher]: treesize reduction 15, result has 70.6 percent of original size [2021-04-29 00:23:42,161 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-04-29 00:23:42,311 WARN L205 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-04-29 00:23:42,319 INFO L142 QuantifierPusher]: treesize reduction 3, result has 89.3 percent of original size [2021-04-29 00:23:42,322 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-29 00:23:42,451 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size [2021-04-29 00:23:42,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-29 00:23:42,548 INFO L142 QuantifierPusher]: treesize reduction 8, result has 72.4 percent of original size [2021-04-29 00:23:42,551 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-29 00:23:42,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:23:42,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790504962] [2021-04-29 00:23:42,553 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:23:42,553 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-29 00:23:42,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356486625] [2021-04-29 00:23:42,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-29 00:23:42,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:23:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-29 00:23:42,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-29 00:23:42,558 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 325 [2021-04-29 00:23:42,560 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 84 transitions, 571 flow. Second operand has 10 states, 10 states have (on average 155.1) internal successors, (1551), 10 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:42,560 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:23:42,560 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 325 [2021-04-29 00:23:42,560 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:23:42,782 WARN L205 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 22 [2021-04-29 00:23:42,976 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 24 [2021-04-29 00:23:43,242 WARN L205 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 14 [2021-04-29 00:23:43,930 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2021-04-29 00:23:44,767 INFO L129 PetriNetUnfolder]: 559/1614 cut-off events. [2021-04-29 00:23:44,767 INFO L130 PetriNetUnfolder]: For 1879/2028 co-relation queries the response was YES. [2021-04-29 00:23:44,776 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5708 conditions, 1614 events. 559/1614 cut-off events. For 1879/2028 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 15347 event pairs, 5 based on Foata normal form. 83/864 useless extension candidates. Maximal degree in co-relation 5681. Up to 675 conditions per place. [2021-04-29 00:23:44,784 INFO L132 encePairwiseOnDemand]: 317/325 looper letters, 25 selfloop transitions, 9 changer transitions 9/98 dead transitions. [2021-04-29 00:23:44,785 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 98 transitions, 748 flow [2021-04-29 00:23:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:23:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:23:44,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1420 transitions. [2021-04-29 00:23:44,798 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.48547008547008547 [2021-04-29 00:23:44,798 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1420 transitions. [2021-04-29 00:23:44,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1420 transitions. [2021-04-29 00:23:44,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:23:44,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1420 transitions. [2021-04-29 00:23:44,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 157.77777777777777) internal successors, (1420), 9 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:44,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:44,813 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:44,814 INFO L185 Difference]: Start difference. First operand has 69 places, 84 transitions, 571 flow. Second operand 9 states and 1420 transitions. [2021-04-29 00:23:44,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 98 transitions, 748 flow [2021-04-29 00:23:44,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 98 transitions, 726 flow, removed 5 selfloop flow, removed 4 redundant places. [2021-04-29 00:23:44,875 INFO L241 Difference]: Finished difference. Result has 76 places, 85 transitions, 589 flow [2021-04-29 00:23:44,876 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=589, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2021-04-29 00:23:44,876 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -52 predicate places. [2021-04-29 00:23:44,877 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:23:44,877 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 85 transitions, 589 flow [2021-04-29 00:23:44,877 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 85 transitions, 589 flow [2021-04-29 00:23:44,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 85 transitions, 589 flow [2021-04-29 00:23:44,986 INFO L129 PetriNetUnfolder]: 332/998 cut-off events. [2021-04-29 00:23:44,987 INFO L130 PetriNetUnfolder]: For 818/834 co-relation queries the response was YES. [2021-04-29 00:23:44,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3436 conditions, 998 events. 332/998 cut-off events. For 818/834 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 8917 event pairs, 9 based on Foata normal form. 3/521 useless extension candidates. Maximal degree in co-relation 3410. Up to 405 conditions per place. [2021-04-29 00:23:45,007 INFO L146 LiptonReduction]: Number of co-enabled transitions 782 [2021-04-29 00:23:45,674 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:23:45,674 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:23:45,675 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 798 [2021-04-29 00:23:45,676 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 85 transitions, 589 flow [2021-04-29 00:23:45,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 155.1) internal successors, (1551), 10 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:45,678 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:23:45,678 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-04-29 00:23:45,678 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-29 00:23:45,679 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:23:45,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:23:45,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1405715544, now seen corresponding path program 1 times [2021-04-29 00:23:45,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:23:45,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259362232] [2021-04-29 00:23:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:23:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:23:45,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:45,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:23:45,921 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:45,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:23:45,972 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-04-29 00:23:45,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-04-29 00:23:46,050 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:46,053 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:23:46,059 INFO L142 QuantifierPusher]: treesize reduction 44, result has 45.7 percent of original size [2021-04-29 00:23:46,061 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-04-29 00:23:46,188 INFO L142 QuantifierPusher]: treesize reduction 43, result has 57.4 percent of original size [2021-04-29 00:23:46,190 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-04-29 00:23:46,392 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2021-04-29 00:23:46,397 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:46,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:23:46,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:23:46,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259362232] [2021-04-29 00:23:46,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:23:46,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:23:46,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134470330] [2021-04-29 00:23:46,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:23:46,454 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:23:46,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:23:46,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:23:46,457 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 325 [2021-04-29 00:23:46,459 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 85 transitions, 589 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:46,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:23:46,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 325 [2021-04-29 00:23:46,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:23:48,021 INFO L129 PetriNetUnfolder]: 604/1749 cut-off events. [2021-04-29 00:23:48,021 INFO L130 PetriNetUnfolder]: For 2189/2424 co-relation queries the response was YES. [2021-04-29 00:23:48,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6228 conditions, 1749 events. 604/1749 cut-off events. For 2189/2424 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 17095 event pairs, 10 based on Foata normal form. 100/942 useless extension candidates. Maximal degree in co-relation 6200. Up to 720 conditions per place. [2021-04-29 00:23:48,047 INFO L132 encePairwiseOnDemand]: 314/325 looper letters, 19 selfloop transitions, 2 changer transitions 29/105 dead transitions. [2021-04-29 00:23:48,047 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 105 transitions, 844 flow [2021-04-29 00:23:48,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-04-29 00:23:48,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-04-29 00:23:48,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1198 transitions. [2021-04-29 00:23:48,061 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5265934065934066 [2021-04-29 00:23:48,062 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1198 transitions. [2021-04-29 00:23:48,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1198 transitions. [2021-04-29 00:23:48,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:23:48,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1198 transitions. [2021-04-29 00:23:48,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 171.14285714285714) internal successors, (1198), 7 states have internal predecessors, (1198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:48,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:48,076 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 325.0) internal successors, (2600), 8 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:48,076 INFO L185 Difference]: Start difference. First operand has 74 places, 85 transitions, 589 flow. Second operand 7 states and 1198 transitions. [2021-04-29 00:23:48,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 105 transitions, 844 flow [2021-04-29 00:23:48,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 105 transitions, 792 flow, removed 9 selfloop flow, removed 6 redundant places. [2021-04-29 00:23:48,198 INFO L241 Difference]: Finished difference. Result has 77 places, 76 transitions, 490 flow [2021-04-29 00:23:48,199 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=490, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2021-04-29 00:23:48,199 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -51 predicate places. [2021-04-29 00:23:48,199 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:23:48,199 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 76 transitions, 490 flow [2021-04-29 00:23:48,200 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 76 transitions, 490 flow [2021-04-29 00:23:48,200 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 76 transitions, 490 flow [2021-04-29 00:23:48,290 INFO L129 PetriNetUnfolder]: 326/981 cut-off events. [2021-04-29 00:23:48,290 INFO L130 PetriNetUnfolder]: For 774/786 co-relation queries the response was YES. [2021-04-29 00:23:48,296 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3344 conditions, 981 events. 326/981 cut-off events. For 774/786 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 8773 event pairs, 12 based on Foata normal form. 2/496 useless extension candidates. Maximal degree in co-relation 3318. Up to 405 conditions per place. [2021-04-29 00:23:48,306 INFO L146 LiptonReduction]: Number of co-enabled transitions 682 [2021-04-29 00:23:48,582 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:23:48,583 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:23:48,583 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 384 [2021-04-29 00:23:48,585 INFO L480 AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 490 flow [2021-04-29 00:23:48,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:48,586 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:23:48,586 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-04-29 00:23:48,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-29 00:23:48,586 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:23:48,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:23:48,587 INFO L82 PathProgramCache]: Analyzing trace with hash 613106038, now seen corresponding path program 2 times [2021-04-29 00:23:48,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:23:48,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76624806] [2021-04-29 00:23:48,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:23:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:23:48,751 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:48,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:23:48,770 INFO L142 QuantifierPusher]: treesize reduction 9, result has 66.7 percent of original size [2021-04-29 00:23:48,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-04-29 00:23:48,833 INFO L142 QuantifierPusher]: treesize reduction 37, result has 43.9 percent of original size [2021-04-29 00:23:48,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-04-29 00:23:48,943 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-04-29 00:23:48,946 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-04-29 00:23:49,128 WARN L205 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2021-04-29 00:23:49,133 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:49,136 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:23:49,193 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:49,196 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-04-29 00:23:49,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:23:49,260 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76624806] [2021-04-29 00:23:49,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:23:49,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:23:49,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648342123] [2021-04-29 00:23:49,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:23:49,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:23:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:23:49,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:23:49,266 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 325 [2021-04-29 00:23:49,268 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 76 transitions, 490 flow. Second operand has 8 states, 8 states have (on average 165.375) internal successors, (1323), 8 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:49,268 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:23:49,268 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 325 [2021-04-29 00:23:49,268 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:23:51,092 INFO L129 PetriNetUnfolder]: 714/2000 cut-off events. [2021-04-29 00:23:51,093 INFO L130 PetriNetUnfolder]: For 2517/2896 co-relation queries the response was YES. [2021-04-29 00:23:51,106 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6983 conditions, 2000 events. 714/2000 cut-off events. For 2517/2896 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 19290 event pairs, 11 based on Foata normal form. 79/991 useless extension candidates. Maximal degree in co-relation 6955. Up to 855 conditions per place. [2021-04-29 00:23:51,122 INFO L132 encePairwiseOnDemand]: 313/325 looper letters, 25 selfloop transitions, 15 changer transitions 6/101 dead transitions. [2021-04-29 00:23:51,123 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 101 transitions, 753 flow [2021-04-29 00:23:51,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:23:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:23:51,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1518 transitions. [2021-04-29 00:23:51,137 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.518974358974359 [2021-04-29 00:23:51,138 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1518 transitions. [2021-04-29 00:23:51,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1518 transitions. [2021-04-29 00:23:51,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:23:51,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1518 transitions. [2021-04-29 00:23:51,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 168.66666666666666) internal successors, (1518), 9 states have internal predecessors, (1518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:51,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:51,154 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:51,154 INFO L185 Difference]: Start difference. First operand has 70 places, 76 transitions, 490 flow. Second operand 9 states and 1518 transitions. [2021-04-29 00:23:51,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 101 transitions, 753 flow [2021-04-29 00:23:51,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 664 flow, removed 23 selfloop flow, removed 12 redundant places. [2021-04-29 00:23:51,275 INFO L241 Difference]: Finished difference. Result has 71 places, 85 transitions, 566 flow [2021-04-29 00:23:51,276 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=566, PETRI_PLACES=71, PETRI_TRANSITIONS=85} [2021-04-29 00:23:51,276 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -57 predicate places. [2021-04-29 00:23:51,276 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:23:51,277 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 85 transitions, 566 flow [2021-04-29 00:23:51,277 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 85 transitions, 566 flow [2021-04-29 00:23:51,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 85 transitions, 566 flow [2021-04-29 00:23:51,514 INFO L129 PetriNetUnfolder]: 548/1587 cut-off events. [2021-04-29 00:23:51,515 INFO L130 PetriNetUnfolder]: For 1252/1287 co-relation queries the response was YES. [2021-04-29 00:23:51,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5386 conditions, 1587 events. 548/1587 cut-off events. For 1252/1287 co-relation queries the response was YES. Maximal size of possible extension queue 430. Compared 15531 event pairs, 8 based on Foata normal form. 2/778 useless extension candidates. Maximal degree in co-relation 5362. Up to 675 conditions per place. [2021-04-29 00:23:51,549 INFO L146 LiptonReduction]: Number of co-enabled transitions 904 [2021-04-29 00:23:52,294 WARN L205 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2021-04-29 00:23:52,420 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2021-04-29 00:23:53,771 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 144 DAG size of output: 85 [2021-04-29 00:23:53,988 WARN L205 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2021-04-29 00:23:55,177 INFO L158 LiptonReduction]: Checked pairs total: 4 [2021-04-29 00:23:55,178 INFO L160 LiptonReduction]: Total number of compositions: 1 [2021-04-29 00:23:55,178 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3902 [2021-04-29 00:23:55,180 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 86 transitions, 574 flow [2021-04-29 00:23:55,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 165.375) internal successors, (1323), 8 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:55,181 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:23:55,181 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-04-29 00:23:55,182 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-29 00:23:55,182 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:23:55,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:23:55,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1874551387, now seen corresponding path program 1 times [2021-04-29 00:23:55,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:23:55,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319933505] [2021-04-29 00:23:55,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:23:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:23:55,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:55,393 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:23:55,427 INFO L142 QuantifierPusher]: treesize reduction 9, result has 70.0 percent of original size [2021-04-29 00:23:55,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-04-29 00:23:55,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:55,505 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:23:55,577 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:55,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-04-29 00:23:55,665 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size [2021-04-29 00:23:55,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-04-29 00:23:55,798 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:55,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-29 00:23:55,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:23:55,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319933505] [2021-04-29 00:23:55,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:23:55,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:23:55,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637690442] [2021-04-29 00:23:55,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:23:55,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:23:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:23:55,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:23:55,845 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 326 [2021-04-29 00:23:55,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 86 transitions, 574 flow. Second operand has 8 states, 8 states have (on average 166.375) internal successors, (1331), 8 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:55,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:23:55,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 326 [2021-04-29 00:23:55,848 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:23:57,777 INFO L129 PetriNetUnfolder]: 742/2098 cut-off events. [2021-04-29 00:23:57,777 INFO L130 PetriNetUnfolder]: For 2517/2827 co-relation queries the response was YES. [2021-04-29 00:23:57,794 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7353 conditions, 2098 events. 742/2098 cut-off events. For 2517/2827 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 21075 event pairs, 8 based on Foata normal form. 89/1040 useless extension candidates. Maximal degree in co-relation 7327. Up to 900 conditions per place. [2021-04-29 00:23:57,807 INFO L132 encePairwiseOnDemand]: 316/326 looper letters, 25 selfloop transitions, 10 changer transitions 21/111 dead transitions. [2021-04-29 00:23:57,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 869 flow [2021-04-29 00:23:57,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-04-29 00:23:57,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-04-29 00:23:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1362 transitions. [2021-04-29 00:23:57,822 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.522239263803681 [2021-04-29 00:23:57,822 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1362 transitions. [2021-04-29 00:23:57,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1362 transitions. [2021-04-29 00:23:57,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:23:57,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1362 transitions. [2021-04-29 00:23:57,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 170.25) internal successors, (1362), 8 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:57,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 326.0) internal successors, (2934), 9 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:57,837 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 326.0) internal successors, (2934), 9 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:57,838 INFO L185 Difference]: Start difference. First operand has 71 places, 86 transitions, 574 flow. Second operand 8 states and 1362 transitions. [2021-04-29 00:23:57,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 869 flow [2021-04-29 00:23:57,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 111 transitions, 816 flow, removed 22 selfloop flow, removed 3 redundant places. [2021-04-29 00:23:57,978 INFO L241 Difference]: Finished difference. Result has 79 places, 82 transitions, 561 flow [2021-04-29 00:23:57,978 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=561, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2021-04-29 00:23:57,979 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -49 predicate places. [2021-04-29 00:23:57,979 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:23:57,979 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 82 transitions, 561 flow [2021-04-29 00:23:57,980 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 82 transitions, 561 flow [2021-04-29 00:23:57,981 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 82 transitions, 561 flow [2021-04-29 00:23:58,114 INFO L129 PetriNetUnfolder]: 489/1419 cut-off events. [2021-04-29 00:23:58,115 INFO L130 PetriNetUnfolder]: For 1206/1227 co-relation queries the response was YES. [2021-04-29 00:23:58,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4874 conditions, 1419 events. 489/1419 cut-off events. For 1206/1227 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 13479 event pairs, 12 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 4846. Up to 585 conditions per place. [2021-04-29 00:23:58,136 INFO L146 LiptonReduction]: Number of co-enabled transitions 712 [2021-04-29 00:23:58,914 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:23:58,914 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:23:58,914 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 935 [2021-04-29 00:23:58,915 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 82 transitions, 561 flow [2021-04-29 00:23:58,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 166.375) internal successors, (1331), 8 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:58,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:23:58,916 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-04-29 00:23:58,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-29 00:23:58,916 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:23:58,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:23:58,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1519647463, now seen corresponding path program 2 times [2021-04-29 00:23:58,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:23:58,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542859734] [2021-04-29 00:23:58,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:23:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:23:59,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:59,112 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:23:59,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:59,148 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:23:59,211 INFO L142 QuantifierPusher]: treesize reduction 21, result has 72.4 percent of original size [2021-04-29 00:23:59,215 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-04-29 00:23:59,253 INFO L142 QuantifierPusher]: treesize reduction 21, result has 72.4 percent of original size [2021-04-29 00:23:59,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-04-29 00:23:59,292 INFO L142 QuantifierPusher]: treesize reduction 21, result has 76.1 percent of original size [2021-04-29 00:23:59,298 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 67 [2021-04-29 00:23:59,339 INFO L142 QuantifierPusher]: treesize reduction 26, result has 67.5 percent of original size [2021-04-29 00:23:59,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-04-29 00:23:59,637 WARN L205 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 21 [2021-04-29 00:23:59,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:59,645 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:23:59,729 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:23:59,731 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-04-29 00:23:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:23:59,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542859734] [2021-04-29 00:23:59,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:23:59,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:23:59,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139654713] [2021-04-29 00:23:59,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:23:59,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:23:59,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:23:59,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:23:59,736 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 326 [2021-04-29 00:23:59,738 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 82 transitions, 561 flow. Second operand has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:23:59,738 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:23:59,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 326 [2021-04-29 00:23:59,738 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:23:59,926 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2021-04-29 00:24:00,133 WARN L205 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 19 [2021-04-29 00:24:00,816 INFO L129 PetriNetUnfolder]: 796/2201 cut-off events. [2021-04-29 00:24:00,817 INFO L130 PetriNetUnfolder]: For 2968/3308 co-relation queries the response was YES. [2021-04-29 00:24:00,829 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7772 conditions, 2201 events. 796/2201 cut-off events. For 2968/3308 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 21824 event pairs, 8 based on Foata normal form. 109/1152 useless extension candidates. Maximal degree in co-relation 7742. Up to 900 conditions per place. [2021-04-29 00:24:00,840 INFO L132 encePairwiseOnDemand]: 315/326 looper letters, 15 selfloop transitions, 18 changer transitions 1/89 dead transitions. [2021-04-29 00:24:00,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 89 transitions, 691 flow [2021-04-29 00:24:00,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-04-29 00:24:00,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-04-29 00:24:00,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2021-04-29 00:24:00,851 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5294478527607362 [2021-04-29 00:24:00,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 863 transitions. [2021-04-29 00:24:00,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 863 transitions. [2021-04-29 00:24:00,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:24:00,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 863 transitions. [2021-04-29 00:24:00,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 172.6) internal successors, (863), 5 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-04-29 00:24:00,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:00,861 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:00,861 INFO L185 Difference]: Start difference. First operand has 72 places, 82 transitions, 561 flow. Second operand 5 states and 863 transitions. [2021-04-29 00:24:00,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 89 transitions, 691 flow [2021-04-29 00:24:00,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 659 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-04-29 00:24:00,975 INFO L241 Difference]: Finished difference. Result has 71 places, 87 transitions, 658 flow [2021-04-29 00:24:00,975 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=658, PETRI_PLACES=71, PETRI_TRANSITIONS=87} [2021-04-29 00:24:00,975 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -57 predicate places. [2021-04-29 00:24:00,976 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:24:00,976 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 87 transitions, 658 flow [2021-04-29 00:24:00,976 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 87 transitions, 658 flow [2021-04-29 00:24:00,978 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 87 transitions, 658 flow [2021-04-29 00:24:01,195 INFO L129 PetriNetUnfolder]: 846/2359 cut-off events. [2021-04-29 00:24:01,195 INFO L130 PetriNetUnfolder]: For 2161/2205 co-relation queries the response was YES. [2021-04-29 00:24:01,207 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8149 conditions, 2359 events. 846/2359 cut-off events. For 2161/2205 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 24564 event pairs, 6 based on Foata normal form. 0/1125 useless extension candidates. Maximal degree in co-relation 8124. Up to 990 conditions per place. [2021-04-29 00:24:01,232 INFO L146 LiptonReduction]: Number of co-enabled transitions 936 [2021-04-29 00:24:01,311 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:24:01,311 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:24:01,311 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 336 [2021-04-29 00:24:01,313 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 87 transitions, 658 flow [2021-04-29 00:24:01,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 169.83333333333334) internal successors, (1019), 6 states have internal predecessors, (1019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:01,313 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:24:01,313 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-04-29 00:24:01,313 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-29 00:24:01,314 INFO L428 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:24:01,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:24:01,314 INFO L82 PathProgramCache]: Analyzing trace with hash -388616804, now seen corresponding path program 1 times [2021-04-29 00:24:01,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:24:01,314 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337745823] [2021-04-29 00:24:01,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:24:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:24:01,415 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:01,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-04-29 00:24:01,434 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-04-29 00:24:01,437 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-04-29 00:24:01,507 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-04-29 00:24:01,510 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-04-29 00:24:01,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:01,603 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:24:01,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:24:01,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337745823] [2021-04-29 00:24:01,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:24:01,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:24:01,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332811709] [2021-04-29 00:24:01,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:24:01,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:24:01,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:24:01,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:24:01,655 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 326 [2021-04-29 00:24:01,657 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 87 transitions, 658 flow. Second operand has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:01,657 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:24:01,657 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 326 [2021-04-29 00:24:01,658 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:24:02,767 INFO L129 PetriNetUnfolder]: 1212/3331 cut-off events. [2021-04-29 00:24:02,767 INFO L130 PetriNetUnfolder]: For 4437/4861 co-relation queries the response was YES. [2021-04-29 00:24:02,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11815 conditions, 3331 events. 1212/3331 cut-off events. For 4437/4861 co-relation queries the response was YES. Maximal size of possible extension queue 966. Compared 36313 event pairs, 12 based on Foata normal form. 103/1649 useless extension candidates. Maximal degree in co-relation 11788. Up to 1395 conditions per place. [2021-04-29 00:24:02,795 INFO L132 encePairwiseOnDemand]: 318/326 looper letters, 26 selfloop transitions, 8 changer transitions 12/101 dead transitions. [2021-04-29 00:24:02,795 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 101 transitions, 876 flow [2021-04-29 00:24:02,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-04-29 00:24:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-04-29 00:24:02,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1104 transitions. [2021-04-29 00:24:02,808 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5644171779141104 [2021-04-29 00:24:02,809 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1104 transitions. [2021-04-29 00:24:02,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1104 transitions. [2021-04-29 00:24:02,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:24:02,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1104 transitions. [2021-04-29 00:24:02,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:02,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:02,818 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 326.0) internal successors, (2282), 7 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:02,818 INFO L185 Difference]: Start difference. First operand has 71 places, 87 transitions, 658 flow. Second operand 6 states and 1104 transitions. [2021-04-29 00:24:02,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 101 transitions, 876 flow [2021-04-29 00:24:03,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 101 transitions, 873 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-04-29 00:24:03,083 INFO L241 Difference]: Finished difference. Result has 76 places, 89 transitions, 700 flow [2021-04-29 00:24:03,083 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=655, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=700, PETRI_PLACES=76, PETRI_TRANSITIONS=89} [2021-04-29 00:24:03,083 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -52 predicate places. [2021-04-29 00:24:03,084 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:24:03,084 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 89 transitions, 700 flow [2021-04-29 00:24:03,084 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 89 transitions, 700 flow [2021-04-29 00:24:03,085 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 75 places, 89 transitions, 700 flow [2021-04-29 00:24:03,317 INFO L129 PetriNetUnfolder]: 846/2358 cut-off events. [2021-04-29 00:24:03,317 INFO L130 PetriNetUnfolder]: For 2279/2323 co-relation queries the response was YES. [2021-04-29 00:24:03,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8209 conditions, 2358 events. 846/2358 cut-off events. For 2279/2323 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 24513 event pairs, 6 based on Foata normal form. 0/1124 useless extension candidates. Maximal degree in co-relation 8182. Up to 990 conditions per place. [2021-04-29 00:24:03,356 INFO L146 LiptonReduction]: Number of co-enabled transitions 1018 [2021-04-29 00:24:03,428 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:24:03,429 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:24:03,429 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 345 [2021-04-29 00:24:03,430 INFO L480 AbstractCegarLoop]: Abstraction has has 75 places, 89 transitions, 700 flow [2021-04-29 00:24:03,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:03,431 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:24:03,431 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-04-29 00:24:03,431 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-29 00:24:03,431 INFO L428 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:24:03,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:24:03,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1266005489, now seen corresponding path program 3 times [2021-04-29 00:24:03,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:24:03,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412161260] [2021-04-29 00:24:03,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:24:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:24:03,570 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:03,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:24:03,607 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:03,610 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:24:03,665 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:03,668 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-04-29 00:24:03,739 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:03,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:24:03,797 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:03,800 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:24:03,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:24:03,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412161260] [2021-04-29 00:24:03,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:24:03,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-04-29 00:24:03,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303394425] [2021-04-29 00:24:03,802 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-29 00:24:03,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:24:03,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-29 00:24:03,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-04-29 00:24:03,806 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 326 [2021-04-29 00:24:03,807 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 89 transitions, 700 flow. Second operand has 6 states, 6 states have (on average 190.83333333333334) internal successors, (1145), 6 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:03,808 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:24:03,808 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 326 [2021-04-29 00:24:03,808 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:24:04,814 INFO L129 PetriNetUnfolder]: 1011/2791 cut-off events. [2021-04-29 00:24:04,814 INFO L130 PetriNetUnfolder]: For 3715/3977 co-relation queries the response was YES. [2021-04-29 00:24:04,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9970 conditions, 2791 events. 1011/2791 cut-off events. For 3715/3977 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 29559 event pairs, 0 based on Foata normal form. 87/1379 useless extension candidates. Maximal degree in co-relation 9941. Up to 1170 conditions per place. [2021-04-29 00:24:04,840 INFO L132 encePairwiseOnDemand]: 318/326 looper letters, 26 selfloop transitions, 12 changer transitions 3/95 dead transitions. [2021-04-29 00:24:04,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 95 transitions, 837 flow [2021-04-29 00:24:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-04-29 00:24:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-04-29 00:24:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 776 transitions. [2021-04-29 00:24:04,852 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5950920245398773 [2021-04-29 00:24:04,852 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 776 transitions. [2021-04-29 00:24:04,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 776 transitions. [2021-04-29 00:24:04,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:24:04,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 776 transitions. [2021-04-29 00:24:04,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:04,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:04,861 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:04,861 INFO L185 Difference]: Start difference. First operand has 75 places, 89 transitions, 700 flow. Second operand 4 states and 776 transitions. [2021-04-29 00:24:04,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 95 transitions, 837 flow [2021-04-29 00:24:05,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 95 transitions, 814 flow, removed 6 selfloop flow, removed 4 redundant places. [2021-04-29 00:24:05,154 INFO L241 Difference]: Finished difference. Result has 75 places, 91 transitions, 744 flow [2021-04-29 00:24:05,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=678, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=744, PETRI_PLACES=75, PETRI_TRANSITIONS=91} [2021-04-29 00:24:05,155 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -53 predicate places. [2021-04-29 00:24:05,156 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:24:05,156 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 91 transitions, 744 flow [2021-04-29 00:24:05,156 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 91 transitions, 744 flow [2021-04-29 00:24:05,157 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 91 transitions, 744 flow [2021-04-29 00:24:05,568 INFO L129 PetriNetUnfolder]: 1009/2788 cut-off events. [2021-04-29 00:24:05,568 INFO L130 PetriNetUnfolder]: For 2788/2862 co-relation queries the response was YES. [2021-04-29 00:24:05,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9705 conditions, 2788 events. 1009/2788 cut-off events. For 2788/2862 co-relation queries the response was YES. Maximal size of possible extension queue 799. Compared 29827 event pairs, 2 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 9678. Up to 1170 conditions per place. [2021-04-29 00:24:05,614 INFO L146 LiptonReduction]: Number of co-enabled transitions 1072 [2021-04-29 00:24:05,948 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:24:05,948 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:24:05,948 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 792 [2021-04-29 00:24:05,950 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 91 transitions, 744 flow [2021-04-29 00:24:05,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 190.83333333333334) internal successors, (1145), 6 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:05,951 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:24:05,951 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-04-29 00:24:05,952 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-29 00:24:05,952 INFO L428 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:24:05,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:24:05,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1102999620, now seen corresponding path program 1 times [2021-04-29 00:24:05,953 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:24:05,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759701781] [2021-04-29 00:24:05,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:24:06,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:24:06,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:06,098 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:24:06,133 INFO L142 QuantifierPusher]: treesize reduction 12, result has 81.5 percent of original size [2021-04-29 00:24:06,137 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-04-29 00:24:06,252 INFO L142 QuantifierPusher]: treesize reduction 12, result has 82.6 percent of original size [2021-04-29 00:24:06,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-04-29 00:24:06,407 WARN L205 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2021-04-29 00:24:06,413 INFO L142 QuantifierPusher]: treesize reduction 9, result has 67.9 percent of original size [2021-04-29 00:24:06,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-04-29 00:24:06,486 INFO L142 QuantifierPusher]: treesize reduction 26, result has 55.2 percent of original size [2021-04-29 00:24:06,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-04-29 00:24:06,600 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:06,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-04-29 00:24:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:24:06,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759701781] [2021-04-29 00:24:06,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:24:06,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:24:06,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444114665] [2021-04-29 00:24:06,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:24:06,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:24:06,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:24:06,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:24:06,643 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 326 [2021-04-29 00:24:06,644 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 91 transitions, 744 flow. Second operand has 8 states, 8 states have (on average 165.375) internal successors, (1323), 8 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:06,645 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:24:06,645 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 326 [2021-04-29 00:24:06,645 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:24:06,987 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 20 [2021-04-29 00:24:08,654 INFO L129 PetriNetUnfolder]: 1199/3281 cut-off events. [2021-04-29 00:24:08,655 INFO L130 PetriNetUnfolder]: For 4501/4832 co-relation queries the response was YES. [2021-04-29 00:24:08,674 INFO L84 FinitePrefix]: Finished finitePrefix Result has 11710 conditions, 3281 events. 1199/3281 cut-off events. For 4501/4832 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 35576 event pairs, 3 based on Foata normal form. 94/1590 useless extension candidates. Maximal degree in co-relation 11681. Up to 1395 conditions per place. [2021-04-29 00:24:08,685 INFO L132 encePairwiseOnDemand]: 315/326 looper letters, 28 selfloop transitions, 15 changer transitions 20/117 dead transitions. [2021-04-29 00:24:08,685 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 1125 flow [2021-04-29 00:24:08,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-29 00:24:08,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-04-29 00:24:08,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1680 transitions. [2021-04-29 00:24:08,698 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5153374233128835 [2021-04-29 00:24:08,698 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1680 transitions. [2021-04-29 00:24:08,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1680 transitions. [2021-04-29 00:24:08,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:24:08,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1680 transitions. [2021-04-29 00:24:08,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 168.0) internal successors, (1680), 10 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:08,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 326.0) internal successors, (3586), 11 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:08,714 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 326.0) internal successors, (3586), 11 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:08,714 INFO L185 Difference]: Start difference. First operand has 74 places, 91 transitions, 744 flow. Second operand 10 states and 1680 transitions. [2021-04-29 00:24:08,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 1125 flow [2021-04-29 00:24:09,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 117 transitions, 1110 flow, removed 7 selfloop flow, removed 1 redundant places. [2021-04-29 00:24:09,142 INFO L241 Difference]: Finished difference. Result has 84 places, 89 transitions, 748 flow [2021-04-29 00:24:09,143 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=748, PETRI_PLACES=84, PETRI_TRANSITIONS=89} [2021-04-29 00:24:09,143 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -44 predicate places. [2021-04-29 00:24:09,143 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:24:09,143 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 84 places, 89 transitions, 748 flow [2021-04-29 00:24:09,144 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 84 places, 89 transitions, 748 flow [2021-04-29 00:24:09,144 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 89 transitions, 748 flow [2021-04-29 00:24:09,328 INFO L129 PetriNetUnfolder]: 654/1862 cut-off events. [2021-04-29 00:24:09,328 INFO L130 PetriNetUnfolder]: For 2176/2200 co-relation queries the response was YES. [2021-04-29 00:24:09,339 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6620 conditions, 1862 events. 654/1862 cut-off events. For 2176/2200 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 18578 event pairs, 2 based on Foata normal form. 0/917 useless extension candidates. Maximal degree in co-relation 6590. Up to 765 conditions per place. [2021-04-29 00:24:09,357 INFO L146 LiptonReduction]: Number of co-enabled transitions 928 [2021-04-29 00:24:09,831 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:24:09,831 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:24:09,832 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 689 [2021-04-29 00:24:09,833 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 89 transitions, 748 flow [2021-04-29 00:24:09,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 165.375) internal successors, (1323), 8 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:09,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:24:09,834 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-04-29 00:24:09,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-29 00:24:09,835 INFO L428 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:24:09,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:24:09,837 INFO L82 PathProgramCache]: Analyzing trace with hash -875462819, now seen corresponding path program 4 times [2021-04-29 00:24:09,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:24:09,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114534117] [2021-04-29 00:24:09,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:24:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:24:10,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:10,092 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-04-29 00:24:10,142 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.1 percent of original size [2021-04-29 00:24:10,146 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 53 [2021-04-29 00:24:10,269 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 15 [2021-04-29 00:24:10,277 INFO L142 QuantifierPusher]: treesize reduction 10, result has 85.7 percent of original size [2021-04-29 00:24:10,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-04-29 00:24:10,415 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 18 [2021-04-29 00:24:10,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:10,422 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-04-29 00:24:10,531 INFO L142 QuantifierPusher]: treesize reduction 19, result has 61.2 percent of original size [2021-04-29 00:24:10,534 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-04-29 00:24:10,760 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2021-04-29 00:24:10,765 INFO L142 QuantifierPusher]: treesize reduction 3, result has 90.6 percent of original size [2021-04-29 00:24:10,768 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-04-29 00:24:10,964 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2021-04-29 00:24:10,969 INFO L142 QuantifierPusher]: treesize reduction 3, result has 80.0 percent of original size [2021-04-29 00:24:10,971 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-04-29 00:24:11,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:24:11,050 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114534117] [2021-04-29 00:24:11,050 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:24:11,050 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-29 00:24:11,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412643377] [2021-04-29 00:24:11,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-29 00:24:11,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:24:11,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-29 00:24:11,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-04-29 00:24:11,055 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 326 [2021-04-29 00:24:11,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 89 transitions, 748 flow. Second operand has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:11,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:24:11,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 326 [2021-04-29 00:24:11,058 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:24:11,397 WARN L205 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2021-04-29 00:24:11,758 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2021-04-29 00:24:12,379 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 22 [2021-04-29 00:24:13,310 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2021-04-29 00:24:13,691 WARN L205 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2021-04-29 00:24:14,580 INFO L129 PetriNetUnfolder]: 1362/3575 cut-off events. [2021-04-29 00:24:14,580 INFO L130 PetriNetUnfolder]: For 5481/6078 co-relation queries the response was YES. [2021-04-29 00:24:14,600 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12801 conditions, 3575 events. 1362/3575 cut-off events. For 5481/6078 co-relation queries the response was YES. Maximal size of possible extension queue 1017. Compared 38610 event pairs, 1 based on Foata normal form. 99/1730 useless extension candidates. Maximal degree in co-relation 12769. Up to 1485 conditions per place. [2021-04-29 00:24:14,611 INFO L132 encePairwiseOnDemand]: 317/326 looper letters, 24 selfloop transitions, 19 changer transitions 23/120 dead transitions. [2021-04-29 00:24:14,612 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 120 transitions, 1216 flow [2021-04-29 00:24:14,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-29 00:24:14,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-04-29 00:24:14,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1765 transitions. [2021-04-29 00:24:14,623 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.49219185722253206 [2021-04-29 00:24:14,624 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1765 transitions. [2021-04-29 00:24:14,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1765 transitions. [2021-04-29 00:24:14,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:24:14,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1765 transitions. [2021-04-29 00:24:14,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 160.45454545454547) internal successors, (1765), 11 states have internal predecessors, (1765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:14,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 326.0) internal successors, (3912), 12 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:14,635 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 326.0) internal successors, (3912), 12 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:14,635 INFO L185 Difference]: Start difference. First operand has 83 places, 89 transitions, 748 flow. Second operand 11 states and 1765 transitions. [2021-04-29 00:24:14,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 120 transitions, 1216 flow [2021-04-29 00:24:15,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 120 transitions, 1133 flow, removed 28 selfloop flow, removed 7 redundant places. [2021-04-29 00:24:15,750 INFO L241 Difference]: Finished difference. Result has 87 places, 89 transitions, 727 flow [2021-04-29 00:24:15,751 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=689, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=727, PETRI_PLACES=87, PETRI_TRANSITIONS=89} [2021-04-29 00:24:15,751 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -41 predicate places. [2021-04-29 00:24:15,751 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:24:15,752 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 87 places, 89 transitions, 727 flow [2021-04-29 00:24:15,752 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 87 places, 89 transitions, 727 flow [2021-04-29 00:24:15,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 85 places, 89 transitions, 727 flow [2021-04-29 00:24:16,026 INFO L129 PetriNetUnfolder]: 992/2588 cut-off events. [2021-04-29 00:24:16,026 INFO L130 PetriNetUnfolder]: For 3256/3332 co-relation queries the response was YES. [2021-04-29 00:24:16,042 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9117 conditions, 2588 events. 992/2588 cut-off events. For 3256/3332 co-relation queries the response was YES. Maximal size of possible extension queue 689. Compared 26354 event pairs, 3 based on Foata normal form. 12/1235 useless extension candidates. Maximal degree in co-relation 9087. Up to 1080 conditions per place. [2021-04-29 00:24:16,070 INFO L146 LiptonReduction]: Number of co-enabled transitions 922 [2021-04-29 00:24:16,074 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:24:16,074 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:24:16,075 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 324 [2021-04-29 00:24:16,077 INFO L480 AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 727 flow [2021-04-29 00:24:16,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 158.22222222222223) internal successors, (1424), 9 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:16,077 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:24:16,078 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-04-29 00:24:16,078 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-04-29 00:24:16,078 INFO L428 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:24:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:24:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1093691298, now seen corresponding path program 1 times [2021-04-29 00:24:16,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:24:16,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812303943] [2021-04-29 00:24:16,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:24:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-29 00:24:16,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:16,212 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-04-29 00:24:16,252 INFO L142 QuantifierPusher]: treesize reduction 2, result has 92.6 percent of original size [2021-04-29 00:24:16,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-04-29 00:24:16,340 INFO L142 QuantifierPusher]: treesize reduction 2, result has 91.7 percent of original size [2021-04-29 00:24:16,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-04-29 00:24:16,427 INFO L142 QuantifierPusher]: treesize reduction 9, result has 78.6 percent of original size [2021-04-29 00:24:16,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-04-29 00:24:16,608 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-04-29 00:24:16,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:16,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-04-29 00:24:16,709 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-04-29 00:24:16,712 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-04-29 00:24:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-29 00:24:16,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812303943] [2021-04-29 00:24:16,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-29 00:24:16,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-29 00:24:16,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165053638] [2021-04-29 00:24:16,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-29 00:24:16,776 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-29 00:24:16,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-29 00:24:16,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-29 00:24:16,780 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 326 [2021-04-29 00:24:16,781 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 727 flow. Second operand has 8 states, 8 states have (on average 165.375) internal successors, (1323), 8 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:16,781 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-04-29 00:24:16,781 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 326 [2021-04-29 00:24:16,781 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-04-29 00:24:17,112 WARN L205 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-04-29 00:24:18,419 INFO L129 PetriNetUnfolder]: 1154/2899 cut-off events. [2021-04-29 00:24:18,419 INFO L130 PetriNetUnfolder]: For 5069/5535 co-relation queries the response was YES. [2021-04-29 00:24:18,433 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10418 conditions, 2899 events. 1154/2899 cut-off events. For 5069/5535 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 29507 event pairs, 0 based on Foata normal form. 58/1366 useless extension candidates. Maximal degree in co-relation 10386. Up to 1215 conditions per place. [2021-04-29 00:24:18,442 INFO L132 encePairwiseOnDemand]: 316/326 looper letters, 20 selfloop transitions, 18 changer transitions 15/107 dead transitions. [2021-04-29 00:24:18,442 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 107 transitions, 1012 flow [2021-04-29 00:24:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-29 00:24:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-04-29 00:24:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1507 transitions. [2021-04-29 00:24:18,453 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.5136332651670075 [2021-04-29 00:24:18,454 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1507 transitions. [2021-04-29 00:24:18,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1507 transitions. [2021-04-29 00:24:18,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-04-29 00:24:18,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1507 transitions. [2021-04-29 00:24:18,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 167.44444444444446) internal successors, (1507), 9 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:18,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:18,466 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 326.0) internal successors, (3260), 10 states have internal predecessors, (3260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:18,466 INFO L185 Difference]: Start difference. First operand has 85 places, 89 transitions, 727 flow. Second operand 9 states and 1507 transitions. [2021-04-29 00:24:18,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 107 transitions, 1012 flow [2021-04-29 00:24:18,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 107 transitions, 960 flow, removed 17 selfloop flow, removed 5 redundant places. [2021-04-29 00:24:18,962 INFO L241 Difference]: Finished difference. Result has 89 places, 84 transitions, 685 flow [2021-04-29 00:24:18,962 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=685, PETRI_PLACES=89, PETRI_TRANSITIONS=84} [2021-04-29 00:24:18,963 INFO L343 CegarLoopForPetriNet]: 128 programPoint places, -39 predicate places. [2021-04-29 00:24:18,963 INFO L171 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-04-29 00:24:18,963 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 685 flow [2021-04-29 00:24:18,964 INFO L133 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 685 flow [2021-04-29 00:24:18,965 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 84 transitions, 685 flow [2021-04-29 00:24:19,194 INFO L129 PetriNetUnfolder]: 1017/2537 cut-off events. [2021-04-29 00:24:19,195 INFO L130 PetriNetUnfolder]: For 3670/3870 co-relation queries the response was YES. [2021-04-29 00:24:19,210 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8981 conditions, 2537 events. 1017/2537 cut-off events. For 3670/3870 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 25346 event pairs, 4 based on Foata normal form. 12/1183 useless extension candidates. Maximal degree in co-relation 8951. Up to 1080 conditions per place. [2021-04-29 00:24:19,234 INFO L146 LiptonReduction]: Number of co-enabled transitions 908 [2021-04-29 00:24:19,503 INFO L158 LiptonReduction]: Checked pairs total: 0 [2021-04-29 00:24:19,503 INFO L160 LiptonReduction]: Total number of compositions: 0 [2021-04-29 00:24:19,503 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 540 [2021-04-29 00:24:19,505 INFO L480 AbstractCegarLoop]: Abstraction has has 83 places, 84 transitions, 685 flow [2021-04-29 00:24:19,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 165.375) internal successors, (1323), 8 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-29 00:24:19,505 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-04-29 00:24:19,506 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-04-29 00:24:19,506 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-04-29 00:24:19,506 INFO L428 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-29 00:24:19,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-29 00:24:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1678728178, now seen corresponding path program 1 times [2021-04-29 00:24:19,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-29 00:24:19,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520136907] [2021-04-29 00:24:19,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-29 00:24:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:24:19,644 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:24:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-29 00:24:19,822 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-29 00:24:19,889 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-29 00:24:19,889 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-04-29 00:24:19,889 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-04-29 00:24:20,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 12:24:20 BasicIcfg [2021-04-29 00:24:20,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-29 00:24:20,051 INFO L168 Benchmark]: Toolchain (without parser) took 277643.36 ms. Allocated memory was 302.0 MB in the beginning and 941.6 MB in the end (delta: 639.6 MB). Free memory was 275.5 MB in the beginning and 412.3 MB in the end (delta: -136.8 MB). Peak memory consumption was 505.4 MB. Max. memory is 16.0 GB. [2021-04-29 00:24:20,052 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-29 00:24:20,052 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.03 ms. Allocated memory is still 302.0 MB. Free memory was 272.2 MB in the beginning and 263.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 16.0 GB. [2021-04-29 00:24:20,052 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.17 ms. Allocated memory is still 302.0 MB. Free memory was 263.4 MB in the beginning and 260.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:24:20,052 INFO L168 Benchmark]: Boogie Preprocessor took 63.19 ms. Allocated memory is still 302.0 MB. Free memory was 260.5 MB in the beginning and 257.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:24:20,053 INFO L168 Benchmark]: RCFGBuilder took 4247.57 ms. Allocated memory was 302.0 MB in the beginning and 373.3 MB in the end (delta: 71.3 MB). Free memory was 257.2 MB in the beginning and 252.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 136.1 MB. Max. memory is 16.0 GB. [2021-04-29 00:24:20,053 INFO L168 Benchmark]: TraceAbstraction took 272457.55 ms. Allocated memory was 373.3 MB in the beginning and 941.6 MB in the end (delta: 568.3 MB). Free memory was 252.8 MB in the beginning and 412.3 MB in the end (delta: -159.4 MB). Peak memory consumption was 408.9 MB. Max. memory is 16.0 GB. [2021-04-29 00:24:20,054 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.22 ms. Allocated memory is still 302.0 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 734.03 ms. Allocated memory is still 302.0 MB. Free memory was 272.2 MB in the beginning and 263.4 MB in the end (delta: 8.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 92.17 ms. Allocated memory is still 302.0 MB. Free memory was 263.4 MB in the beginning and 260.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 63.19 ms. Allocated memory is still 302.0 MB. Free memory was 260.5 MB in the beginning and 257.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 4247.57 ms. Allocated memory was 302.0 MB in the beginning and 373.3 MB in the end (delta: 71.3 MB). Free memory was 257.2 MB in the beginning and 252.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 136.1 MB. Max. memory is 16.0 GB. * TraceAbstraction took 272457.55 ms. Allocated memory was 373.3 MB in the beginning and 941.6 MB in the end (delta: 568.3 MB). Free memory was 252.8 MB in the beginning and 412.3 MB in the end (delta: -159.4 MB). Peak memory consumption was 408.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 154019.7ms, 104 PlacesBefore, 128 PlacesAfterwards, 96 TransitionsBefore, 120 TransitionsAfterwards, 1786 CoEnabledTransitionPairs, 8 FixpointIterations, 140 TrivialSequentialCompositions, 80 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 221 TotalNumberOfCompositions, 16188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3958, positive: 3689, positive conditional: 3689, positive unconditional: 0, negative: 269, negative conditional: 269, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1931, positive: 1863, positive conditional: 0, positive unconditional: 1863, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1931, positive: 1863, positive conditional: 0, positive unconditional: 1863, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1931, positive: 1848, positive conditional: 0, positive unconditional: 1848, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 68, negative conditional: 0, negative unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2456, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 2410, negative conditional: 0, negative unconditional: 2410, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3958, positive: 1826, positive conditional: 1826, positive unconditional: 0, negative: 201, negative conditional: 201, negative unconditional: 0, unknown: 1931, unknown conditional: 1931, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1931, Positive cache size: 1863, Positive conditional cache size: 1863, Positive unconditional cache size: 0, Negative cache size: 68, Negative conditional cache size: 68, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 803.2ms, 124 PlacesBefore, 51 PlacesAfterwards, 42 TransitionsBefore, 42 TransitionsAfterwards, 1002 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 990 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 81, positive: 47, positive conditional: 47, positive unconditional: 0, negative: 34, negative conditional: 34, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 784, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 784, negative conditional: 0, negative unconditional: 784, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 81, positive: 39, positive conditional: 39, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 19, unknown conditional: 19, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 1950, Positive cache size: 1871, Positive conditional cache size: 1871, Positive unconditional cache size: 0, Negative cache size: 79, Negative conditional cache size: 79, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 492.8ms, 52 PlacesBefore, 40 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 498 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 629 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 173, positive: 140, positive conditional: 140, positive unconditional: 0, negative: 33, negative conditional: 33, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 87, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 10, negative conditional: 1, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 87, positive: 77, positive conditional: 0, positive unconditional: 77, negative: 10, negative conditional: 1, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 87, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 36, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 10, negative conditional: 1, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 455, positive: 190, positive conditional: 0, positive unconditional: 190, negative: 264, negative conditional: 130, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 173, positive: 63, positive conditional: 63, positive unconditional: 0, negative: 23, negative conditional: 23, negative unconditional: 0, unknown: 87, unknown conditional: 87, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2037, Positive cache size: 1948, Positive conditional cache size: 1948, Positive unconditional cache size: 0, Negative cache size: 89, Negative conditional cache size: 89, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 87.0ms, 41 PlacesBefore, 40 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 462 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 572 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 159, positive: 128, positive conditional: 128, positive unconditional: 0, negative: 31, negative conditional: 31, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 2, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 72, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 72, negative conditional: 20, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 159, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 28, negative conditional: 28, negative unconditional: 0, unknown: 8, unknown conditional: 8, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2045, Positive cache size: 1953, Positive conditional cache size: 1953, Positive unconditional cache size: 0, Negative cache size: 92, Negative conditional cache size: 92, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 574.2ms, 43 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 398 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 948 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 277, positive: 222, positive conditional: 222, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 39, positive: 39, positive conditional: 23, positive unconditional: 16, 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: 39, positive: 39, positive conditional: 23, positive unconditional: 16, 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: 39, positive: 33, positive conditional: 0, positive unconditional: 33, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.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.Query Time [ms]: [ total: 43, positive: 43, positive conditional: 0, positive unconditional: 43, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 277, positive: 183, positive conditional: 183, positive unconditional: 0, negative: 55, negative conditional: 55, negative unconditional: 0, unknown: 39, unknown conditional: 39, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2084, Positive cache size: 1992, Positive conditional cache size: 1992, Positive unconditional cache size: 0, Negative cache size: 92, Negative conditional cache size: 92, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 959.7ms, 45 PlacesBefore, 44 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 466 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 171 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 58, positive: 49, positive conditional: 49, positive unconditional: 0, negative: 9, negative conditional: 9, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 28, positive: 25, positive conditional: 10, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 28, positive: 25, positive conditional: 10, positive unconditional: 15, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 28, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 11, positive: 8, positive conditional: 8, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 920, positive: 739, positive conditional: 739, positive unconditional: 0, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 58, positive: 24, positive conditional: 24, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 28, unknown conditional: 28, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2112, Positive cache size: 2017, Positive conditional cache size: 2017, Positive unconditional cache size: 0, Negative cache size: 95, Negative conditional cache size: 95, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 199.6ms, 51 PlacesBefore, 51 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 512 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 1, positive unconditional: 0, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, 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: 139, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 139, negative conditional: 0, negative unconditional: 139, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 1, negative unconditional: 0, unknown: 3, unknown conditional: 3, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2115, Positive cache size: 2018, Positive conditional cache size: 2018, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 460.4ms, 55 PlacesBefore, 55 PlacesAfterwards, 62 TransitionsBefore, 62 TransitionsAfterwards, 708 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): 2115, Positive cache size: 2018, Positive conditional cache size: 2018, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 407.1ms, 63 PlacesBefore, 63 PlacesAfterwards, 81 TransitionsBefore, 81 TransitionsAfterwards, 822 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): 2115, Positive cache size: 2018, Positive conditional cache size: 2018, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63888.6ms, 70 PlacesBefore, 69 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 786 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 4 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 164 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 164, positive: 164, positive conditional: 164, 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: 41, positive: 41, positive conditional: 41, 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: 41, positive: 41, positive conditional: 41, 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: 41, positive: 41, positive conditional: 0, positive unconditional: 41, 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: 164, positive: 123, positive conditional: 123, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 41, unknown conditional: 41, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2156, Positive cache size: 2059, Positive conditional cache size: 2059, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 633.7ms, 71 PlacesBefore, 69 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 790 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): 2156, Positive cache size: 2059, Positive conditional cache size: 2059, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 797.1ms, 76 PlacesBefore, 74 PlacesAfterwards, 85 TransitionsBefore, 85 TransitionsAfterwards, 782 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): 2156, Positive cache size: 2059, Positive conditional cache size: 2059, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 383.2ms, 77 PlacesBefore, 70 PlacesAfterwards, 76 TransitionsBefore, 76 TransitionsAfterwards, 682 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): 2156, Positive cache size: 2059, Positive conditional cache size: 2059, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3900.7ms, 71 PlacesBefore, 71 PlacesAfterwards, 85 TransitionsBefore, 86 TransitionsAfterwards, 904 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 4 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 4, 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: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 2160, Positive cache size: 2063, Positive conditional cache size: 2063, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 934.5ms, 79 PlacesBefore, 72 PlacesAfterwards, 82 TransitionsBefore, 82 TransitionsAfterwards, 712 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): 2160, Positive cache size: 2063, Positive conditional cache size: 2063, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 335.0ms, 71 PlacesBefore, 71 PlacesAfterwards, 87 TransitionsBefore, 87 TransitionsAfterwards, 936 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): 2160, Positive cache size: 2063, Positive conditional cache size: 2063, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 344.6ms, 76 PlacesBefore, 75 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 1018 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): 2160, Positive cache size: 2063, Positive conditional cache size: 2063, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 791.7ms, 75 PlacesBefore, 74 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 1072 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): 2160, Positive cache size: 2063, Positive conditional cache size: 2063, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 687.8ms, 84 PlacesBefore, 83 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 928 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): 2160, Positive cache size: 2063, Positive conditional cache size: 2063, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 322.3ms, 87 PlacesBefore, 85 PlacesAfterwards, 89 TransitionsBefore, 89 TransitionsAfterwards, 922 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): 2160, Positive cache size: 2063, Positive conditional cache size: 2063, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 539.5ms, 89 PlacesBefore, 83 PlacesAfterwards, 84 TransitionsBefore, 84 TransitionsAfterwards, 908 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): 2160, Positive cache size: 2063, Positive conditional cache size: 2063, Positive unconditional cache size: 0, Negative cache size: 97, Negative conditional cache size: 97, Negative unconditional cache size: 0 - 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_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff1_thd0; [L730] 0 _Bool y$r_buff1_thd1; [L731] 0 _Bool y$r_buff1_thd2; [L732] 0 _Bool y$r_buff1_thd3; [L733] 0 _Bool y$read_delayed; [L734] 0 int *y$read_delayed_var; [L735] 0 int y$w_buff0; [L736] 0 _Bool y$w_buff0_used; [L737] 0 int y$w_buff1; [L738] 0 _Bool y$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2333; [L855] FCALL, FORK 0 pthread_create(&t2333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2334; [L857] FCALL, FORK 0 pthread_create(&t2334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 2 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 [L796] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2335; [L859] FCALL, FORK 0 pthread_create(&t2335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L813] 3 __unbuffered_p2_EAX = x [L816] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L817] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L818] 3 y$flush_delayed = weak$$choice2 [L819] 3 y$mem_tmp = y [L820] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L820] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0) [L821] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L821] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1) [L822] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L822] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L823] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L823] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L824] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L824] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3) [L825] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L825] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L826] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 __unbuffered_p2_EBX = y [L828] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L828] 3 y = y$flush_delayed ? y$mem_tmp : y [L829] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L832] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L832] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L833] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L833] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L834] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L835] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L836] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L836] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L744] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=52, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L747] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L748] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L749] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L750] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L751] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX = y [L766] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L766] 1 y = y$flush_delayed ? y$mem_tmp : y [L767] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L770] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L771] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L771] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L772] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L773] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L773] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L774] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L774] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L865] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L865] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L866] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L867] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L868] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L869] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 y$flush_delayed = weak$$choice2 [L875] 0 y$mem_tmp = y [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L876] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L877] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L877] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L878] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L878] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L879] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L879] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L880] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L881] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L881] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L884] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L884] 0 y = y$flush_delayed ? y$mem_tmp : y [L885] 0 y$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=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=54, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 14.2ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 272074.0ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 28897.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 154185.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 89 SDtfs, 84 SDslu, 61 SDs, 0 SdLazy, 1385 SolverSat, 480 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7635.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 11749.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=748occurred in iteration=18, InterpolantAutomatonStates: 131, 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: 138.1ms SsaConstructionTime, 1831.3ms SatisfiabilityAnalysisTime, 8650.9ms InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 3021 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...