/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-0e22065b97d0a1f8b3904e080cebe0f05e88d2b7-0e22065 [2021-06-11 06:20:00,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-11 06:20:00,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-11 06:20:00,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-11 06:20:00,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-11 06:20:00,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-11 06:20:00,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-11 06:20:00,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-11 06:20:00,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-11 06:20:00,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-11 06:20:00,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-11 06:20:00,775 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-11 06:20:00,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-11 06:20:00,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-11 06:20:00,777 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-11 06:20:00,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-11 06:20:00,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-11 06:20:00,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-11 06:20:00,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-11 06:20:00,782 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-11 06:20:00,783 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-11 06:20:00,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-11 06:20:00,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-11 06:20:00,785 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-11 06:20:00,787 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-11 06:20:00,788 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-11 06:20:00,788 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-11 06:20:00,789 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-11 06:20:00,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-11 06:20:00,790 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-11 06:20:00,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-11 06:20:00,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-11 06:20:00,791 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-11 06:20:00,792 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-11 06:20:00,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-11 06:20:00,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-11 06:20:00,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-11 06:20:00,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-11 06:20:00,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-11 06:20:00,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-11 06:20:00,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-11 06:20:00,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-06-11 06:20:00,814 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-11 06:20:00,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-11 06:20:00,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-11 06:20:00,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-11 06:20:00,816 INFO L138 SettingsManager]: * Use SBE=true [2021-06-11 06:20:00,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-11 06:20:00,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-11 06:20:00,818 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-11 06:20:00,818 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-11 06:20:00,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-11 06:20:00,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-11 06:20:00,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-11 06:20:00,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-11 06:20:00,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:20:00,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-11 06:20:00,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-11 06:20:00,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-11 06:20:00,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-11 06:20:00,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-11 06:20:00,819 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-06-11 06:20:00,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-06-11 06:20:00,819 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-06-11 06:20:01,117 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-11 06:20:01,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-11 06:20:01,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-11 06:20:01,146 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-11 06:20:01,147 INFO L275 PluginConnector]: CDTParser initialized [2021-06-11 06:20:01,148 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_tso.oepc.i [2021-06-11 06:20:01,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519af33eb/066c4d1423534becb30410485ef8f753/FLAG692c0f096 [2021-06-11 06:20:01,840 INFO L306 CDTParser]: Found 1 translation units. [2021-06-11 06:20:01,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_tso.oepc.i [2021-06-11 06:20:01,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519af33eb/066c4d1423534becb30410485ef8f753/FLAG692c0f096 [2021-06-11 06:20:02,209 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/519af33eb/066c4d1423534becb30410485ef8f753 [2021-06-11 06:20:02,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-11 06:20:02,212 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-11 06:20:02,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-11 06:20:02,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-11 06:20:02,222 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-11 06:20:02,225 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@626e5c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02, skipping insertion in model container [2021-06-11 06:20:02,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,233 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-11 06:20:02,279 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-11 06:20:02,448 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/mix046_tso.oepc.i[949,962] [2021-06-11 06:20:02,625 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:20:02,632 INFO L203 MainTranslator]: Completed pre-run [2021-06-11 06:20:02,641 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/mix046_tso.oepc.i[949,962] [2021-06-11 06:20:02,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-11 06:20:02,728 INFO L208 MainTranslator]: Completed translation [2021-06-11 06:20:02,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02 WrapperNode [2021-06-11 06:20:02,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-11 06:20:02,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-11 06:20:02,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-11 06:20:02,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-11 06:20:02,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,775 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-11 06:20:02,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-11 06:20:02,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-11 06:20:02,776 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-11 06:20:02,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,787 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,796 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... [2021-06-11 06:20:02,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-11 06:20:02,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-11 06:20:02,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-11 06:20:02,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-11 06:20:02,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-11 06:20:02,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-11 06:20:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-11 06:20:02,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-11 06:20:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-11 06:20:02,904 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-11 06:20:02,905 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-11 06:20:02,905 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-11 06:20:02,906 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-11 06:20:02,907 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-11 06:20:02,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-11 06:20:02,907 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-06-11 06:20:02,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-06-11 06:20:02,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-11 06:20:02,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-11 06:20:02,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-11 06:20:02,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-11 06:20:02,909 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-11 06:20:04,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-11 06:20:04,838 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-11 06:20:04,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:20:04 BoogieIcfgContainer [2021-06-11 06:20:04,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-11 06:20:04,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-11 06:20:04,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-11 06:20:04,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-11 06:20:04,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.06 06:20:02" (1/3) ... [2021-06-11 06:20:04,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74967f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:20:04, skipping insertion in model container [2021-06-11 06:20:04,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.06 06:20:02" (2/3) ... [2021-06-11 06:20:04,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74967f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.06 06:20:04, skipping insertion in model container [2021-06-11 06:20:04,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.06 06:20:04" (3/3) ... [2021-06-11 06:20:04,846 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_tso.oepc.i [2021-06-11 06:20:04,852 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-11 06:20:04,856 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-06-11 06:20:04,857 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-11 06:20:04,892 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,893 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,893 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,893 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,893 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,893 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,894 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,894 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,895 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,895 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,896 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,897 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,898 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,898 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,899 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,902 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,902 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,902 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,903 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,903 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,903 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,903 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,904 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,905 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,906 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,906 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,906 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,907 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,907 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,907 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,907 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,907 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,907 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,907 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,908 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,909 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,910 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,911 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,912 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,913 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,914 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,915 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,916 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,917 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,919 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,920 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,921 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,922 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,924 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,924 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,925 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,925 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,926 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,927 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,928 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,930 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,931 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,931 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,931 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,932 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,933 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,933 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,934 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,935 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,936 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,936 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,937 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-11 06:20:04,938 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-11 06:20:04,954 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-06-11 06:20:04,972 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-06-11 06:20:04,972 INFO L377 AbstractCegarLoop]: Hoare is false [2021-06-11 06:20:04,972 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-11 06:20:04,972 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-11 06:20:04,972 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-11 06:20:04,972 INFO L381 AbstractCegarLoop]: Difference is false [2021-06-11 06:20:04,972 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-11 06:20:04,972 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-11 06:20:04,982 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 119 transitions, 258 flow [2021-06-11 06:20:05,020 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-06-11 06:20:05,020 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:20:05,024 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 90 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-06-11 06:20:05,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 119 transitions, 258 flow [2021-06-11 06:20:05,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 115 transitions, 242 flow [2021-06-11 06:20:05,030 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:05,040 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 242 flow [2021-06-11 06:20:05,043 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 242 flow [2021-06-11 06:20:05,045 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 242 flow [2021-06-11 06:20:05,064 INFO L129 PetriNetUnfolder]: 2/115 cut-off events. [2021-06-11 06:20:05,064 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:20:05,065 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 115 events. 2/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 91 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2021-06-11 06:20:05,069 INFO L151 LiptonReduction]: Number of co-enabled transitions 2876 [2021-06-11 06:20:05,115 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,125 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,246 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,265 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,300 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,301 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,325 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,344 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,413 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,414 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:05,498 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,500 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:05,501 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:05,565 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,601 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,602 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,633 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,634 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,669 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,706 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,707 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,750 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,866 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,867 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:05,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,953 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:05,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:05,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:05,956 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:06,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:06,102 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:06,105 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:06,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,152 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,384 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-06-11 06:20:06,385 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:20:06,411 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,562 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:06,568 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,569 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:06,570 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:06,624 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,625 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,798 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:20:06,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,892 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,893 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,902 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:06,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:06,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,005 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,184 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,246 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,268 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,269 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,290 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,291 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,309 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,331 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,409 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,584 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,585 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,619 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,621 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,737 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:07,739 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:07,969 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-06-11 06:20:08,347 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2021-06-11 06:20:08,463 WARN L205 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-06-11 06:20:08,477 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:08,481 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,483 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 50 [2021-06-11 06:20:08,484 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:08,485 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,486 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 1] term [2021-06-11 06:20:08,486 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:20:08,489 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,491 INFO L147 QuantifierPusher]: treesize reduction 37, result has 63.0 percent of original size 63 [2021-06-11 06:20:08,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:08,493 INFO L142 QuantifierPusher]: treesize reduction 37, result has 76.9 percent of original size [2021-06-11 06:20:08,494 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 4, 2, 1] term [2021-06-11 06:20:08,494 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:20:08,496 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,498 INFO L147 QuantifierPusher]: treesize reduction 89, result has 36.0 percent of original size 50 [2021-06-11 06:20:08,498 INFO L427 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 2, 4, 2, 1] term [2021-06-11 06:20:08,499 INFO L725 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-06-11 06:20:08,500 INFO L732 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,505 INFO L147 QuantifierPusher]: treesize reduction 154, result has 42.1 percent of original size 112 [2021-06-11 06:20:08,555 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:08,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:08,565 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:08,622 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,623 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:08,682 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,683 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:08,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,842 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:08,850 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,851 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:08,852 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:08,889 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,892 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:08,922 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:08,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:08,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:09,023 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,024 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:09,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,071 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:09,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,166 INFO L147 QuantifierPusher]: treesize reduction 80, result has 25.2 percent of original size 27 [2021-06-11 06:20:09,204 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,207 INFO L147 QuantifierPusher]: treesize reduction 36, result has 2.7 percent of original size 1 [2021-06-11 06:20:09,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:09,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:09,403 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,406 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:09,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:09,544 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:09,545 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-06-11 06:20:09,546 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:09,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:09,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:09,548 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 31 [2021-06-11 06:20:09,549 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 32 [2021-06-11 06:20:09,549 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:09,550 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,550 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-06-11 06:20:09,552 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-06-11 06:20:09,616 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,617 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:09,808 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,810 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:09,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:09,812 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:09,919 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:09,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:10,297 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:10,304 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:10,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:10,311 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:10,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:10,690 WARN L205 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-11 06:20:10,848 WARN L205 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-11 06:20:11,207 WARN L205 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-06-11 06:20:11,362 WARN L205 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-06-11 06:20:11,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:11,389 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-06-11 06:20:11,391 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:11,394 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-11 06:20:11,402 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-06-11 06:20:11,411 INFO L163 LiptonReduction]: Checked pairs total: 8967 [2021-06-11 06:20:11,412 INFO L165 LiptonReduction]: Total number of compositions: 100 [2021-06-11 06:20:11,415 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6386 [2021-06-11 06:20:11,421 INFO L129 PetriNetUnfolder]: 0/3 cut-off events. [2021-06-11 06:20:11,421 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:20:11,422 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:11,422 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2021-06-11 06:20:11,422 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:11,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:11,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1222076, now seen corresponding path program 1 times [2021-06-11 06:20:11,432 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:11,432 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83748373] [2021-06-11 06:20:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:11,557 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:11,557 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-11 06:20:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:11,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83748373] [2021-06-11 06:20:11,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:11,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:20:11,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443525890] [2021-06-11 06:20:11,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:20:11,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:11,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:20:11,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:20:11,586 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 219 [2021-06-11 06:20:11,589 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:11,589 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:11,589 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 219 [2021-06-11 06:20:11,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:11,729 INFO L129 PetriNetUnfolder]: 133/320 cut-off events. [2021-06-11 06:20:11,729 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:20:11,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 320 events. 133/320 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1704 event pairs, 110 based on Foata normal form. 69/357 useless extension candidates. Maximal degree in co-relation 528. Up to 153 conditions per place. [2021-06-11 06:20:11,737 INFO L132 encePairwiseOnDemand]: 214/219 looper letters, 11 selfloop transitions, 2 changer transitions 1/39 dead transitions. [2021-06-11 06:20:11,738 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 116 flow [2021-06-11 06:20:11,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:20:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:20:11,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2021-06-11 06:20:11,750 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.863013698630137 [2021-06-11 06:20:11,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2021-06-11 06:20:11,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2021-06-11 06:20:11,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:11,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2021-06-11 06:20:11,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:11,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:11,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:11,767 INFO L185 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 567 transitions. [2021-06-11 06:20:11,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 116 flow [2021-06-11 06:20:11,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 112 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-06-11 06:20:11,771 INFO L241 Difference]: Finished difference. Result has 45 places, 33 transitions, 78 flow [2021-06-11 06:20:11,772 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2021-06-11 06:20:11,773 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2021-06-11 06:20:11,773 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:11,773 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 33 transitions, 78 flow [2021-06-11 06:20:11,774 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 33 transitions, 78 flow [2021-06-11 06:20:11,774 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 33 transitions, 78 flow [2021-06-11 06:20:11,778 INFO L129 PetriNetUnfolder]: 0/33 cut-off events. [2021-06-11 06:20:11,778 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:20:11,778 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 33 events. 0/33 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-06-11 06:20:11,778 INFO L151 LiptonReduction]: Number of co-enabled transitions 556 [2021-06-11 06:20:11,920 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:11,926 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:12,173 INFO L163 LiptonReduction]: Checked pairs total: 1282 [2021-06-11 06:20:12,173 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:20:12,174 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 401 [2021-06-11 06:20:12,174 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 76 flow [2021-06-11 06:20:12,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 183.66666666666666) internal successors, (551), 3 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,175 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:12,175 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:12,175 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-11 06:20:12,175 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:12,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1170365104, now seen corresponding path program 1 times [2021-06-11 06:20:12,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:12,176 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761871730] [2021-06-11 06:20:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:12,253 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:20:12,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:20:12,268 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-06-11 06:20:12,268 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:20:12,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:12,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761871730] [2021-06-11 06:20:12,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:12,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:20:12,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226649202] [2021-06-11 06:20:12,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:20:12,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:12,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:20:12,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:20:12,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 221 [2021-06-11 06:20:12,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 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-06-11 06:20:12,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:12,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 221 [2021-06-11 06:20:12,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:12,439 INFO L129 PetriNetUnfolder]: 435/915 cut-off events. [2021-06-11 06:20:12,439 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-06-11 06:20:12,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1607 conditions, 915 events. 435/915 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 5889 event pairs, 78 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 1598. Up to 273 conditions per place. [2021-06-11 06:20:12,446 INFO L132 encePairwiseOnDemand]: 211/221 looper letters, 8 selfloop transitions, 8 changer transitions 17/54 dead transitions. [2021-06-11 06:20:12,446 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 184 flow [2021-06-11 06:20:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:20:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:20:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 853 transitions. [2021-06-11 06:20:12,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7719457013574661 [2021-06-11 06:20:12,451 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 853 transitions. [2021-06-11 06:20:12,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 853 transitions. [2021-06-11 06:20:12,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:12,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 853 transitions. [2021-06-11 06:20:12,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 170.6) internal successors, (853), 5 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,457 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,457 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 76 flow. Second operand 5 states and 853 transitions. [2021-06-11 06:20:12,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 184 flow [2021-06-11 06:20:12,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:20:12,459 INFO L241 Difference]: Finished difference. Result has 49 places, 37 transitions, 144 flow [2021-06-11 06:20:12,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2021-06-11 06:20:12,460 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 0 predicate places. [2021-06-11 06:20:12,460 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:12,460 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 37 transitions, 144 flow [2021-06-11 06:20:12,460 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 37 transitions, 144 flow [2021-06-11 06:20:12,461 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 37 transitions, 144 flow [2021-06-11 06:20:12,562 INFO L129 PetriNetUnfolder]: 230/613 cut-off events. [2021-06-11 06:20:12,562 INFO L130 PetriNetUnfolder]: For 159/159 co-relation queries the response was YES. [2021-06-11 06:20:12,564 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1346 conditions, 613 events. 230/613 cut-off events. For 159/159 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4314 event pairs, 86 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 1335. Up to 273 conditions per place. [2021-06-11 06:20:12,570 INFO L151 LiptonReduction]: Number of co-enabled transitions 600 [2021-06-11 06:20:12,688 INFO L163 LiptonReduction]: Checked pairs total: 392 [2021-06-11 06:20:12,688 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:12,688 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 228 [2021-06-11 06:20:12,689 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 144 flow [2021-06-11 06:20:12,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 164.75) internal successors, (659), 4 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-06-11 06:20:12,690 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:12,690 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:12,690 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-11 06:20:12,690 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2015614388, now seen corresponding path program 1 times [2021-06-11 06:20:12,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:12,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052765366] [2021-06-11 06:20:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:12,746 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:12,747 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:12,750 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:20:12,751 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:20:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:12,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052765366] [2021-06-11 06:20:12,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:12,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:20:12,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968276328] [2021-06-11 06:20:12,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:20:12,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:12,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:20:12,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:20:12,764 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 221 [2021-06-11 06:20:12,764 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,764 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:12,765 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 221 [2021-06-11 06:20:12,765 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:12,852 INFO L129 PetriNetUnfolder]: 205/528 cut-off events. [2021-06-11 06:20:12,853 INFO L130 PetriNetUnfolder]: For 178/348 co-relation queries the response was YES. [2021-06-11 06:20:12,854 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1539 conditions, 528 events. 205/528 cut-off events. For 178/348 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 3298 event pairs, 24 based on Foata normal form. 4/523 useless extension candidates. Maximal degree in co-relation 1526. Up to 247 conditions per place. [2021-06-11 06:20:12,858 INFO L132 encePairwiseOnDemand]: 212/221 looper letters, 14 selfloop transitions, 12 changer transitions 0/47 dead transitions. [2021-06-11 06:20:12,858 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 256 flow [2021-06-11 06:20:12,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:20:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:20:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 714 transitions. [2021-06-11 06:20:12,861 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2021-06-11 06:20:12,861 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 714 transitions. [2021-06-11 06:20:12,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 714 transitions. [2021-06-11 06:20:12,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:12,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 714 transitions. [2021-06-11 06:20:12,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,865 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,865 INFO L185 Difference]: Start difference. First operand has 45 places, 37 transitions, 144 flow. Second operand 4 states and 714 transitions. [2021-06-11 06:20:12,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 256 flow [2021-06-11 06:20:12,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 206 flow, removed 12 selfloop flow, removed 4 redundant places. [2021-06-11 06:20:12,870 INFO L241 Difference]: Finished difference. Result has 47 places, 44 transitions, 202 flow [2021-06-11 06:20:12,870 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2021-06-11 06:20:12,870 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2021-06-11 06:20:12,870 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:12,870 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 44 transitions, 202 flow [2021-06-11 06:20:12,871 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 44 transitions, 202 flow [2021-06-11 06:20:12,871 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 202 flow [2021-06-11 06:20:12,923 INFO L129 PetriNetUnfolder]: 205/560 cut-off events. [2021-06-11 06:20:12,923 INFO L130 PetriNetUnfolder]: For 244/258 co-relation queries the response was YES. [2021-06-11 06:20:12,925 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 560 events. 205/560 cut-off events. For 244/258 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3768 event pairs, 76 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 1279. Up to 247 conditions per place. [2021-06-11 06:20:12,931 INFO L151 LiptonReduction]: Number of co-enabled transitions 720 [2021-06-11 06:20:12,937 INFO L163 LiptonReduction]: Checked pairs total: 521 [2021-06-11 06:20:12,937 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:12,937 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 67 [2021-06-11 06:20:12,938 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 202 flow [2021-06-11 06:20:12,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 173.75) internal successors, (695), 4 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,939 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:12,939 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:12,939 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-11 06:20:12,939 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:12,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:12,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1170364891, now seen corresponding path program 1 times [2021-06-11 06:20:12,940 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:12,940 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612301882] [2021-06-11 06:20:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:12,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:12,977 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:12,977 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:12,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:12,980 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612301882] [2021-06-11 06:20:12,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:12,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:20:12,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86264255] [2021-06-11 06:20:12,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:20:12,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:12,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:20:12,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:20:12,982 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 221 [2021-06-11 06:20:12,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:12,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:12,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 221 [2021-06-11 06:20:12,983 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:13,030 INFO L129 PetriNetUnfolder]: 160/420 cut-off events. [2021-06-11 06:20:13,030 INFO L130 PetriNetUnfolder]: For 330/397 co-relation queries the response was YES. [2021-06-11 06:20:13,031 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 420 events. 160/420 cut-off events. For 330/397 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2464 event pairs, 18 based on Foata normal form. 13/426 useless extension candidates. Maximal degree in co-relation 1045. Up to 194 conditions per place. [2021-06-11 06:20:13,034 INFO L132 encePairwiseOnDemand]: 218/221 looper letters, 1 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2021-06-11 06:20:13,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 210 flow [2021-06-11 06:20:13,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:20:13,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:20:13,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2021-06-11 06:20:13,036 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8702865761689291 [2021-06-11 06:20:13,036 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2021-06-11 06:20:13,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2021-06-11 06:20:13,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:13,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2021-06-11 06:20:13,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,040 INFO L185 Difference]: Start difference. First operand has 47 places, 44 transitions, 202 flow. Second operand 3 states and 577 transitions. [2021-06-11 06:20:13,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 210 flow [2021-06-11 06:20:13,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 44 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 06:20:13,042 INFO L241 Difference]: Finished difference. Result has 50 places, 44 transitions, 213 flow [2021-06-11 06:20:13,042 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2021-06-11 06:20:13,043 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2021-06-11 06:20:13,043 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:13,043 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 44 transitions, 213 flow [2021-06-11 06:20:13,043 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 44 transitions, 213 flow [2021-06-11 06:20:13,043 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 50 places, 44 transitions, 213 flow [2021-06-11 06:20:13,089 INFO L129 PetriNetUnfolder]: 160/470 cut-off events. [2021-06-11 06:20:13,089 INFO L130 PetriNetUnfolder]: For 243/252 co-relation queries the response was YES. [2021-06-11 06:20:13,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 470 events. 160/470 cut-off events. For 243/252 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3053 event pairs, 56 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 1115. Up to 194 conditions per place. [2021-06-11 06:20:13,095 INFO L151 LiptonReduction]: Number of co-enabled transitions 720 [2021-06-11 06:20:13,100 INFO L163 LiptonReduction]: Checked pairs total: 521 [2021-06-11 06:20:13,100 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:13,101 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 58 [2021-06-11 06:20:13,101 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 213 flow [2021-06-11 06:20:13,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,102 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:13,102 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:13,102 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-11 06:20:13,102 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:13,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:13,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1939758012, now seen corresponding path program 1 times [2021-06-11 06:20:13,103 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:13,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229272830] [2021-06-11 06:20:13,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:13,145 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:13,145 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:13,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229272830] [2021-06-11 06:20:13,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:13,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-06-11 06:20:13,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210664568] [2021-06-11 06:20:13,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:20:13,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:20:13,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:20:13,150 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 221 [2021-06-11 06:20:13,150 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,151 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:13,151 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 221 [2021-06-11 06:20:13,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:13,199 INFO L129 PetriNetUnfolder]: 144/386 cut-off events. [2021-06-11 06:20:13,199 INFO L130 PetriNetUnfolder]: For 385/423 co-relation queries the response was YES. [2021-06-11 06:20:13,200 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1082 conditions, 386 events. 144/386 cut-off events. For 385/423 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2203 event pairs, 13 based on Foata normal form. 7/387 useless extension candidates. Maximal degree in co-relation 1065. Up to 174 conditions per place. [2021-06-11 06:20:13,202 INFO L132 encePairwiseOnDemand]: 217/221 looper letters, 7 selfloop transitions, 6 changer transitions 0/49 dead transitions. [2021-06-11 06:20:13,202 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 49 transitions, 267 flow [2021-06-11 06:20:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:20:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:20:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 577 transitions. [2021-06-11 06:20:13,205 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8702865761689291 [2021-06-11 06:20:13,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 577 transitions. [2021-06-11 06:20:13,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 577 transitions. [2021-06-11 06:20:13,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:13,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 577 transitions. [2021-06-11 06:20:13,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,208 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,208 INFO L185 Difference]: Start difference. First operand has 50 places, 44 transitions, 213 flow. Second operand 3 states and 577 transitions. [2021-06-11 06:20:13,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 49 transitions, 267 flow [2021-06-11 06:20:13,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 49 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:20:13,212 INFO L241 Difference]: Finished difference. Result has 51 places, 49 transitions, 265 flow [2021-06-11 06:20:13,212 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=265, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2021-06-11 06:20:13,213 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2021-06-11 06:20:13,213 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:13,213 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 51 places, 49 transitions, 265 flow [2021-06-11 06:20:13,213 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 51 places, 49 transitions, 265 flow [2021-06-11 06:20:13,213 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 51 places, 49 transitions, 265 flow [2021-06-11 06:20:13,256 INFO L129 PetriNetUnfolder]: 144/412 cut-off events. [2021-06-11 06:20:13,256 INFO L130 PetriNetUnfolder]: For 363/368 co-relation queries the response was YES. [2021-06-11 06:20:13,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1097 conditions, 412 events. 144/412 cut-off events. For 363/368 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2484 event pairs, 13 based on Foata normal form. 1/409 useless extension candidates. Maximal degree in co-relation 1081. Up to 174 conditions per place. [2021-06-11 06:20:13,262 INFO L151 LiptonReduction]: Number of co-enabled transitions 802 [2021-06-11 06:20:13,268 INFO L163 LiptonReduction]: Checked pairs total: 651 [2021-06-11 06:20:13,268 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:13,268 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 55 [2021-06-11 06:20:13,270 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 265 flow [2021-06-11 06:20:13,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 190.66666666666666) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,271 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:13,271 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:13,271 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-11 06:20:13,271 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -43037341, now seen corresponding path program 1 times [2021-06-11 06:20:13,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:13,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689456165] [2021-06-11 06:20:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:13,378 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:13,379 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:13,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:13,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:13,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:13,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:13,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689456165] [2021-06-11 06:20:13,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:13,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:20:13,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298634691] [2021-06-11 06:20:13,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:20:13,389 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:13,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:20:13,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:20:13,390 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 221 [2021-06-11 06:20:13,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 265 flow. Second operand has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:13,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 221 [2021-06-11 06:20:13,391 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:13,599 INFO L129 PetriNetUnfolder]: 961/1868 cut-off events. [2021-06-11 06:20:13,599 INFO L130 PetriNetUnfolder]: For 803/975 co-relation queries the response was YES. [2021-06-11 06:20:13,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4315 conditions, 1868 events. 961/1868 cut-off events. For 803/975 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 14654 event pairs, 293 based on Foata normal form. 126/1632 useless extension candidates. Maximal degree in co-relation 4297. Up to 850 conditions per place. [2021-06-11 06:20:13,619 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 10 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2021-06-11 06:20:13,619 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 337 flow [2021-06-11 06:20:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-06-11 06:20:13,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-06-11 06:20:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2021-06-11 06:20:13,622 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8316742081447964 [2021-06-11 06:20:13,622 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 919 transitions. [2021-06-11 06:20:13,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 919 transitions. [2021-06-11 06:20:13,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:13,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 919 transitions. [2021-06-11 06:20:13,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 183.8) internal successors, (919), 5 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,628 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,628 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,628 INFO L185 Difference]: Start difference. First operand has 51 places, 49 transitions, 265 flow. Second operand 5 states and 919 transitions. [2021-06-11 06:20:13,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 337 flow [2021-06-11 06:20:13,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 331 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-06-11 06:20:13,635 INFO L241 Difference]: Finished difference. Result has 57 places, 59 transitions, 343 flow [2021-06-11 06:20:13,635 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=343, PETRI_PLACES=57, PETRI_TRANSITIONS=59} [2021-06-11 06:20:13,636 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2021-06-11 06:20:13,636 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:13,636 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 59 transitions, 343 flow [2021-06-11 06:20:13,636 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 59 transitions, 343 flow [2021-06-11 06:20:13,637 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 59 transitions, 343 flow [2021-06-11 06:20:13,830 INFO L129 PetriNetUnfolder]: 867/1788 cut-off events. [2021-06-11 06:20:13,830 INFO L130 PetriNetUnfolder]: For 1650/2397 co-relation queries the response was YES. [2021-06-11 06:20:13,843 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5243 conditions, 1788 events. 867/1788 cut-off events. For 1650/2397 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 14323 event pairs, 295 based on Foata normal form. 21/1592 useless extension candidates. Maximal degree in co-relation 5223. Up to 1123 conditions per place. [2021-06-11 06:20:13,863 INFO L151 LiptonReduction]: Number of co-enabled transitions 1218 [2021-06-11 06:20:13,941 INFO L163 LiptonReduction]: Checked pairs total: 831 [2021-06-11 06:20:13,941 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:13,942 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 306 [2021-06-11 06:20:13,943 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 59 transitions, 343 flow [2021-06-11 06:20:13,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:13,944 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:13,944 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:13,944 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-11 06:20:13,944 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:13,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:13,945 INFO L82 PathProgramCache]: Analyzing trace with hash -173332923, now seen corresponding path program 1 times [2021-06-11 06:20:13,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:13,945 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938777406] [2021-06-11 06:20:13,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:13,991 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:13,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:13,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:13,993 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:13,996 INFO L142 QuantifierPusher]: treesize reduction 3, result has 87.5 percent of original size [2021-06-11 06:20:13,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 21 [2021-06-11 06:20:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:14,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938777406] [2021-06-11 06:20:14,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:14,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:20:14,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542742651] [2021-06-11 06:20:14,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:20:14,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:14,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:20:14,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:20:14,008 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 221 [2021-06-11 06:20:14,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 59 transitions, 343 flow. Second operand has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:14,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:14,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 221 [2021-06-11 06:20:14,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:14,258 INFO L129 PetriNetUnfolder]: 1187/2430 cut-off events. [2021-06-11 06:20:14,258 INFO L130 PetriNetUnfolder]: For 2994/4753 co-relation queries the response was YES. [2021-06-11 06:20:14,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7463 conditions, 2430 events. 1187/2430 cut-off events. For 2994/4753 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 20719 event pairs, 476 based on Foata normal form. 108/2223 useless extension candidates. Maximal degree in co-relation 7441. Up to 1630 conditions per place. [2021-06-11 06:20:14,291 INFO L132 encePairwiseOnDemand]: 212/221 looper letters, 22 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2021-06-11 06:20:14,291 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 72 transitions, 515 flow [2021-06-11 06:20:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:20:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:20:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 714 transitions. [2021-06-11 06:20:14,293 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8076923076923077 [2021-06-11 06:20:14,293 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 714 transitions. [2021-06-11 06:20:14,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 714 transitions. [2021-06-11 06:20:14,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:14,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 714 transitions. [2021-06-11 06:20:14,296 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 178.5) internal successors, (714), 4 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:14,298 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:14,298 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:14,298 INFO L185 Difference]: Start difference. First operand has 57 places, 59 transitions, 343 flow. Second operand 4 states and 714 transitions. [2021-06-11 06:20:14,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 72 transitions, 515 flow [2021-06-11 06:20:14,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 515 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-06-11 06:20:14,316 INFO L241 Difference]: Finished difference. Result has 63 places, 67 transitions, 500 flow [2021-06-11 06:20:14,316 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=500, PETRI_PLACES=63, PETRI_TRANSITIONS=67} [2021-06-11 06:20:14,316 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 14 predicate places. [2021-06-11 06:20:14,316 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:14,316 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 67 transitions, 500 flow [2021-06-11 06:20:14,317 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 67 transitions, 500 flow [2021-06-11 06:20:14,317 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 67 transitions, 500 flow [2021-06-11 06:20:14,537 INFO L129 PetriNetUnfolder]: 1226/2476 cut-off events. [2021-06-11 06:20:14,538 INFO L130 PetriNetUnfolder]: For 2647/3802 co-relation queries the response was YES. [2021-06-11 06:20:14,555 INFO L84 FinitePrefix]: Finished finitePrefix Result has 7537 conditions, 2476 events. 1226/2476 cut-off events. For 2647/3802 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 20871 event pairs, 480 based on Foata normal form. 20/2162 useless extension candidates. Maximal degree in co-relation 7512. Up to 1700 conditions per place. [2021-06-11 06:20:14,587 INFO L151 LiptonReduction]: Number of co-enabled transitions 1454 [2021-06-11 06:20:14,619 INFO L163 LiptonReduction]: Checked pairs total: 1001 [2021-06-11 06:20:14,619 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:14,619 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 303 [2021-06-11 06:20:14,619 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 67 transitions, 500 flow [2021-06-11 06:20:14,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 174.25) internal successors, (697), 4 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:14,620 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:14,620 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:14,620 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-11 06:20:14,620 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:14,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:14,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1293372737, now seen corresponding path program 1 times [2021-06-11 06:20:14,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:14,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053708761] [2021-06-11 06:20:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:14,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:14,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:14,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:14,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:14,654 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:14,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053708761] [2021-06-11 06:20:14,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:14,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-11 06:20:14,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226687358] [2021-06-11 06:20:14,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-11 06:20:14,657 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:14,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-11 06:20:14,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-11 06:20:14,658 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 221 [2021-06-11 06:20:14,659 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 67 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:14,659 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:14,659 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 221 [2021-06-11 06:20:14,659 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:15,004 INFO L129 PetriNetUnfolder]: 1655/3307 cut-off events. [2021-06-11 06:20:15,004 INFO L130 PetriNetUnfolder]: For 4714/6741 co-relation queries the response was YES. [2021-06-11 06:20:15,027 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10148 conditions, 3307 events. 1655/3307 cut-off events. For 4714/6741 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 29395 event pairs, 710 based on Foata normal form. 75/2926 useless extension candidates. Maximal degree in co-relation 10121. Up to 2348 conditions per place. [2021-06-11 06:20:15,046 INFO L132 encePairwiseOnDemand]: 218/221 looper letters, 5 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2021-06-11 06:20:15,046 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 67 transitions, 528 flow [2021-06-11 06:20:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-11 06:20:15,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-06-11 06:20:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 573 transitions. [2021-06-11 06:20:15,048 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8642533936651584 [2021-06-11 06:20:15,048 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 573 transitions. [2021-06-11 06:20:15,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 573 transitions. [2021-06-11 06:20:15,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:15,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 573 transitions. [2021-06-11 06:20:15,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 191.0) internal successors, (573), 3 states have internal predecessors, (573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:15,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:15,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:15,052 INFO L185 Difference]: Start difference. First operand has 63 places, 67 transitions, 500 flow. Second operand 3 states and 573 transitions. [2021-06-11 06:20:15,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 67 transitions, 528 flow [2021-06-11 06:20:15,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 67 transitions, 520 flow, removed 4 selfloop flow, removed 0 redundant places. [2021-06-11 06:20:15,066 INFO L241 Difference]: Finished difference. Result has 66 places, 67 transitions, 521 flow [2021-06-11 06:20:15,066 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=66, PETRI_TRANSITIONS=67} [2021-06-11 06:20:15,067 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2021-06-11 06:20:15,067 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:15,067 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 67 transitions, 521 flow [2021-06-11 06:20:15,067 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 67 transitions, 521 flow [2021-06-11 06:20:15,068 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 67 transitions, 521 flow [2021-06-11 06:20:15,390 INFO L129 PetriNetUnfolder]: 1816/3570 cut-off events. [2021-06-11 06:20:15,390 INFO L130 PetriNetUnfolder]: For 3992/5867 co-relation queries the response was YES. [2021-06-11 06:20:15,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10777 conditions, 3570 events. 1816/3570 cut-off events. For 3992/5867 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 31775 event pairs, 755 based on Foata normal form. 20/3075 useless extension candidates. Maximal degree in co-relation 10750. Up to 2603 conditions per place. [2021-06-11 06:20:15,459 INFO L151 LiptonReduction]: Number of co-enabled transitions 1454 [2021-06-11 06:20:15,482 INFO L163 LiptonReduction]: Checked pairs total: 1001 [2021-06-11 06:20:15,482 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:15,482 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 415 [2021-06-11 06:20:15,483 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 67 transitions, 521 flow [2021-06-11 06:20:15,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:15,483 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:15,483 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:15,484 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-11 06:20:15,484 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:15,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:15,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1545092170, now seen corresponding path program 1 times [2021-06-11 06:20:15,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:15,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676051609] [2021-06-11 06:20:15,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:15,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:15,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:15,568 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 06:20:15,568 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:20:15,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:15,572 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:15,576 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:15,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:15,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-06-11 06:20:15,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676051609] [2021-06-11 06:20:15,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:15,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-06-11 06:20:15,577 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089519921] [2021-06-11 06:20:15,577 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-11 06:20:15,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:15,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-11 06:20:15,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-06-11 06:20:15,579 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 221 [2021-06-11 06:20:15,581 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 67 transitions, 521 flow. Second operand has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:15,581 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:15,581 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 221 [2021-06-11 06:20:15,581 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:16,073 INFO L129 PetriNetUnfolder]: 1631/3371 cut-off events. [2021-06-11 06:20:16,074 INFO L130 PetriNetUnfolder]: For 6221/13815 co-relation queries the response was YES. [2021-06-11 06:20:16,102 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12953 conditions, 3371 events. 1631/3371 cut-off events. For 6221/13815 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 29885 event pairs, 174 based on Foata normal form. 817/3814 useless extension candidates. Maximal degree in co-relation 12924. Up to 2408 conditions per place. [2021-06-11 06:20:16,122 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 10 selfloop transitions, 22 changer transitions 0/81 dead transitions. [2021-06-11 06:20:16,122 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 81 transitions, 666 flow [2021-06-11 06:20:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-11 06:20:16,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-06-11 06:20:16,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1287 transitions. [2021-06-11 06:20:16,126 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8319327731092437 [2021-06-11 06:20:16,127 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1287 transitions. [2021-06-11 06:20:16,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1287 transitions. [2021-06-11 06:20:16,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:16,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1287 transitions. [2021-06-11 06:20:16,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 183.85714285714286) internal successors, (1287), 7 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:16,133 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:16,133 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:16,133 INFO L185 Difference]: Start difference. First operand has 66 places, 67 transitions, 521 flow. Second operand 7 states and 1287 transitions. [2021-06-11 06:20:16,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 81 transitions, 666 flow [2021-06-11 06:20:16,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 655 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-06-11 06:20:16,153 INFO L241 Difference]: Finished difference. Result has 74 places, 77 transitions, 658 flow [2021-06-11 06:20:16,154 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=510, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=658, PETRI_PLACES=74, PETRI_TRANSITIONS=77} [2021-06-11 06:20:16,154 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 25 predicate places. [2021-06-11 06:20:16,154 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:16,154 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 74 places, 77 transitions, 658 flow [2021-06-11 06:20:16,155 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 74 places, 77 transitions, 658 flow [2021-06-11 06:20:16,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 77 transitions, 658 flow [2021-06-11 06:20:16,459 INFO L129 PetriNetUnfolder]: 1659/3435 cut-off events. [2021-06-11 06:20:16,459 INFO L130 PetriNetUnfolder]: For 14226/19602 co-relation queries the response was YES. [2021-06-11 06:20:16,485 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15626 conditions, 3435 events. 1659/3435 cut-off events. For 14226/19602 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 30808 event pairs, 183 based on Foata normal form. 63/3132 useless extension candidates. Maximal degree in co-relation 15595. Up to 2458 conditions per place. [2021-06-11 06:20:16,528 INFO L151 LiptonReduction]: Number of co-enabled transitions 1922 [2021-06-11 06:20:16,547 INFO L163 LiptonReduction]: Checked pairs total: 1587 [2021-06-11 06:20:16,547 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:16,547 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 393 [2021-06-11 06:20:16,548 INFO L480 AbstractCegarLoop]: Abstraction has has 74 places, 77 transitions, 658 flow [2021-06-11 06:20:16,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 179.8) internal successors, (899), 5 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:16,549 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:16,549 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-11 06:20:16,549 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-11 06:20:16,549 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:16,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:16,550 INFO L82 PathProgramCache]: Analyzing trace with hash -771651116, now seen corresponding path program 1 times [2021-06-11 06:20:16,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:16,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196437469] [2021-06-11 06:20:16,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:16,675 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:16,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:16,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:16,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:16,682 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 06:20:16,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:20:16,686 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:16,686 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:16,691 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:16,691 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:16,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196437469] [2021-06-11 06:20:16,691 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:16,692 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:20:16,692 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503514105] [2021-06-11 06:20:16,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-11 06:20:16,692 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:16,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-11 06:20:16,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-06-11 06:20:16,694 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 221 [2021-06-11 06:20:16,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 77 transitions, 658 flow. Second operand has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:16,695 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:16,695 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 221 [2021-06-11 06:20:16,695 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:17,154 INFO L129 PetriNetUnfolder]: 1430/3039 cut-off events. [2021-06-11 06:20:17,154 INFO L130 PetriNetUnfolder]: For 14282/27798 co-relation queries the response was YES. [2021-06-11 06:20:17,174 INFO L84 FinitePrefix]: Finished finitePrefix Result has 16441 conditions, 3039 events. 1430/3039 cut-off events. For 14282/27798 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 27114 event pairs, 21 based on Foata normal form. 1224/3926 useless extension candidates. Maximal degree in co-relation 16408. Up to 2257 conditions per place. [2021-06-11 06:20:17,189 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 6 selfloop transitions, 36 changer transitions 4/95 dead transitions. [2021-06-11 06:20:17,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 95 transitions, 924 flow [2021-06-11 06:20:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-11 06:20:17,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-06-11 06:20:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1655 transitions. [2021-06-11 06:20:17,193 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8320764203117145 [2021-06-11 06:20:17,193 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1655 transitions. [2021-06-11 06:20:17,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1655 transitions. [2021-06-11 06:20:17,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:17,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1655 transitions. [2021-06-11 06:20:17,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 183.88888888888889) internal successors, (1655), 9 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:17,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:17,201 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:17,201 INFO L185 Difference]: Start difference. First operand has 74 places, 77 transitions, 658 flow. Second operand 9 states and 1655 transitions. [2021-06-11 06:20:17,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 95 transitions, 924 flow [2021-06-11 06:20:17,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 95 transitions, 853 flow, removed 25 selfloop flow, removed 3 redundant places. [2021-06-11 06:20:17,335 INFO L241 Difference]: Finished difference. Result has 82 places, 91 transitions, 840 flow [2021-06-11 06:20:17,336 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=840, PETRI_PLACES=82, PETRI_TRANSITIONS=91} [2021-06-11 06:20:17,336 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2021-06-11 06:20:17,336 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:17,336 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 91 transitions, 840 flow [2021-06-11 06:20:17,336 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 91 transitions, 840 flow [2021-06-11 06:20:17,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 91 transitions, 840 flow [2021-06-11 06:20:17,579 INFO L129 PetriNetUnfolder]: 1364/2992 cut-off events. [2021-06-11 06:20:17,579 INFO L130 PetriNetUnfolder]: For 17469/20105 co-relation queries the response was YES. [2021-06-11 06:20:17,605 INFO L84 FinitePrefix]: Finished finitePrefix Result has 15048 conditions, 2992 events. 1364/2992 cut-off events. For 17469/20105 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 27474 event pairs, 28 based on Foata normal form. 2/2655 useless extension candidates. Maximal degree in co-relation 15014. Up to 1702 conditions per place. [2021-06-11 06:20:17,640 INFO L151 LiptonReduction]: Number of co-enabled transitions 2306 [2021-06-11 06:20:17,669 INFO L163 LiptonReduction]: Checked pairs total: 2534 [2021-06-11 06:20:17,670 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:17,670 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 334 [2021-06-11 06:20:17,670 INFO L480 AbstractCegarLoop]: Abstraction has has 82 places, 91 transitions, 840 flow [2021-06-11 06:20:17,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 179.83333333333334) internal successors, (1079), 6 states have internal predecessors, (1079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:17,671 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:17,671 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, 1, 1, 1] [2021-06-11 06:20:17,671 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-06-11 06:20:17,671 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash -395857104, now seen corresponding path program 1 times [2021-06-11 06:20:17,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:17,672 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403094785] [2021-06-11 06:20:17,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:17,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:17,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:17,791 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:20:17,803 INFO L142 QuantifierPusher]: treesize reduction 45, result has 63.1 percent of original size [2021-06-11 06:20:17,807 INFO L147 QuantifierPusher]: treesize reduction 9, result has 88.3 percent of original size 68 [2021-06-11 06:20:17,848 INFO L142 QuantifierPusher]: treesize reduction 31, result has 72.8 percent of original size [2021-06-11 06:20:17,850 INFO L147 QuantifierPusher]: treesize reduction 8, result has 90.4 percent of original size 75 [2021-06-11 06:20:17,886 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:17,886 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-06-11 06:20:17,897 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:17,897 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:20:17,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:17,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403094785] [2021-06-11 06:20:17,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:17,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-11 06:20:17,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45986685] [2021-06-11 06:20:17,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-11 06:20:17,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:17,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-11 06:20:17,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-11 06:20:17,906 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 221 [2021-06-11 06:20:17,907 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 91 transitions, 840 flow. Second operand has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:17,907 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:17,908 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 221 [2021-06-11 06:20:17,908 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:19,706 INFO L129 PetriNetUnfolder]: 6511/14455 cut-off events. [2021-06-11 06:20:19,706 INFO L130 PetriNetUnfolder]: For 90283/107027 co-relation queries the response was YES. [2021-06-11 06:20:19,824 INFO L84 FinitePrefix]: Finished finitePrefix Result has 68821 conditions, 14455 events. 6511/14455 cut-off events. For 90283/107027 co-relation queries the response was YES. Maximal size of possible extension queue 2344. Compared 169645 event pairs, 208 based on Foata normal form. 769/13459 useless extension candidates. Maximal degree in co-relation 68785. Up to 7205 conditions per place. [2021-06-11 06:20:19,872 INFO L132 encePairwiseOnDemand]: 213/221 looper letters, 31 selfloop transitions, 9 changer transitions 0/120 dead transitions. [2021-06-11 06:20:19,872 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 120 transitions, 1122 flow [2021-06-11 06:20:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-11 06:20:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-06-11 06:20:19,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 987 transitions. [2021-06-11 06:20:19,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.744343891402715 [2021-06-11 06:20:19,875 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 987 transitions. [2021-06-11 06:20:19,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 987 transitions. [2021-06-11 06:20:19,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:19,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 987 transitions. [2021-06-11 06:20:19,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.5) internal successors, (987), 6 states have internal predecessors, (987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:19,881 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:19,881 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:19,881 INFO L185 Difference]: Start difference. First operand has 82 places, 91 transitions, 840 flow. Second operand 6 states and 987 transitions. [2021-06-11 06:20:19,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 120 transitions, 1122 flow [2021-06-11 06:20:27,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 120 transitions, 1032 flow, removed 30 selfloop flow, removed 4 redundant places. [2021-06-11 06:20:27,611 INFO L241 Difference]: Finished difference. Result has 86 places, 98 transitions, 842 flow [2021-06-11 06:20:27,611 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=842, PETRI_PLACES=86, PETRI_TRANSITIONS=98} [2021-06-11 06:20:27,612 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 37 predicate places. [2021-06-11 06:20:27,612 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:27,612 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 98 transitions, 842 flow [2021-06-11 06:20:27,612 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 98 transitions, 842 flow [2021-06-11 06:20:27,612 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 86 places, 98 transitions, 842 flow [2021-06-11 06:20:28,404 INFO L129 PetriNetUnfolder]: 5239/11209 cut-off events. [2021-06-11 06:20:28,404 INFO L130 PetriNetUnfolder]: For 46760/54477 co-relation queries the response was YES. [2021-06-11 06:20:28,471 INFO L84 FinitePrefix]: Finished finitePrefix Result has 45338 conditions, 11209 events. 5239/11209 cut-off events. For 46760/54477 co-relation queries the response was YES. Maximal size of possible extension queue 1936. Compared 125141 event pairs, 201 based on Foata normal form. 336/9942 useless extension candidates. Maximal degree in co-relation 45301. Up to 5831 conditions per place. [2021-06-11 06:20:28,587 INFO L151 LiptonReduction]: Number of co-enabled transitions 2754 [2021-06-11 06:20:28,626 INFO L163 LiptonReduction]: Checked pairs total: 827 [2021-06-11 06:20:28,626 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:20:28,626 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1014 [2021-06-11 06:20:28,626 INFO L480 AbstractCegarLoop]: Abstraction has has 86 places, 98 transitions, 842 flow [2021-06-11 06:20:28,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 160.14285714285714) internal successors, (1121), 7 states have internal predecessors, (1121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:28,627 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:28,627 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, 1, 1, 1, 1] [2021-06-11 06:20:28,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-06-11 06:20:28,627 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:28,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1213861034, now seen corresponding path program 1 times [2021-06-11 06:20:28,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:28,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87161411] [2021-06-11 06:20:28,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:28,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:28,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:28,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:28,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:28,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:28,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:28,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:28,674 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87161411] [2021-06-11 06:20:28,674 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:28,674 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-11 06:20:28,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161111007] [2021-06-11 06:20:28,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-06-11 06:20:28,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:28,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-06-11 06:20:28,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-06-11 06:20:28,676 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 221 [2021-06-11 06:20:28,676 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 98 transitions, 842 flow. Second operand has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:28,676 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:28,676 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 221 [2021-06-11 06:20:28,676 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:30,239 INFO L129 PetriNetUnfolder]: 8850/18539 cut-off events. [2021-06-11 06:20:30,239 INFO L130 PetriNetUnfolder]: For 75457/87080 co-relation queries the response was YES. [2021-06-11 06:20:30,366 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75491 conditions, 18539 events. 8850/18539 cut-off events. For 75457/87080 co-relation queries the response was YES. Maximal size of possible extension queue 3147. Compared 214215 event pairs, 305 based on Foata normal form. 482/16301 useless extension candidates. Maximal degree in co-relation 75452. Up to 10076 conditions per place. [2021-06-11 06:20:30,408 INFO L132 encePairwiseOnDemand]: 218/221 looper letters, 6 selfloop transitions, 5 changer transitions 1/102 dead transitions. [2021-06-11 06:20:30,408 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 102 transitions, 908 flow [2021-06-11 06:20:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-11 06:20:30,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-06-11 06:20:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2021-06-11 06:20:30,410 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8404977375565611 [2021-06-11 06:20:30,410 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 743 transitions. [2021-06-11 06:20:30,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 743 transitions. [2021-06-11 06:20:30,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:30,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 743 transitions. [2021-06-11 06:20:30,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 185.75) internal successors, (743), 4 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:30,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:30,413 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:30,414 INFO L185 Difference]: Start difference. First operand has 86 places, 98 transitions, 842 flow. Second operand 4 states and 743 transitions. [2021-06-11 06:20:30,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 102 transitions, 908 flow [2021-06-11 06:20:43,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 102 transitions, 902 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-06-11 06:20:43,701 INFO L241 Difference]: Finished difference. Result has 89 places, 100 transitions, 879 flow [2021-06-11 06:20:43,701 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=836, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=879, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2021-06-11 06:20:43,701 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 40 predicate places. [2021-06-11 06:20:43,701 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:20:43,701 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 100 transitions, 879 flow [2021-06-11 06:20:43,702 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 100 transitions, 879 flow [2021-06-11 06:20:43,702 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 100 transitions, 879 flow [2021-06-11 06:20:45,090 INFO L129 PetriNetUnfolder]: 8615/18245 cut-off events. [2021-06-11 06:20:45,090 INFO L130 PetriNetUnfolder]: For 73928/84348 co-relation queries the response was YES. [2021-06-11 06:20:45,270 INFO L84 FinitePrefix]: Finished finitePrefix Result has 74412 conditions, 18245 events. 8615/18245 cut-off events. For 73928/84348 co-relation queries the response was YES. Maximal size of possible extension queue 3134. Compared 216981 event pairs, 326 based on Foata normal form. 462/16237 useless extension candidates. Maximal degree in co-relation 74374. Up to 9878 conditions per place. [2021-06-11 06:20:45,768 INFO L151 LiptonReduction]: Number of co-enabled transitions 2822 [2021-06-11 06:20:45,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:45,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:45,893 INFO L163 LiptonReduction]: Checked pairs total: 1107 [2021-06-11 06:20:45,893 INFO L165 LiptonReduction]: Total number of compositions: 2 [2021-06-11 06:20:45,893 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2192 [2021-06-11 06:20:45,894 INFO L480 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 885 flow [2021-06-11 06:20:45,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 185.0) internal successors, (740), 4 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:45,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:20:45,894 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, 1, 1, 1] [2021-06-11 06:20:45,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-06-11 06:20:45,895 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:20:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:20:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -283129348, now seen corresponding path program 2 times [2021-06-11 06:20:45,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:20:45,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021994681] [2021-06-11 06:20:45,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:20:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-11 06:20:46,179 INFO L142 QuantifierPusher]: treesize reduction 6, result has 62.5 percent of original size [2021-06-11 06:20:46,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-11 06:20:46,188 INFO L142 QuantifierPusher]: treesize reduction 35, result has 49.3 percent of original size [2021-06-11 06:20:46,190 INFO L147 QuantifierPusher]: treesize reduction 8, result has 76.5 percent of original size 26 [2021-06-11 06:20:46,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:46,206 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:46,211 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:46,213 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:46,220 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:46,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:46,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:46,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:46,226 INFO L142 QuantifierPusher]: treesize reduction 8, result has 33.3 percent of original size [2021-06-11 06:20:46,227 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-06-11 06:20:46,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:46,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-11 06:20:46,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-11 06:20:46,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-11 06:20:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-11 06:20:46,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021994681] [2021-06-11 06:20:46,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-11 06:20:46,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-11 06:20:46,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41478155] [2021-06-11 06:20:46,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-11 06:20:46,239 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-11 06:20:46,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-11 06:20:46,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2021-06-11 06:20:46,241 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 223 [2021-06-11 06:20:46,242 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 885 flow. Second operand has 9 states, 9 states have (on average 156.22222222222223) internal successors, (1406), 9 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:46,242 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-06-11 06:20:46,242 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 223 [2021-06-11 06:20:46,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-06-11 06:20:55,257 INFO L129 PetriNetUnfolder]: 41141/64785 cut-off events. [2021-06-11 06:20:55,258 INFO L130 PetriNetUnfolder]: For 202240/217261 co-relation queries the response was YES. [2021-06-11 06:20:55,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 277053 conditions, 64785 events. 41141/64785 cut-off events. For 202240/217261 co-relation queries the response was YES. Maximal size of possible extension queue 4997. Compared 598523 event pairs, 458 based on Foata normal form. 3133/64548 useless extension candidates. Maximal degree in co-relation 277013. Up to 18283 conditions per place. [2021-06-11 06:20:55,746 INFO L132 encePairwiseOnDemand]: 214/223 looper letters, 53 selfloop transitions, 45 changer transitions 82/223 dead transitions. [2021-06-11 06:20:55,746 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 223 transitions, 2173 flow [2021-06-11 06:20:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-11 06:20:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-06-11 06:20:55,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2125 transitions. [2021-06-11 06:20:55,751 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7330113832355984 [2021-06-11 06:20:55,751 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2125 transitions. [2021-06-11 06:20:55,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2125 transitions. [2021-06-11 06:20:55,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-06-11 06:20:55,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2125 transitions. [2021-06-11 06:20:55,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 163.46153846153845) internal successors, (2125), 13 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:55,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:55,774 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 223.0) internal successors, (3122), 14 states have internal predecessors, (3122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:20:55,774 INFO L185 Difference]: Start difference. First operand has 89 places, 100 transitions, 885 flow. Second operand 13 states and 2125 transitions. [2021-06-11 06:20:55,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 223 transitions, 2173 flow [2021-06-11 06:22:59,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 223 transitions, 2160 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-06-11 06:22:59,214 INFO L241 Difference]: Finished difference. Result has 104 places, 99 transitions, 943 flow [2021-06-11 06:22:59,214 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=943, PETRI_PLACES=104, PETRI_TRANSITIONS=99} [2021-06-11 06:22:59,214 INFO L343 CegarLoopForPetriNet]: 49 programPoint places, 55 predicate places. [2021-06-11 06:22:59,215 INFO L168 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-06-11 06:22:59,215 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 99 transitions, 943 flow [2021-06-11 06:22:59,215 INFO L138 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 99 transitions, 943 flow [2021-06-11 06:22:59,216 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 102 places, 99 transitions, 943 flow [2021-06-11 06:23:00,314 INFO L129 PetriNetUnfolder]: 4684/12354 cut-off events. [2021-06-11 06:23:00,314 INFO L130 PetriNetUnfolder]: For 65830/73854 co-relation queries the response was YES. [2021-06-11 06:23:00,444 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60027 conditions, 12354 events. 4684/12354 cut-off events. For 65830/73854 co-relation queries the response was YES. Maximal size of possible extension queue 2060. Compared 160112 event pairs, 161 based on Foata normal form. 411/11238 useless extension candidates. Maximal degree in co-relation 59984. Up to 4899 conditions per place. [2021-06-11 06:23:00,616 INFO L151 LiptonReduction]: Number of co-enabled transitions 2596 [2021-06-11 06:23:00,655 INFO L163 LiptonReduction]: Checked pairs total: 236 [2021-06-11 06:23:00,655 INFO L165 LiptonReduction]: Total number of compositions: 0 [2021-06-11 06:23:00,656 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1441 [2021-06-11 06:23:00,656 INFO L480 AbstractCegarLoop]: Abstraction has has 102 places, 99 transitions, 943 flow [2021-06-11 06:23:00,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 156.22222222222223) internal successors, (1406), 9 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-11 06:23:00,657 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-06-11 06:23:00,657 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, 1, 1, 1, 1, 1, 1] [2021-06-11 06:23:00,657 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-06-11 06:23:00,658 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-11 06:23:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-11 06:23:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash -52977131, now seen corresponding path program 1 times [2021-06-11 06:23:00,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-11 06:23:00,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047662393] [2021-06-11 06:23:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-11 06:23:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:23:00,709 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:23:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-11 06:23:00,762 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-11 06:23:00,816 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-11 06:23:00,817 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-06-11 06:23:00,817 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-11 06:23:00,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.06 06:23:00 BasicIcfg [2021-06-11 06:23:00,953 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-11 06:23:00,954 INFO L168 Benchmark]: Toolchain (without parser) took 178741.65 ms. Allocated memory was 421.5 MB in the beginning and 8.8 GB in the end (delta: 8.4 GB). Free memory was 383.5 MB in the beginning and 4.3 GB in the end (delta: -4.0 GB). Peak memory consumption was 4.4 GB. Max. memory is 16.0 GB. [2021-06-11 06:23:00,954 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 421.5 MB. Free memory was 402.2 MB in the beginning and 402.2 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-11 06:23:00,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.22 ms. Allocated memory is still 421.5 MB. Free memory was 383.3 MB in the beginning and 378.7 MB in the end (delta: 4.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.0 GB. [2021-06-11 06:23:00,954 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.01 ms. Allocated memory is still 421.5 MB. Free memory was 378.7 MB in the beginning and 376.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:23:00,954 INFO L168 Benchmark]: Boogie Preprocessor took 41.56 ms. Allocated memory is still 421.5 MB. Free memory was 376.0 MB in the beginning and 373.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-11 06:23:00,955 INFO L168 Benchmark]: RCFGBuilder took 2022.72 ms. Allocated memory is still 421.5 MB. Free memory was 373.4 MB in the beginning and 278.1 MB in the end (delta: 95.3 MB). Peak memory consumption was 135.2 MB. Max. memory is 16.0 GB. [2021-06-11 06:23:00,955 INFO L168 Benchmark]: TraceAbstraction took 176111.88 ms. Allocated memory was 421.5 MB in the beginning and 8.8 GB in the end (delta: 8.4 GB). Free memory was 277.1 MB in the beginning and 4.3 GB in the end (delta: -4.1 GB). Peak memory consumption was 4.3 GB. Max. memory is 16.0 GB. [2021-06-11 06:23:00,956 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.13 ms. Allocated memory is still 421.5 MB. Free memory was 402.2 MB in the beginning and 402.2 MB in the end (delta: 70.3 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 510.22 ms. Allocated memory is still 421.5 MB. Free memory was 383.3 MB in the beginning and 378.7 MB in the end (delta: 4.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 45.01 ms. Allocated memory is still 421.5 MB. Free memory was 378.7 MB in the beginning and 376.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 41.56 ms. Allocated memory is still 421.5 MB. Free memory was 376.0 MB in the beginning and 373.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2022.72 ms. Allocated memory is still 421.5 MB. Free memory was 373.4 MB in the beginning and 278.1 MB in the end (delta: 95.3 MB). Peak memory consumption was 135.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 176111.88 ms. Allocated memory was 421.5 MB in the beginning and 8.8 GB in the end (delta: 8.4 GB). Free memory was 277.1 MB in the beginning and 4.3 GB in the end (delta: -4.1 GB). Peak memory consumption was 4.3 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6368.7ms, 126 PlacesBefore, 49 PlacesAfterwards, 115 TransitionsBefore, 37 TransitionsAfterwards, 2876 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 8967 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3477, positive: 3245, positive conditional: 0, positive unconditional: 3245, negative: 232, negative conditional: 0, negative unconditional: 232, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1894, positive: 1843, positive conditional: 0, positive unconditional: 1843, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1894, positive: 1843, positive conditional: 0, positive unconditional: 1843, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1894, positive: 1816, positive conditional: 0, positive unconditional: 1816, negative: 78, negative conditional: 0, negative unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, positive: 27, positive conditional: 0, positive unconditional: 27, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 771, positive: 72, positive conditional: 0, positive unconditional: 72, negative: 699, negative conditional: 0, negative unconditional: 699, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3477, positive: 1402, positive conditional: 0, positive unconditional: 1402, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 1894, unknown conditional: 0, unknown unconditional: 1894] , Statistics on independence cache: Total cache size (in pairs): 3195, Positive cache size: 3144, Positive conditional cache size: 0, Positive unconditional cache size: 3144, Negative cache size: 51, Negative conditional cache size: 0, Negative unconditional cache size: 51 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 399.8ms, 45 PlacesBefore, 43 PlacesAfterwards, 33 TransitionsBefore, 32 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 355, positive: 295, positive conditional: 0, positive unconditional: 295, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 76, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 76, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 76, positive: 55, positive conditional: 0, positive unconditional: 55, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 259, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 225, negative conditional: 0, negative unconditional: 225, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 355, positive: 235, positive conditional: 0, positive unconditional: 235, negative: 44, negative conditional: 0, negative unconditional: 44, unknown: 76, unknown conditional: 0, unknown unconditional: 76] , Statistics on independence cache: Total cache size (in pairs): 3301, Positive cache size: 3234, Positive conditional cache size: 0, Positive unconditional cache size: 3234, Negative cache size: 67, Negative conditional cache size: 0, Negative unconditional cache size: 67 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 227.7ms, 49 PlacesBefore, 45 PlacesAfterwards, 37 TransitionsBefore, 37 TransitionsAfterwards, 600 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 392 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 100, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 38, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 38, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 111, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 111, negative conditional: 0, negative unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 100, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 38, unknown conditional: 0, unknown unconditional: 38] , Statistics on independence cache: Total cache size (in pairs): 3339, Positive cache size: 3268, Positive conditional cache size: 0, Positive unconditional cache size: 3268, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.6ms, 47 PlacesBefore, 47 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 521 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 137, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 137, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 3344, Positive cache size: 3273, Positive conditional cache size: 0, Positive unconditional cache size: 3273, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 57.3ms, 50 PlacesBefore, 50 PlacesAfterwards, 44 TransitionsBefore, 44 TransitionsAfterwards, 720 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 521 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 141, positive: 124, positive conditional: 0, positive unconditional: 124, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 141, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 3348, Positive cache size: 3277, Positive conditional cache size: 0, Positive unconditional cache size: 3277, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 55.0ms, 51 PlacesBefore, 51 PlacesAfterwards, 49 TransitionsBefore, 49 TransitionsAfterwards, 802 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 651 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 189, positive: 169, positive conditional: 0, positive unconditional: 169, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 189, positive: 165, positive conditional: 0, positive unconditional: 165, negative: 20, negative conditional: 0, negative unconditional: 20, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 3352, Positive cache size: 3281, Positive conditional cache size: 0, Positive unconditional cache size: 3281, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 305.2ms, 57 PlacesBefore, 57 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 1218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 831 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 237, positive: 216, positive conditional: 0, positive unconditional: 216, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 237, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 3353, Positive cache size: 3282, Positive conditional cache size: 0, Positive unconditional cache size: 3282, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 302.3ms, 63 PlacesBefore, 63 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1001 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 142, positive: 119, positive conditional: 0, positive unconditional: 119, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 142, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 3357, Positive cache size: 3286, Positive conditional cache size: 0, Positive unconditional cache size: 3286, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 415.1ms, 66 PlacesBefore, 66 PlacesAfterwards, 67 TransitionsBefore, 67 TransitionsAfterwards, 1454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1001 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 154, positive: 131, positive conditional: 0, positive unconditional: 131, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 154, positive: 130, positive conditional: 0, positive unconditional: 130, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 3358, Positive cache size: 3287, Positive conditional cache size: 0, Positive unconditional cache size: 3287, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 392.4ms, 74 PlacesBefore, 74 PlacesAfterwards, 77 TransitionsBefore, 77 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 1587 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 259, positive: 228, positive conditional: 0, positive unconditional: 228, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 0, positive unconditional: 7, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 259, positive: 221, positive conditional: 0, positive unconditional: 221, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 7, unknown conditional: 0, unknown unconditional: 7] , Statistics on independence cache: Total cache size (in pairs): 3365, Positive cache size: 3294, Positive conditional cache size: 0, Positive unconditional cache size: 3294, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 333.6ms, 82 PlacesBefore, 82 PlacesAfterwards, 91 TransitionsBefore, 91 TransitionsAfterwards, 2306 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 2534 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 531, positive: 488, positive conditional: 0, positive unconditional: 488, negative: 43, negative conditional: 0, negative unconditional: 43, 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: 531, positive: 488, positive conditional: 0, positive unconditional: 488, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3365, Positive cache size: 3294, Positive conditional cache size: 0, Positive unconditional cache size: 3294, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1013.9ms, 86 PlacesBefore, 86 PlacesAfterwards, 98 TransitionsBefore, 98 TransitionsAfterwards, 2754 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 827 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 293, positive: 278, positive conditional: 0, positive unconditional: 278, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 293, positive: 278, positive conditional: 0, positive unconditional: 278, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3365, Positive cache size: 3294, Positive conditional cache size: 0, Positive unconditional cache size: 3294, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2191.6ms, 89 PlacesBefore, 89 PlacesAfterwards, 100 TransitionsBefore, 100 TransitionsAfterwards, 2822 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 1107 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 482, positive: 464, positive conditional: 0, positive unconditional: 464, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 482, positive: 458, positive conditional: 0, positive unconditional: 458, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 3549, Positive cache size: 3478, Positive conditional cache size: 0, Positive unconditional cache size: 3478, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1440.3ms, 104 PlacesBefore, 102 PlacesAfterwards, 99 TransitionsBefore, 99 TransitionsAfterwards, 2596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 236 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 3549, Positive cache size: 3478, Positive conditional cache size: 0, Positive unconditional cache size: 3478, Negative cache size: 71, Negative conditional cache size: 0, Negative unconditional cache size: 71 - CounterExampleResult [Line: 18]: 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1241; [L870] FCALL, FORK 0 pthread_create(&t1241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1242; [L872] FCALL, FORK 0 pthread_create(&t1242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L873] 0 pthread_t t1243; [L874] FCALL, FORK 0 pthread_create(&t1243, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L875] 0 pthread_t t1244; [L876] FCALL, FORK 0 pthread_create(&t1244, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L836] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0) [L836] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L837] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L838] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used) [L838] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L839] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L840] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4) [L840] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L788] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L808] EXPR 3 b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b [L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L847] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L882] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L882] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L882] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 1.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 175849.3ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 160503.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6447.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 82 SDtfs, 101 SDslu, 88 SDs, 0 SdLazy, 381 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 438.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 369.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred in iteration=13, InterpolantAutomatonStates: 69, 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: 41.3ms SsaConstructionTime, 427.1ms SatisfiabilityAnalysisTime, 931.2ms InterpolantComputationTime, 237 NumberOfCodeBlocks, 237 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 197 ConstructedInterpolants, 0 QuantifiedInterpolants, 1202 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...