/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-26 10:35:47,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-26 10:35:47,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-26 10:35:47,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-26 10:35:47,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-26 10:35:47,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-26 10:35:47,821 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-26 10:35:47,826 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-26 10:35:47,828 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-26 10:35:47,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-26 10:35:47,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-26 10:35:47,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-26 10:35:47,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-26 10:35:47,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-26 10:35:47,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-26 10:35:47,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-26 10:35:47,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-26 10:35:47,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-26 10:35:47,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-26 10:35:47,854 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-26 10:35:47,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-26 10:35:47,857 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-26 10:35:47,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-26 10:35:47,860 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-26 10:35:47,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-26 10:35:47,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-26 10:35:47,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-26 10:35:47,868 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-26 10:35:47,868 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-26 10:35:47,869 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-26 10:35:47,869 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-26 10:35:47,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-26 10:35:47,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-26 10:35:47,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-26 10:35:47,872 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-26 10:35:47,872 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-26 10:35:47,873 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-26 10:35:47,873 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-26 10:35:47,873 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-26 10:35:47,874 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-26 10:35:47,874 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-26 10:35:47,878 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbeWithDisjunctivePredicates.epf [2021-03-26 10:35:47,911 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-26 10:35:47,912 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-26 10:35:47,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-26 10:35:47,915 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-26 10:35:47,915 INFO L138 SettingsManager]: * Use SBE=true [2021-03-26 10:35:47,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-26 10:35:47,916 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-26 10:35:47,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-26 10:35:47,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-26 10:35:47,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-26 10:35:47,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-26 10:35:47,917 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-26 10:35:47,917 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-26 10:35:47,917 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-26 10:35:47,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-26 10:35:47,918 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-26 10:35:47,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-26 10:35:47,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-26 10:35:47,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-26 10:35:47,918 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-26 10:35:47,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-26 10:35:47,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:35:47,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-26 10:35:47,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-26 10:35:47,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-26 10:35:47,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-26 10:35:47,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-26 10:35:47,920 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=SEMANTIC_BASED_MOVER_CHECK_WITH_PREDICATES_DISJUNCTIVE [2021-03-26 10:35:47,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-26 10:35:47,920 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-26 10:35:47,920 INFO L138 SettingsManager]: * Apply repeated Lipton Reduction=true WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-03-26 10:35:48,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-26 10:35:48,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-26 10:35:48,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-26 10:35:48,218 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-26 10:35:48,219 INFO L275 PluginConnector]: CDTParser initialized [2021-03-26 10:35:48,220 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2021-03-26 10:35:48,278 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08faff97/e5fc53472b454c7f87a2fd0c63c19eae/FLAG6ebb68300 [2021-03-26 10:35:48,848 INFO L306 CDTParser]: Found 1 translation units. [2021-03-26 10:35:48,849 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_power.oepc.i [2021-03-26 10:35:48,874 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08faff97/e5fc53472b454c7f87a2fd0c63c19eae/FLAG6ebb68300 [2021-03-26 10:35:49,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e08faff97/e5fc53472b454c7f87a2fd0c63c19eae [2021-03-26 10:35:49,138 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-26 10:35:49,139 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-26 10:35:49,143 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-26 10:35:49,143 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-26 10:35:49,146 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-26 10:35:49,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c7cb994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49, skipping insertion in model container [2021-03-26 10:35:49,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-26 10:35:49,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-26 10:35:49,307 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/safe019_power.oepc.i[995,1008] [2021-03-26 10:35:49,508 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:35:49,516 INFO L203 MainTranslator]: Completed pre-run [2021-03-26 10:35:49,526 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/safe019_power.oepc.i[995,1008] [2021-03-26 10:35:49,571 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-26 10:35:49,631 INFO L208 MainTranslator]: Completed translation [2021-03-26 10:35:49,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49 WrapperNode [2021-03-26 10:35:49,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-26 10:35:49,632 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-26 10:35:49,632 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-26 10:35:49,632 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-26 10:35:49,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,678 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-26 10:35:49,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-26 10:35:49,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-26 10:35:49,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-26 10:35:49,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,691 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,691 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... [2021-03-26 10:35:49,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-26 10:35:49,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-26 10:35:49,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-26 10:35:49,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-26 10:35:49,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-26 10:35:49,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-03-26 10:35:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-26 10:35:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-26 10:35:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-26 10:35:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-26 10:35:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-26 10:35:49,798 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-26 10:35:49,798 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-26 10:35:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-26 10:35:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-26 10:35:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-26 10:35:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-26 10:35:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-26 10:35:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-26 10:35:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-26 10:35:49,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-26 10:35:49,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-26 10:35:49,801 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-26 10:35:52,537 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-26 10:35:52,538 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-03-26 10:35:52,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:35:52 BoogieIcfgContainer [2021-03-26 10:35:52,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-26 10:35:52,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-26 10:35:52,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-26 10:35:52,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-26 10:35:52,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.03 10:35:49" (1/3) ... [2021-03-26 10:35:52,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3653b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:35:52, skipping insertion in model container [2021-03-26 10:35:52,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.03 10:35:49" (2/3) ... [2021-03-26 10:35:52,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3653b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.03 10:35:52, skipping insertion in model container [2021-03-26 10:35:52,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.03 10:35:52" (3/3) ... [2021-03-26 10:35:52,548 INFO L111 eAbstractionObserver]: Analyzing ICFG safe019_power.oepc.i [2021-03-26 10:35:52,553 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-26 10:35:52,557 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-03-26 10:35:52,558 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-26 10:35:52,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,600 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,600 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,600 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,608 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,609 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,612 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,613 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,614 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,615 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,616 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,617 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,618 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,619 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,620 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,624 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,625 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,626 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,627 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,630 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,631 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,632 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,633 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,635 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,638 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,639 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,640 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,646 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~mem61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,647 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-26 10:35:52,648 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-26 10:35:52,662 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-26 10:35:52,678 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-26 10:35:52,678 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-26 10:35:52,678 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-26 10:35:52,678 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-26 10:35:52,678 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-26 10:35:52,678 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-26 10:35:52,678 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-26 10:35:52,678 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-26 10:35:52,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-03-26 10:35:52,729 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-03-26 10:35:52,729 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:35:52,733 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2021-03-26 10:35:52,733 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2021-03-26 10:35:52,737 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 111 transitions, 234 flow [2021-03-26 10:35:52,738 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:35:52,749 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 111 transitions, 234 flow [2021-03-26 10:35:52,752 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 123 places, 111 transitions, 234 flow [2021-03-26 10:35:52,753 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 123 places, 111 transitions, 234 flow [2021-03-26 10:35:52,772 INFO L129 PetriNetUnfolder]: 1/111 cut-off events. [2021-03-26 10:35:52,773 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:35:52,773 INFO L84 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 1/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2021-03-26 10:35:52,775 INFO L142 LiptonReduction]: Number of co-enabled transitions 1430 [2021-03-26 10:35:58,770 WARN L205 SmtUtils]: Spent 2.77 s on a formula simplification. DAG size of input: 406 DAG size of output: 363 [2021-03-26 10:35:59,521 WARN L205 SmtUtils]: Spent 735.00 ms on a formula simplification that was a NOOP. DAG size: 360 [2021-03-26 10:36:03,196 WARN L205 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 566 DAG size of output: 532 [2021-03-26 10:36:04,955 WARN L205 SmtUtils]: Spent 1.75 s on a formula simplification that was a NOOP. DAG size: 528 [2021-03-26 10:36:05,954 WARN L205 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 238 [2021-03-26 10:36:06,382 WARN L205 SmtUtils]: Spent 419.00 ms on a formula simplification that was a NOOP. DAG size: 236 [2021-03-26 10:36:08,186 WARN L205 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 370 DAG size of output: 326 [2021-03-26 10:36:09,000 WARN L205 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 323 [2021-03-26 10:36:10,752 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2021-03-26 10:36:11,186 WARN L205 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 96 [2021-03-26 10:36:11,328 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2021-03-26 10:36:12,106 WARN L205 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-03-26 10:36:12,507 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-03-26 10:36:14,068 WARN L205 SmtUtils]: Spent 1.56 s on a formula simplification. DAG size of input: 325 DAG size of output: 324 [2021-03-26 10:36:14,912 WARN L205 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 324 [2021-03-26 10:36:20,804 WARN L205 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2021-03-26 10:36:21,279 WARN L205 SmtUtils]: Spent 473.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2021-03-26 10:36:22,125 WARN L205 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 325 [2021-03-26 10:36:22,974 WARN L205 SmtUtils]: Spent 847.00 ms on a formula simplification that was a NOOP. DAG size: 325 [2021-03-26 10:36:24,672 INFO L154 LiptonReduction]: Checked pairs total: 1770 [2021-03-26 10:36:24,672 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-26 10:36:24,674 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31937 [2021-03-26 10:36:24,693 INFO L129 PetriNetUnfolder]: 1/45 cut-off events. [2021-03-26 10:36:24,693 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:36:24,694 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:24,694 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, 1, 1, 1, 1] [2021-03-26 10:36:24,694 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1237009363, now seen corresponding path program 1 times [2021-03-26 10:36:24,703 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:24,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613541758] [2021-03-26 10:36:24,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:24,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:25,084 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:25,085 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:36:25,085 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:25,086 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:25,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:25,093 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613541758] [2021-03-26 10:36:25,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:25,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:36:25,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496310798] [2021-03-26 10:36:25,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-26 10:36:25,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:25,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-26 10:36:25,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-26 10:36:25,117 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 197 [2021-03-26 10:36:25,123 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 104 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-03-26 10:36:25,123 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:25,123 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 197 [2021-03-26 10:36:25,124 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:25,149 INFO L129 PetriNetUnfolder]: 0/44 cut-off events. [2021-03-26 10:36:25,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-26 10:36:25,150 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 44 events. 0/44 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 3/46 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:36:25,151 INFO L132 encePairwiseOnDemand]: 193/197 looper letters, 1 selfloop transitions, 2 changer transitions 1/44 dead transitions. [2021-03-26 10:36:25,151 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 106 flow [2021-03-26 10:36:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:36:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:36:25,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2021-03-26 10:36:25,169 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9390862944162437 [2021-03-26 10:36:25,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 555 transitions. [2021-03-26 10:36:25,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions. [2021-03-26 10:36:25,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:25,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions. [2021-03-26 10:36:25,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:25,197 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:25,197 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:25,199 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 104 flow. Second operand 3 states and 555 transitions. [2021-03-26 10:36:25,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 106 flow [2021-03-26 10:36:25,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 44 transitions, 102 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-26 10:36:25,202 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 102 flow [2021-03-26 10:36:25,204 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2021-03-26 10:36:25,204 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -2 predicate places. [2021-03-26 10:36:25,204 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:25,205 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 43 transitions, 102 flow [2021-03-26 10:36:25,205 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 43 transitions, 102 flow [2021-03-26 10:36:25,207 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 43 transitions, 102 flow [2021-03-26 10:36:25,216 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-03-26 10:36:25,216 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-26 10:36:25,216 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 43 events. 0/43 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 0/43 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:36:25,217 INFO L142 LiptonReduction]: Number of co-enabled transitions 244 [2021-03-26 10:36:29,000 INFO L154 LiptonReduction]: Checked pairs total: 1275 [2021-03-26 10:36:29,000 INFO L156 LiptonReduction]: Total number of compositions: 17 [2021-03-26 10:36:29,000 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3796 [2021-03-26 10:36:29,001 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 68 flow [2021-03-26 10:36:29,002 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-03-26 10:36:29,002 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:29,002 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, 1, 1, 1, 1, 1] [2021-03-26 10:36:29,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-26 10:36:29,003 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:29,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:29,003 INFO L82 PathProgramCache]: Analyzing trace with hash -307414692, now seen corresponding path program 1 times [2021-03-26 10:36:29,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:29,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454134995] [2021-03-26 10:36:29,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:29,093 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:29,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:36:29,095 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:29,095 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:29,099 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:29,099 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:29,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:29,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454134995] [2021-03-26 10:36:29,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:29,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:36:29,104 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205100895] [2021-03-26 10:36:29,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:36:29,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:29,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:36:29,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:36:29,108 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 214 [2021-03-26 10:36:29,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 191.75) internal successors, (767), 4 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:29,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:29,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 214 [2021-03-26 10:36:29,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:29,158 INFO L129 PetriNetUnfolder]: 5/48 cut-off events. [2021-03-26 10:36:29,158 INFO L130 PetriNetUnfolder]: For 13/37 co-relation queries the response was YES. [2021-03-26 10:36:29,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 48 events. 5/48 cut-off events. For 13/37 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 145 event pairs, 1 based on Foata normal form. 2/47 useless extension candidates. Maximal degree in co-relation 75. Up to 7 conditions per place. [2021-03-26 10:36:29,159 INFO L132 encePairwiseOnDemand]: 210/214 looper letters, 4 selfloop transitions, 3 changer transitions 1/29 dead transitions. [2021-03-26 10:36:29,159 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 29 transitions, 93 flow [2021-03-26 10:36:29,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:36:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:36:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 774 transitions. [2021-03-26 10:36:29,165 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9042056074766355 [2021-03-26 10:36:29,165 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 774 transitions. [2021-03-26 10:36:29,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 774 transitions. [2021-03-26 10:36:29,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:29,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 774 transitions. [2021-03-26 10:36:29,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.5) internal successors, (774), 4 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:29,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:29,171 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:29,173 INFO L185 Difference]: Start difference. First operand has 38 places, 26 transitions, 68 flow. Second operand 4 states and 774 transitions. [2021-03-26 10:36:29,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 29 transitions, 93 flow [2021-03-26 10:36:29,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 87 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:36:29,175 INFO L241 Difference]: Finished difference. Result has 41 places, 26 transitions, 78 flow [2021-03-26 10:36:29,175 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=41, PETRI_TRANSITIONS=26} [2021-03-26 10:36:29,176 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -17 predicate places. [2021-03-26 10:36:29,176 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:29,176 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 26 transitions, 78 flow [2021-03-26 10:36:29,176 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 26 transitions, 78 flow [2021-03-26 10:36:29,177 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 26 transitions, 78 flow [2021-03-26 10:36:29,181 INFO L129 PetriNetUnfolder]: 0/26 cut-off events. [2021-03-26 10:36:29,181 INFO L130 PetriNetUnfolder]: For 7/8 co-relation queries the response was YES. [2021-03-26 10:36:29,181 INFO L84 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 26 events. 0/26 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 33 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:36:29,182 INFO L142 LiptonReduction]: Number of co-enabled transitions 234 [2021-03-26 10:36:29,527 WARN L205 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 10:36:29,658 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 10:36:29,790 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 10:36:29,921 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2021-03-26 10:36:31,087 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-03-26 10:36:31,257 WARN L205 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2021-03-26 10:36:31,452 WARN L205 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2021-03-26 10:36:31,617 WARN L205 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2021-03-26 10:36:31,620 INFO L154 LiptonReduction]: Checked pairs total: 699 [2021-03-26 10:36:31,621 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-26 10:36:31,621 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2445 [2021-03-26 10:36:31,622 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 74 flow [2021-03-26 10:36:31,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 191.75) internal successors, (767), 4 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:31,623 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:31,623 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:31,623 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-26 10:36:31,623 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:31,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:31,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1830277069, now seen corresponding path program 1 times [2021-03-26 10:36:31,624 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:31,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128164706] [2021-03-26 10:36:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:31,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:31,769 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:31,776 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:31,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:36:31,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:31,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128164706] [2021-03-26 10:36:31,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:31,786 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:36:31,786 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534563952] [2021-03-26 10:36:31,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:36:31,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:31,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:36:31,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:36:31,790 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 216 [2021-03-26 10:36:31,790 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:31,791 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:31,791 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 216 [2021-03-26 10:36:31,791 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:31,813 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:36:31,814 INFO L130 PetriNetUnfolder]: For 18/20 co-relation queries the response was YES. [2021-03-26 10:36:31,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 51 conditions, 24 events. 0/24 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:36:31,814 INFO L132 encePairwiseOnDemand]: 212/216 looper letters, 1 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-26 10:36:31,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 24 transitions, 82 flow [2021-03-26 10:36:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:36:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:36:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 789 transitions. [2021-03-26 10:36:31,817 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9131944444444444 [2021-03-26 10:36:31,817 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 789 transitions. [2021-03-26 10:36:31,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 789 transitions. [2021-03-26 10:36:31,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:31,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 789 transitions. [2021-03-26 10:36:31,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.25) internal successors, (789), 4 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:31,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:31,821 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:31,821 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 74 flow. Second operand 4 states and 789 transitions. [2021-03-26 10:36:31,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 24 transitions, 82 flow [2021-03-26 10:36:31,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 24 transitions, 70 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-26 10:36:31,822 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 72 flow [2021-03-26 10:36:31,822 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2021-03-26 10:36:31,823 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -19 predicate places. [2021-03-26 10:36:31,823 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:31,823 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 24 transitions, 72 flow [2021-03-26 10:36:31,823 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 24 transitions, 72 flow [2021-03-26 10:36:31,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 24 transitions, 72 flow [2021-03-26 10:36:31,828 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-26 10:36:31,828 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-26 10:36:31,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 24 events. 0/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-26 10:36:31,829 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-26 10:36:32,502 WARN L205 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 167 [2021-03-26 10:36:32,810 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-26 10:36:33,524 WARN L205 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 167 [2021-03-26 10:36:33,840 WARN L205 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2021-03-26 10:36:33,844 INFO L154 LiptonReduction]: Checked pairs total: 430 [2021-03-26 10:36:33,844 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:36:33,844 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2021 [2021-03-26 10:36:33,845 INFO L480 AbstractCegarLoop]: Abstraction has has 37 places, 23 transitions, 68 flow [2021-03-26 10:36:33,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 196.75) internal successors, (787), 4 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:33,846 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:33,846 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:33,846 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-26 10:36:33,846 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:33,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:33,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1957787217, now seen corresponding path program 1 times [2021-03-26 10:36:33,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:33,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361098578] [2021-03-26 10:36:33,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:34,014 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,015 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:36:34,019 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,020 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:36:34,040 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-26 10:36:34,048 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,050 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-26 10:36:34,069 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,070 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-03-26 10:36:34,083 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,084 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-26 10:36:34,096 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:36:34,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:34,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361098578] [2021-03-26 10:36:34,108 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:34,108 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:36:34,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153668703] [2021-03-26 10:36:34,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:36:34,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:34,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:36:34,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:36:34,111 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 217 [2021-03-26 10:36:34,112 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 23 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 139.14285714285714) internal successors, (974), 7 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,112 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:34,112 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 217 [2021-03-26 10:36:34,112 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:34,240 INFO L129 PetriNetUnfolder]: 68/157 cut-off events. [2021-03-26 10:36:34,240 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2021-03-26 10:36:34,241 INFO L84 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 157 events. 68/157 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 598 event pairs, 20 based on Foata normal form. 1/156 useless extension candidates. Maximal degree in co-relation 354. Up to 109 conditions per place. [2021-03-26 10:36:34,242 INFO L132 encePairwiseOnDemand]: 213/217 looper letters, 13 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2021-03-26 10:36:34,242 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 28 transitions, 113 flow [2021-03-26 10:36:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-26 10:36:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-26 10:36:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2021-03-26 10:36:34,245 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6620583717357911 [2021-03-26 10:36:34,245 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2021-03-26 10:36:34,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2021-03-26 10:36:34,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:34,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2021-03-26 10:36:34,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,248 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,248 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,248 INFO L185 Difference]: Start difference. First operand has 37 places, 23 transitions, 68 flow. Second operand 3 states and 431 transitions. [2021-03-26 10:36:34,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 28 transitions, 113 flow [2021-03-26 10:36:34,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 107 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-26 10:36:34,250 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 83 flow [2021-03-26 10:36:34,250 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=217, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2021-03-26 10:36:34,250 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -20 predicate places. [2021-03-26 10:36:34,250 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:34,250 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 83 flow [2021-03-26 10:36:34,250 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 83 flow [2021-03-26 10:36:34,251 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 83 flow [2021-03-26 10:36:34,256 INFO L129 PetriNetUnfolder]: 3/33 cut-off events. [2021-03-26 10:36:34,256 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-26 10:36:34,257 INFO L84 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 33 events. 3/33 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 1 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 57. Up to 10 conditions per place. [2021-03-26 10:36:34,257 INFO L142 LiptonReduction]: Number of co-enabled transitions 250 [2021-03-26 10:36:34,289 INFO L154 LiptonReduction]: Checked pairs total: 378 [2021-03-26 10:36:34,290 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:36:34,290 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-26 10:36:34,291 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 85 flow [2021-03-26 10:36:34,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 139.14285714285714) internal successors, (974), 7 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,291 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:34,291 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:34,291 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-26 10:36:34,292 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:34,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:34,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1467412338, now seen corresponding path program 1 times [2021-03-26 10:36:34,292 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:34,292 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395763086] [2021-03-26 10:36:34,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:34,366 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,367 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:36:34,374 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,375 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-26 10:36:34,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:36:34,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-03-26 10:36:34,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395763086] [2021-03-26 10:36:34,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:34,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-26 10:36:34,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191270062] [2021-03-26 10:36:34,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:36:34,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:34,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:36:34,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:36:34,388 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 218 [2021-03-26 10:36:34,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:34,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 218 [2021-03-26 10:36:34,389 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:34,519 INFO L129 PetriNetUnfolder]: 90/200 cut-off events. [2021-03-26 10:36:34,519 INFO L130 PetriNetUnfolder]: For 74/74 co-relation queries the response was YES. [2021-03-26 10:36:34,521 INFO L84 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 200 events. 90/200 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 790 event pairs, 41 based on Foata normal form. 3/203 useless extension candidates. Maximal degree in co-relation 483. Up to 143 conditions per place. [2021-03-26 10:36:34,523 INFO L132 encePairwiseOnDemand]: 208/218 looper letters, 10 selfloop transitions, 9 changer transitions 0/31 dead transitions. [2021-03-26 10:36:34,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 31 transitions, 138 flow [2021-03-26 10:36:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:36:34,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:36:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 679 transitions. [2021-03-26 10:36:34,526 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7786697247706422 [2021-03-26 10:36:34,526 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 679 transitions. [2021-03-26 10:36:34,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 679 transitions. [2021-03-26 10:36:34,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:34,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 679 transitions. [2021-03-26 10:36:34,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,531 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,531 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 85 flow. Second operand 4 states and 679 transitions. [2021-03-26 10:36:34,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 31 transitions, 138 flow [2021-03-26 10:36:34,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:36:34,533 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 137 flow [2021-03-26 10:36:34,534 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-26 10:36:34,534 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -17 predicate places. [2021-03-26 10:36:34,534 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:34,534 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 137 flow [2021-03-26 10:36:34,534 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 137 flow [2021-03-26 10:36:34,535 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 137 flow [2021-03-26 10:36:34,571 INFO L129 PetriNetUnfolder]: 84/196 cut-off events. [2021-03-26 10:36:34,571 INFO L130 PetriNetUnfolder]: For 96/98 co-relation queries the response was YES. [2021-03-26 10:36:34,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 196 events. 84/196 cut-off events. For 96/98 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 861 event pairs, 35 based on Foata normal form. 2/193 useless extension candidates. Maximal degree in co-relation 474. Up to 129 conditions per place. [2021-03-26 10:36:34,573 INFO L142 LiptonReduction]: Number of co-enabled transitions 262 [2021-03-26 10:36:34,586 INFO L154 LiptonReduction]: Checked pairs total: 102 [2021-03-26 10:36:34,587 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:36:34,587 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 53 [2021-03-26 10:36:34,593 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 31 transitions, 137 flow [2021-03-26 10:36:34,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,594 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:34,594 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:34,594 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-26 10:36:34,594 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:34,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:34,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1401917902, now seen corresponding path program 1 times [2021-03-26 10:36:34,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:34,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600916710] [2021-03-26 10:36:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:34,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:34,740 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-26 10:36:34,742 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-26 10:36:34,777 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-26 10:36:34,779 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-26 10:36:34,809 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.7 percent of original size [2021-03-26 10:36:34,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 43 [2021-03-26 10:36:34,838 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:34,839 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-26 10:36:34,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:34,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600916710] [2021-03-26 10:36:34,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:34,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:36:34,848 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214914098] [2021-03-26 10:36:34,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:36:34,848 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:34,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:36:34,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:36:34,849 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 218 [2021-03-26 10:36:34,850 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 31 transitions, 137 flow. Second operand has 6 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:34,850 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:34,851 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 218 [2021-03-26 10:36:34,851 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:35,011 INFO L129 PetriNetUnfolder]: 102/227 cut-off events. [2021-03-26 10:36:35,011 INFO L130 PetriNetUnfolder]: For 155/159 co-relation queries the response was YES. [2021-03-26 10:36:35,012 INFO L84 FinitePrefix]: Finished finitePrefix Result has 752 conditions, 227 events. 102/227 cut-off events. For 155/159 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 949 event pairs, 41 based on Foata normal form. 7/234 useless extension candidates. Maximal degree in co-relation 738. Up to 156 conditions per place. [2021-03-26 10:36:35,013 INFO L132 encePairwiseOnDemand]: 210/218 looper letters, 14 selfloop transitions, 11 changer transitions 0/37 dead transitions. [2021-03-26 10:36:35,013 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 37 transitions, 214 flow [2021-03-26 10:36:35,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:36:35,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:36:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 651 transitions. [2021-03-26 10:36:35,017 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7465596330275229 [2021-03-26 10:36:35,017 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 651 transitions. [2021-03-26 10:36:35,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 651 transitions. [2021-03-26 10:36:35,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:35,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 651 transitions. [2021-03-26 10:36:35,018 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:35,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:35,024 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 218.0) internal successors, (1090), 5 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:35,024 INFO L185 Difference]: Start difference. First operand has 41 places, 31 transitions, 137 flow. Second operand 4 states and 651 transitions. [2021-03-26 10:36:35,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 37 transitions, 214 flow [2021-03-26 10:36:35,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 202 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-26 10:36:35,026 INFO L241 Difference]: Finished difference. Result has 43 places, 35 transitions, 185 flow [2021-03-26 10:36:35,027 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=185, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2021-03-26 10:36:35,027 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -15 predicate places. [2021-03-26 10:36:35,027 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:35,027 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 35 transitions, 185 flow [2021-03-26 10:36:35,027 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 35 transitions, 185 flow [2021-03-26 10:36:35,028 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 35 transitions, 185 flow [2021-03-26 10:36:35,096 INFO L129 PetriNetUnfolder]: 96/223 cut-off events. [2021-03-26 10:36:35,096 INFO L130 PetriNetUnfolder]: For 198/200 co-relation queries the response was YES. [2021-03-26 10:36:35,097 INFO L84 FinitePrefix]: Finished finitePrefix Result has 657 conditions, 223 events. 96/223 cut-off events. For 198/200 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 998 event pairs, 39 based on Foata normal form. 2/215 useless extension candidates. Maximal degree in co-relation 644. Up to 150 conditions per place. [2021-03-26 10:36:35,098 INFO L142 LiptonReduction]: Number of co-enabled transitions 296 [2021-03-26 10:36:35,110 INFO L154 LiptonReduction]: Checked pairs total: 155 [2021-03-26 10:36:35,110 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:36:35,110 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 83 [2021-03-26 10:36:35,112 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 185 flow [2021-03-26 10:36:35,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 159.33333333333334) internal successors, (956), 6 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:35,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:35,113 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:35,113 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-26 10:36:35,113 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1023712284, now seen corresponding path program 2 times [2021-03-26 10:36:35,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:35,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028785453] [2021-03-26 10:36:35,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:35,236 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.4 percent of original size [2021-03-26 10:36:35,240 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-03-26 10:36:35,289 INFO L142 QuantifierPusher]: treesize reduction 9, result has 83.3 percent of original size [2021-03-26 10:36:35,293 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:36:35,335 INFO L142 QuantifierPusher]: treesize reduction 9, result has 85.2 percent of original size [2021-03-26 10:36:35,338 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 10:36:35,387 INFO L142 QuantifierPusher]: treesize reduction 9, result has 86.4 percent of original size [2021-03-26 10:36:35,390 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 57 [2021-03-26 10:36:35,444 INFO L142 QuantifierPusher]: treesize reduction 8, result has 75.8 percent of original size [2021-03-26 10:36:35,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-26 10:36:35,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:35,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028785453] [2021-03-26 10:36:35,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:35,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:36:35,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121926428] [2021-03-26 10:36:35,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:36:35,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:35,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:36:35,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:36:35,468 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 218 [2021-03-26 10:36:35,468 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 185 flow. Second operand has 7 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 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-03-26 10:36:35,469 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:35,469 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 218 [2021-03-26 10:36:35,469 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:35,761 INFO L129 PetriNetUnfolder]: 135/331 cut-off events. [2021-03-26 10:36:35,762 INFO L130 PetriNetUnfolder]: For 371/383 co-relation queries the response was YES. [2021-03-26 10:36:35,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 331 events. 135/331 cut-off events. For 371/383 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1802 event pairs, 16 based on Foata normal form. 6/337 useless extension candidates. Maximal degree in co-relation 1181. Up to 210 conditions per place. [2021-03-26 10:36:35,765 INFO L132 encePairwiseOnDemand]: 208/218 looper letters, 29 selfloop transitions, 18 changer transitions 0/59 dead transitions. [2021-03-26 10:36:35,765 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 59 transitions, 435 flow [2021-03-26 10:36:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-26 10:36:35,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-26 10:36:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 951 transitions. [2021-03-26 10:36:35,769 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7270642201834863 [2021-03-26 10:36:35,769 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 951 transitions. [2021-03-26 10:36:35,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 951 transitions. [2021-03-26 10:36:35,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:35,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 951 transitions. [2021-03-26 10:36:35,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 158.5) internal successors, (951), 6 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:35,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:35,774 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 218.0) internal successors, (1526), 7 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:35,774 INFO L185 Difference]: Start difference. First operand has 43 places, 35 transitions, 185 flow. Second operand 6 states and 951 transitions. [2021-03-26 10:36:35,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 59 transitions, 435 flow [2021-03-26 10:36:35,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 410 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-26 10:36:35,777 INFO L241 Difference]: Finished difference. Result has 49 places, 50 transitions, 364 flow [2021-03-26 10:36:35,777 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=218, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=364, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2021-03-26 10:36:35,777 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -9 predicate places. [2021-03-26 10:36:35,777 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:35,778 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 50 transitions, 364 flow [2021-03-26 10:36:35,778 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 50 transitions, 364 flow [2021-03-26 10:36:35,778 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 50 transitions, 364 flow [2021-03-26 10:36:35,828 INFO L129 PetriNetUnfolder]: 129/302 cut-off events. [2021-03-26 10:36:35,829 INFO L130 PetriNetUnfolder]: For 586/597 co-relation queries the response was YES. [2021-03-26 10:36:35,830 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1110 conditions, 302 events. 129/302 cut-off events. For 586/597 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1526 event pairs, 28 based on Foata normal form. 3/297 useless extension candidates. Maximal degree in co-relation 1094. Up to 204 conditions per place. [2021-03-26 10:36:35,832 INFO L142 LiptonReduction]: Number of co-enabled transitions 406 [2021-03-26 10:36:35,900 INFO L154 LiptonReduction]: Checked pairs total: 772 [2021-03-26 10:36:35,901 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-26 10:36:35,901 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 124 [2021-03-26 10:36:35,902 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 366 flow [2021-03-26 10:36:35,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 154.14285714285714) internal successors, (1079), 7 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-03-26 10:36:35,902 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:35,902 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:35,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-26 10:36:35,902 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:35,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:35,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1141042781, now seen corresponding path program 1 times [2021-03-26 10:36:35,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:35,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161250231] [2021-03-26 10:36:35,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:35,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:35,988 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:35,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:35,993 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:36:35,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:36:36,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:36,004 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:36:36,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:36,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161250231] [2021-03-26 10:36:36,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:36,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:36:36,004 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407058718] [2021-03-26 10:36:36,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:36:36,005 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:36,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:36:36,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:36:36,006 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 219 [2021-03-26 10:36:36,007 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 366 flow. Second operand has 4 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,007 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:36,007 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 219 [2021-03-26 10:36:36,007 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:36,237 INFO L129 PetriNetUnfolder]: 712/1260 cut-off events. [2021-03-26 10:36:36,237 INFO L130 PetriNetUnfolder]: For 2133/2639 co-relation queries the response was YES. [2021-03-26 10:36:36,244 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4069 conditions, 1260 events. 712/1260 cut-off events. For 2133/2639 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 7955 event pairs, 274 based on Foata normal form. 183/1299 useless extension candidates. Maximal degree in co-relation 4051. Up to 653 conditions per place. [2021-03-26 10:36:36,252 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 11 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2021-03-26 10:36:36,252 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 434 flow [2021-03-26 10:36:36,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:36:36,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:36:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 967 transitions. [2021-03-26 10:36:36,256 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8831050228310502 [2021-03-26 10:36:36,256 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 967 transitions. [2021-03-26 10:36:36,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 967 transitions. [2021-03-26 10:36:36,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:36,257 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 967 transitions. [2021-03-26 10:36:36,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 193.4) internal successors, (967), 5 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,262 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,262 INFO L185 Difference]: Start difference. First operand has 49 places, 50 transitions, 366 flow. Second operand 5 states and 967 transitions. [2021-03-26 10:36:36,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 434 flow [2021-03-26 10:36:36,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 63 transitions, 420 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-26 10:36:36,272 INFO L241 Difference]: Finished difference. Result has 55 places, 59 transitions, 431 flow [2021-03-26 10:36:36,273 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=431, PETRI_PLACES=55, PETRI_TRANSITIONS=59} [2021-03-26 10:36:36,273 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, -3 predicate places. [2021-03-26 10:36:36,273 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:36,273 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 59 transitions, 431 flow [2021-03-26 10:36:36,273 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 59 transitions, 431 flow [2021-03-26 10:36:36,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 59 transitions, 431 flow [2021-03-26 10:36:36,462 INFO L129 PetriNetUnfolder]: 740/1310 cut-off events. [2021-03-26 10:36:36,462 INFO L130 PetriNetUnfolder]: For 2655/2884 co-relation queries the response was YES. [2021-03-26 10:36:36,469 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4779 conditions, 1310 events. 740/1310 cut-off events. For 2655/2884 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 8340 event pairs, 288 based on Foata normal form. 19/1185 useless extension candidates. Maximal degree in co-relation 4759. Up to 759 conditions per place. [2021-03-26 10:36:36,482 INFO L142 LiptonReduction]: Number of co-enabled transitions 692 [2021-03-26 10:36:36,615 INFO L154 LiptonReduction]: Checked pairs total: 240 [2021-03-26 10:36:36,616 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:36:36,616 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 343 [2021-03-26 10:36:36,616 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 59 transitions, 431 flow [2021-03-26 10:36:36,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 189.75) internal successors, (759), 4 states have internal predecessors, (759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,617 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:36,617 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:36,617 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-26 10:36:36,617 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:36,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash 696853483, now seen corresponding path program 1 times [2021-03-26 10:36:36,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:36,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263137568] [2021-03-26 10:36:36,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:36,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:36,694 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:36,697 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:36,697 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:36,703 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:36:36,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:36:36,711 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:36,711 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:36:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:36,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263137568] [2021-03-26 10:36:36,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:36,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-26 10:36:36,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726248727] [2021-03-26 10:36:36,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-26 10:36:36,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:36,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-26 10:36:36,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-26 10:36:36,714 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 219 [2021-03-26 10:36:36,714 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 59 transitions, 431 flow. Second operand has 5 states, 5 states have (on average 189.8) internal successors, (949), 5 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,715 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:36,715 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 219 [2021-03-26 10:36:36,715 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:36,918 INFO L129 PetriNetUnfolder]: 474/947 cut-off events. [2021-03-26 10:36:36,918 INFO L130 PetriNetUnfolder]: For 2970/5340 co-relation queries the response was YES. [2021-03-26 10:36:36,923 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3997 conditions, 947 events. 474/947 cut-off events. For 2970/5340 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 6234 event pairs, 85 based on Foata normal form. 364/1218 useless extension candidates. Maximal degree in co-relation 3975. Up to 570 conditions per place. [2021-03-26 10:36:36,929 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 11 selfloop transitions, 19 changer transitions 0/72 dead transitions. [2021-03-26 10:36:36,929 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 567 flow [2021-03-26 10:36:36,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-26 10:36:36,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-26 10:36:36,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1354 transitions. [2021-03-26 10:36:36,934 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.883235485975212 [2021-03-26 10:36:36,934 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1354 transitions. [2021-03-26 10:36:36,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1354 transitions. [2021-03-26 10:36:36,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:36,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1354 transitions. [2021-03-26 10:36:36,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 193.42857142857142) internal successors, (1354), 7 states have internal predecessors, (1354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,940 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:36,940 INFO L185 Difference]: Start difference. First operand has 55 places, 59 transitions, 431 flow. Second operand 7 states and 1354 transitions. [2021-03-26 10:36:36,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 567 flow [2021-03-26 10:36:36,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:36:36,947 INFO L241 Difference]: Finished difference. Result has 63 places, 68 transitions, 564 flow [2021-03-26 10:36:36,947 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=564, PETRI_PLACES=63, PETRI_TRANSITIONS=68} [2021-03-26 10:36:36,947 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 5 predicate places. [2021-03-26 10:36:36,947 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:36,947 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 63 places, 68 transitions, 564 flow [2021-03-26 10:36:36,948 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 63 places, 68 transitions, 564 flow [2021-03-26 10:36:36,948 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 63 places, 68 transitions, 564 flow [2021-03-26 10:36:37,063 INFO L129 PetriNetUnfolder]: 516/1029 cut-off events. [2021-03-26 10:36:37,064 INFO L130 PetriNetUnfolder]: For 4032/4953 co-relation queries the response was YES. [2021-03-26 10:36:37,071 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4944 conditions, 1029 events. 516/1029 cut-off events. For 4032/4953 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 6878 event pairs, 89 based on Foata normal form. 44/986 useless extension candidates. Maximal degree in co-relation 4920. Up to 631 conditions per place. [2021-03-26 10:36:37,082 INFO L142 LiptonReduction]: Number of co-enabled transitions 920 [2021-03-26 10:36:37,116 INFO L154 LiptonReduction]: Checked pairs total: 318 [2021-03-26 10:36:37,116 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:36:37,116 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 169 [2021-03-26 10:36:37,117 INFO L480 AbstractCegarLoop]: Abstraction has has 63 places, 68 transitions, 564 flow [2021-03-26 10:36:37,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 189.8) internal successors, (949), 5 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,117 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:37,117 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:37,117 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-26 10:36:37,117 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:37,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:37,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1177637068, now seen corresponding path program 1 times [2021-03-26 10:36:37,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:37,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937334865] [2021-03-26 10:36:37,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:37,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:37,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:37,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:37,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:37,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:37,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:37,261 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:36:37,262 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:36:37,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:37,271 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:36:37,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-03-26 10:36:37,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937334865] [2021-03-26 10:36:37,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:37,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:36:37,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456103372] [2021-03-26 10:36:37,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-26 10:36:37,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:37,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-26 10:36:37,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-26 10:36:37,274 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 219 [2021-03-26 10:36:37,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 68 transitions, 564 flow. Second operand has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:37,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 219 [2021-03-26 10:36:37,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:37,478 INFO L129 PetriNetUnfolder]: 318/712 cut-off events. [2021-03-26 10:36:37,479 INFO L130 PetriNetUnfolder]: For 4669/8594 co-relation queries the response was YES. [2021-03-26 10:36:37,484 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3860 conditions, 712 events. 318/712 cut-off events. For 4669/8594 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 4759 event pairs, 15 based on Foata normal form. 469/1115 useless extension candidates. Maximal degree in co-relation 3834. Up to 519 conditions per place. [2021-03-26 10:36:37,488 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 7 selfloop transitions, 28 changer transitions 4/78 dead transitions. [2021-03-26 10:36:37,488 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 78 transitions, 741 flow [2021-03-26 10:36:37,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-26 10:36:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-26 10:36:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1741 transitions. [2021-03-26 10:36:37,493 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8833079654997463 [2021-03-26 10:36:37,493 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1741 transitions. [2021-03-26 10:36:37,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1741 transitions. [2021-03-26 10:36:37,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:37,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1741 transitions. [2021-03-26 10:36:37,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 193.44444444444446) internal successors, (1741), 9 states have internal predecessors, (1741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,502 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,502 INFO L185 Difference]: Start difference. First operand has 63 places, 68 transitions, 564 flow. Second operand 9 states and 1741 transitions. [2021-03-26 10:36:37,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 78 transitions, 741 flow [2021-03-26 10:36:37,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 78 transitions, 685 flow, removed 20 selfloop flow, removed 3 redundant places. [2021-03-26 10:36:37,516 INFO L241 Difference]: Finished difference. Result has 71 places, 74 transitions, 663 flow [2021-03-26 10:36:37,517 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=663, PETRI_PLACES=71, PETRI_TRANSITIONS=74} [2021-03-26 10:36:37,517 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2021-03-26 10:36:37,517 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:37,517 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 74 transitions, 663 flow [2021-03-26 10:36:37,517 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 74 transitions, 663 flow [2021-03-26 10:36:37,518 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 74 transitions, 663 flow [2021-03-26 10:36:37,596 INFO L129 PetriNetUnfolder]: 331/758 cut-off events. [2021-03-26 10:36:37,596 INFO L130 PetriNetUnfolder]: For 4099/4336 co-relation queries the response was YES. [2021-03-26 10:36:37,602 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 758 events. 331/758 cut-off events. For 4099/4336 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 5352 event pairs, 18 based on Foata normal form. 27/720 useless extension candidates. Maximal degree in co-relation 3769. Up to 389 conditions per place. [2021-03-26 10:36:37,610 INFO L142 LiptonReduction]: Number of co-enabled transitions 994 [2021-03-26 10:36:37,625 INFO L154 LiptonReduction]: Checked pairs total: 275 [2021-03-26 10:36:37,625 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:36:37,625 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 108 [2021-03-26 10:36:37,627 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 74 transitions, 663 flow [2021-03-26 10:36:37,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 189.83333333333334) internal successors, (1139), 6 states have internal predecessors, (1139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,627 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:37,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] [2021-03-26 10:36:37,627 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-26 10:36:37,628 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:37,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1300961202, now seen corresponding path program 1 times [2021-03-26 10:36:37,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:37,628 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516415691] [2021-03-26 10:36:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:37,673 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:37,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:36:37,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:37,674 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:37,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:37,678 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:37,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516415691] [2021-03-26 10:36:37,682 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:37,682 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-26 10:36:37,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541299591] [2021-03-26 10:36:37,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-26 10:36:37,683 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-26 10:36:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-26 10:36:37,684 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 219 [2021-03-26 10:36:37,685 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 74 transitions, 663 flow. Second operand has 4 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,685 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:37,685 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 219 [2021-03-26 10:36:37,685 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:37,865 INFO L129 PetriNetUnfolder]: 588/1342 cut-off events. [2021-03-26 10:36:37,865 INFO L130 PetriNetUnfolder]: For 8316/9533 co-relation queries the response was YES. [2021-03-26 10:36:37,874 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6797 conditions, 1342 events. 588/1342 cut-off events. For 8316/9533 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 10693 event pairs, 25 based on Foata normal form. 79/1267 useless extension candidates. Maximal degree in co-relation 6768. Up to 710 conditions per place. [2021-03-26 10:36:37,881 INFO L132 encePairwiseOnDemand]: 216/219 looper letters, 12 selfloop transitions, 2 changer transitions 0/79 dead transitions. [2021-03-26 10:36:37,882 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 79 transitions, 737 flow [2021-03-26 10:36:37,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-26 10:36:37,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-26 10:36:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 772 transitions. [2021-03-26 10:36:37,885 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8812785388127854 [2021-03-26 10:36:37,885 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 772 transitions. [2021-03-26 10:36:37,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 772 transitions. [2021-03-26 10:36:37,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:37,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 772 transitions. [2021-03-26 10:36:37,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,889 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:37,889 INFO L185 Difference]: Start difference. First operand has 71 places, 74 transitions, 663 flow. Second operand 4 states and 772 transitions. [2021-03-26 10:36:37,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 79 transitions, 737 flow [2021-03-26 10:36:37,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 79 transitions, 640 flow, removed 34 selfloop flow, removed 4 redundant places. [2021-03-26 10:36:37,960 INFO L241 Difference]: Finished difference. Result has 72 places, 75 transitions, 581 flow [2021-03-26 10:36:37,960 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=581, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2021-03-26 10:36:37,960 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2021-03-26 10:36:37,960 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:37,960 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 75 transitions, 581 flow [2021-03-26 10:36:37,961 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 75 transitions, 581 flow [2021-03-26 10:36:37,961 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 72 places, 75 transitions, 581 flow [2021-03-26 10:36:38,079 INFO L129 PetriNetUnfolder]: 580/1311 cut-off events. [2021-03-26 10:36:38,079 INFO L130 PetriNetUnfolder]: For 4283/4514 co-relation queries the response was YES. [2021-03-26 10:36:38,087 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4937 conditions, 1311 events. 580/1311 cut-off events. For 4283/4514 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 10575 event pairs, 30 based on Foata normal form. 41/1233 useless extension candidates. Maximal degree in co-relation 4908. Up to 344 conditions per place. [2021-03-26 10:36:38,101 INFO L142 LiptonReduction]: Number of co-enabled transitions 1008 [2021-03-26 10:36:38,112 INFO L154 LiptonReduction]: Checked pairs total: 0 [2021-03-26 10:36:38,112 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-26 10:36:38,112 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 152 [2021-03-26 10:36:38,115 INFO L480 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 581 flow [2021-03-26 10:36:38,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:38,115 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:38,115 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-26 10:36:38,116 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-26 10:36:38,116 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:38,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1598920094, now seen corresponding path program 2 times [2021-03-26 10:36:38,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:38,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558825103] [2021-03-26 10:36:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:38,264 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.0 percent of original size [2021-03-26 10:36:38,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 48 [2021-03-26 10:36:38,305 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.8 percent of original size [2021-03-26 10:36:38,308 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 45 [2021-03-26 10:36:38,346 INFO L142 QuantifierPusher]: treesize reduction 1, result has 98.1 percent of original size [2021-03-26 10:36:38,348 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 52 [2021-03-26 10:36:38,395 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.9 percent of original size [2021-03-26 10:36:38,397 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 46 [2021-03-26 10:36:38,439 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:38,439 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-26 10:36:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:38,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558825103] [2021-03-26 10:36:38,457 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:38,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-26 10:36:38,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445624761] [2021-03-26 10:36:38,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:36:38,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:38,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:36:38,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:36:38,459 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 219 [2021-03-26 10:36:38,460 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 581 flow. Second operand has 7 states, 7 states have (on average 155.28571428571428) internal successors, (1087), 7 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:38,460 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:38,460 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 219 [2021-03-26 10:36:38,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:38,904 INFO L129 PetriNetUnfolder]: 1074/2329 cut-off events. [2021-03-26 10:36:38,904 INFO L130 PetriNetUnfolder]: For 9639/10393 co-relation queries the response was YES. [2021-03-26 10:36:38,920 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9167 conditions, 2329 events. 1074/2329 cut-off events. For 9639/10393 co-relation queries the response was YES. Maximal size of possible extension queue 471. Compared 20052 event pairs, 20 based on Foata normal form. 112/2160 useless extension candidates. Maximal degree in co-relation 9136. Up to 691 conditions per place. [2021-03-26 10:36:38,928 INFO L132 encePairwiseOnDemand]: 210/219 looper letters, 22 selfloop transitions, 17 changer transitions 4/83 dead transitions. [2021-03-26 10:36:38,928 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 83 transitions, 743 flow [2021-03-26 10:36:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-26 10:36:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-26 10:36:38,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 794 transitions. [2021-03-26 10:36:38,932 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7251141552511415 [2021-03-26 10:36:38,932 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 794 transitions. [2021-03-26 10:36:38,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 794 transitions. [2021-03-26 10:36:38,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:38,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 794 transitions. [2021-03-26 10:36:38,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.8) internal successors, (794), 5 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:38,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:38,937 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:38,937 INFO L185 Difference]: Start difference. First operand has 72 places, 75 transitions, 581 flow. Second operand 5 states and 794 transitions. [2021-03-26 10:36:38,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 83 transitions, 743 flow [2021-03-26 10:36:39,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 83 transitions, 742 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-26 10:36:39,052 INFO L241 Difference]: Finished difference. Result has 77 places, 75 transitions, 636 flow [2021-03-26 10:36:39,052 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=636, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2021-03-26 10:36:39,052 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2021-03-26 10:36:39,052 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:39,053 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 75 transitions, 636 flow [2021-03-26 10:36:39,053 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 75 transitions, 636 flow [2021-03-26 10:36:39,054 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 77 places, 75 transitions, 636 flow [2021-03-26 10:36:39,272 INFO L129 PetriNetUnfolder]: 1142/2454 cut-off events. [2021-03-26 10:36:39,272 INFO L130 PetriNetUnfolder]: For 8578/9077 co-relation queries the response was YES. [2021-03-26 10:36:39,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 9425 conditions, 2454 events. 1142/2454 cut-off events. For 8578/9077 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 21841 event pairs, 55 based on Foata normal form. 58/2255 useless extension candidates. Maximal degree in co-relation 9393. Up to 712 conditions per place. [2021-03-26 10:36:39,311 INFO L142 LiptonReduction]: Number of co-enabled transitions 1086 [2021-03-26 10:36:40,244 INFO L154 LiptonReduction]: Checked pairs total: 79 [2021-03-26 10:36:40,245 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-26 10:36:40,245 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1193 [2021-03-26 10:36:40,245 INFO L480 AbstractCegarLoop]: Abstraction has has 77 places, 72 transitions, 618 flow [2021-03-26 10:36:40,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 155.28571428571428) internal successors, (1087), 7 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:40,246 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:40,246 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-03-26 10:36:40,246 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-26 10:36:40,246 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1024193705, now seen corresponding path program 1 times [2021-03-26 10:36:40,247 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:40,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143835979] [2021-03-26 10:36:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-26 10:36:40,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:40,350 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:40,354 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:40,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:40,359 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:40,360 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:40,365 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:40,365 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-26 10:36:40,373 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-26 10:36:40,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-26 10:36:40,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-26 10:36:40,384 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-26 10:36:40,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-26 10:36:40,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143835979] [2021-03-26 10:36:40,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-26 10:36:40,385 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-26 10:36:40,385 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975828903] [2021-03-26 10:36:40,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-26 10:36:40,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-26 10:36:40,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-26 10:36:40,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-26 10:36:40,387 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 219 [2021-03-26 10:36:40,388 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 72 transitions, 618 flow. Second operand has 7 states, 7 states have (on average 189.85714285714286) internal successors, (1329), 7 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:40,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-26 10:36:40,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 219 [2021-03-26 10:36:40,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-26 10:36:40,580 INFO L129 PetriNetUnfolder]: 368/863 cut-off events. [2021-03-26 10:36:40,580 INFO L130 PetriNetUnfolder]: For 4489/5513 co-relation queries the response was YES. [2021-03-26 10:36:40,585 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4008 conditions, 863 events. 368/863 cut-off events. For 4489/5513 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 5815 event pairs, 3 based on Foata normal form. 369/1154 useless extension candidates. Maximal degree in co-relation 3974. Up to 399 conditions per place. [2021-03-26 10:36:40,587 INFO L132 encePairwiseOnDemand]: 212/219 looper letters, 2 selfloop transitions, 18 changer transitions 5/65 dead transitions. [2021-03-26 10:36:40,588 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 65 transitions, 634 flow [2021-03-26 10:36:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-26 10:36:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-26 10:36:40,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1538 transitions. [2021-03-26 10:36:40,592 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8778538812785388 [2021-03-26 10:36:40,592 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1538 transitions. [2021-03-26 10:36:40,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1538 transitions. [2021-03-26 10:36:40,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-26 10:36:40,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1538 transitions. [2021-03-26 10:36:40,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 192.25) internal successors, (1538), 8 states have internal predecessors, (1538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:40,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:40,612 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:40,613 INFO L185 Difference]: Start difference. First operand has 77 places, 72 transitions, 618 flow. Second operand 8 states and 1538 transitions. [2021-03-26 10:36:40,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 65 transitions, 634 flow [2021-03-26 10:36:40,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 533 flow, removed 36 selfloop flow, removed 10 redundant places. [2021-03-26 10:36:40,629 INFO L241 Difference]: Finished difference. Result has 71 places, 60 transitions, 497 flow [2021-03-26 10:36:40,629 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=497, PETRI_PLACES=71, PETRI_TRANSITIONS=60} [2021-03-26 10:36:40,629 INFO L343 CegarLoopForPetriNet]: 58 programPoint places, 13 predicate places. [2021-03-26 10:36:40,629 INFO L170 etLargeBlockEncoding]: Petri net LBE is using conditional semantic-based independence relation. [2021-03-26 10:36:40,629 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 60 transitions, 497 flow [2021-03-26 10:36:40,629 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 60 transitions, 497 flow [2021-03-26 10:36:40,630 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 60 transitions, 497 flow [2021-03-26 10:36:40,704 INFO L129 PetriNetUnfolder]: 340/840 cut-off events. [2021-03-26 10:36:40,705 INFO L130 PetriNetUnfolder]: For 2210/2425 co-relation queries the response was YES. [2021-03-26 10:36:40,709 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 840 events. 340/840 cut-off events. For 2210/2425 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 6023 event pairs, 10 based on Foata normal form. 12/798 useless extension candidates. Maximal degree in co-relation 3609. Up to 365 conditions per place. [2021-03-26 10:36:40,717 INFO L142 LiptonReduction]: Number of co-enabled transitions 564 [2021-03-26 10:36:40,899 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:36:41,003 WARN L205 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2021-03-26 10:36:41,224 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:36:41,445 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2021-03-26 10:36:43,226 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 308 DAG size of output: 256 [2021-03-26 10:36:43,637 WARN L205 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 232 [2021-03-26 10:36:48,850 WARN L205 SmtUtils]: Spent 5.21 s on a formula simplification. DAG size of input: 416 DAG size of output: 340 [2021-03-26 10:36:49,831 WARN L205 SmtUtils]: Spent 977.00 ms on a formula simplification that was a NOOP. DAG size: 313 [2021-03-26 10:36:49,839 INFO L154 LiptonReduction]: Checked pairs total: 29 [2021-03-26 10:36:49,840 INFO L156 LiptonReduction]: Total number of compositions: 4 [2021-03-26 10:36:49,840 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9211 [2021-03-26 10:36:49,840 INFO L480 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 497 flow [2021-03-26 10:36:49,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 189.85714285714286) internal successors, (1329), 7 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-26 10:36:49,841 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-26 10:36:49,841 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] [2021-03-26 10:36:49,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-26 10:36:49,841 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-26 10:36:49,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-26 10:36:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1899228651, now seen corresponding path program 1 times [2021-03-26 10:36:49,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-26 10:36:49,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704684193] [2021-03-26 10:36:49,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-26 10:36:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:36:49,921 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:36:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-26 10:36:49,994 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-26 10:36:50,040 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-26 10:36:50,040 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-26 10:36:50,040 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-26 10:36:50,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.03 10:36:50 BasicIcfg [2021-03-26 10:36:50,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-26 10:36:50,181 INFO L168 Benchmark]: Toolchain (without parser) took 61041.41 ms. Allocated memory was 255.9 MB in the beginning and 652.2 MB in the end (delta: 396.4 MB). Free memory was 233.6 MB in the beginning and 286.8 MB in the end (delta: -53.2 MB). Peak memory consumption was 342.7 MB. Max. memory is 16.0 GB. [2021-03-26 10:36:50,181 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-26 10:36:50,181 INFO L168 Benchmark]: CACSL2BoogieTranslator took 488.78 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 233.6 MB in the beginning and 323.7 MB in the end (delta: -90.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-26 10:36:50,181 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.14 ms. Allocated memory is still 364.9 MB. Free memory was 323.2 MB in the beginning and 320.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-26 10:36:50,182 INFO L168 Benchmark]: Boogie Preprocessor took 36.60 ms. Allocated memory is still 364.9 MB. Free memory was 320.5 MB in the beginning and 317.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:36:50,182 INFO L168 Benchmark]: RCFGBuilder took 2825.12 ms. Allocated memory was 364.9 MB in the beginning and 438.3 MB in the end (delta: 73.4 MB). Free memory was 317.4 MB in the beginning and 318.1 MB in the end (delta: -637.8 kB). Peak memory consumption was 110.4 MB. Max. memory is 16.0 GB. [2021-03-26 10:36:50,182 INFO L168 Benchmark]: TraceAbstraction took 57636.84 ms. Allocated memory was 438.3 MB in the beginning and 652.2 MB in the end (delta: 213.9 MB). Free memory was 318.1 MB in the beginning and 286.8 MB in the end (delta: 31.3 MB). Peak memory consumption was 245.2 MB. Max. memory is 16.0 GB. [2021-03-26 10:36:50,183 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.54 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 488.78 ms. Allocated memory was 255.9 MB in the beginning and 364.9 MB in the end (delta: 109.1 MB). Free memory was 233.6 MB in the beginning and 323.7 MB in the end (delta: -90.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 46.14 ms. Allocated memory is still 364.9 MB. Free memory was 323.2 MB in the beginning and 320.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 36.60 ms. Allocated memory is still 364.9 MB. Free memory was 320.5 MB in the beginning and 317.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2825.12 ms. Allocated memory was 364.9 MB in the beginning and 438.3 MB in the end (delta: 73.4 MB). Free memory was 317.4 MB in the beginning and 318.1 MB in the end (delta: -637.8 kB). Peak memory consumption was 110.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 57636.84 ms. Allocated memory was 438.3 MB in the beginning and 652.2 MB in the end (delta: 213.9 MB). Free memory was 318.1 MB in the beginning and 286.8 MB in the end (delta: 31.3 MB). Peak memory consumption was 245.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31920.3ms, 123 PlacesBefore, 58 PlacesAfterwards, 111 TransitionsBefore, 46 TransitionsAfterwards, 1430 CoEnabledTransitionPairs, 4 FixpointIterations, 38 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 68 TotalNumberOfCompositions, 1770 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 918, positive: 870, positive conditional: 870, positive unconditional: 0, negative: 48, negative conditional: 48, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 918, positive: 870, positive conditional: 0, positive unconditional: 870, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 918, positive: 870, positive conditional: 0, positive unconditional: 870, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 796, positive: 764, positive conditional: 0, positive unconditional: 764, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 796, positive: 761, positive conditional: 0, positive unconditional: 761, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 35, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , SemanticIndependenceRelation.Query Time [ms]: [ total: 10976, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 431, negative conditional: 0, negative unconditional: 431, unknown: 10536, unknown conditional: 0, unknown unconditional: 10536] ], Cache Queries: [ total: 918, positive: 106, positive conditional: 0, positive unconditional: 106, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 796, unknown conditional: 0, unknown unconditional: 796] , Statistics on independence cache: Total cache size (in pairs): 796, Positive cache size: 764, Positive conditional cache size: 0, Positive unconditional cache size: 764, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3795.3ms, 56 PlacesBefore, 38 PlacesAfterwards, 43 TransitionsBefore, 26 TransitionsAfterwards, 244 CoEnabledTransitionPairs, 5 FixpointIterations, 17 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 17 TotalNumberOfCompositions, 1275 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 352, positive: 262, positive conditional: 262, positive unconditional: 0, negative: 90, negative conditional: 90, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 352, positive: 262, positive conditional: 0, positive unconditional: 262, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 352, positive: 262, positive conditional: 0, positive unconditional: 262, negative: 90, negative conditional: 0, negative unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 42, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 42, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2145, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 2066, unknown conditional: 0, unknown unconditional: 2066] ], Cache Queries: [ total: 352, positive: 227, positive conditional: 0, positive unconditional: 227, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 42, unknown conditional: 0, unknown unconditional: 42] , Statistics on independence cache: Total cache size (in pairs): 838, Positive cache size: 799, Positive conditional cache size: 0, Positive unconditional cache size: 799, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2444.6ms, 41 PlacesBefore, 39 PlacesAfterwards, 26 TransitionsBefore, 24 TransitionsAfterwards, 234 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 699 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 118, positive: 67, positive conditional: 67, positive unconditional: 0, negative: 51, negative conditional: 51, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 118, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 118, positive: 67, positive conditional: 0, positive unconditional: 67, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 10, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1193, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 348, negative conditional: 0, negative unconditional: 348, unknown: 844, unknown conditional: 0, unknown unconditional: 844] ], Cache Queries: [ total: 118, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 14, unknown conditional: 0, unknown unconditional: 14] , Statistics on independence cache: Total cache size (in pairs): 852, Positive cache size: 803, Positive conditional cache size: 0, Positive unconditional cache size: 803, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 9 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2020.8ms, 39 PlacesBefore, 37 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 430 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 106, positive: 74, positive conditional: 74, positive unconditional: 0, negative: 32, negative conditional: 32, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 106, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 74, positive conditional: 0, positive unconditional: 74, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 11, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 106, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 11, unknown conditional: 0, unknown unconditional: 11] , Statistics on independence cache: Total cache size (in pairs): 863, Positive cache size: 814, Positive conditional cache size: 0, Positive unconditional cache size: 814, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.2ms, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 250 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 378 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 108, positive: 83, positive conditional: 83, positive unconditional: 0, negative: 25, negative conditional: 25, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 108, positive: 83, positive conditional: 1, positive unconditional: 82, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 83, positive conditional: 1, positive unconditional: 82, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14, positive: 14, positive conditional: 1, positive unconditional: 13, 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: 14, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 108, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 25, negative conditional: 0, negative unconditional: 25, unknown: 14, unknown conditional: 1, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 877, Positive cache size: 828, Positive conditional cache size: 1, Positive unconditional cache size: 827, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 52.5ms, 41 PlacesBefore, 41 PlacesAfterwards, 31 TransitionsBefore, 31 TransitionsAfterwards, 262 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 102 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 37, positive conditional: 37, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, positive: 37, positive conditional: 11, positive unconditional: 26, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 37, positive conditional: 11, positive unconditional: 26, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 18, positive: 18, positive conditional: 5, positive unconditional: 13, 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: 18, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ 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] ], Cache Queries: [ total: 42, positive: 19, positive conditional: 6, positive unconditional: 13, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 18, unknown conditional: 5, unknown unconditional: 13] , Statistics on independence cache: Total cache size (in pairs): 895, Positive cache size: 846, Positive conditional cache size: 6, Positive unconditional cache size: 840, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 82.4ms, 43 PlacesBefore, 43 PlacesAfterwards, 35 TransitionsBefore, 35 TransitionsAfterwards, 296 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 155 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 48, positive: 40, positive conditional: 40, positive unconditional: 0, negative: 8, negative conditional: 8, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 48, positive: 40, positive conditional: 7, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 40, positive conditional: 7, positive unconditional: 33, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7, positive: 7, positive conditional: 1, 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: 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: 48, positive: 33, positive conditional: 6, positive unconditional: 27, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 7, unknown conditional: 1, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 902, Positive cache size: 853, Positive conditional cache size: 7, Positive unconditional cache size: 846, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 123.0ms, 49 PlacesBefore, 49 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 406 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 772 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 296, positive: 272, positive conditional: 272, positive unconditional: 0, negative: 24, negative conditional: 24, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 296, positive: 272, positive conditional: 158, positive unconditional: 114, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 296, positive: 272, positive conditional: 158, positive unconditional: 114, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 5, 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: 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: 296, positive: 266, positive conditional: 153, positive unconditional: 113, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 6, unknown conditional: 5, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 908, Positive cache size: 859, Positive conditional cache size: 12, Positive unconditional cache size: 847, Negative cache size: 49, Negative conditional cache size: 0, Negative unconditional cache size: 49, Eliminated conditions: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 342.3ms, 55 PlacesBefore, 55 PlacesAfterwards, 59 TransitionsBefore, 59 TransitionsAfterwards, 692 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 240 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 40, positive: 35, positive conditional: 35, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 40, positive: 35, positive conditional: 25, positive unconditional: 10, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 35, positive conditional: 25, positive unconditional: 10, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 2, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 88, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 88, negative conditional: 88, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 35, positive conditional: 25, positive unconditional: 10, negative: 3, negative conditional: 3, negative unconditional: 0, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 910, Positive cache size: 859, Positive conditional cache size: 12, Positive unconditional cache size: 847, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 168.5ms, 63 PlacesBefore, 63 PlacesAfterwards, 68 TransitionsBefore, 68 TransitionsAfterwards, 920 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 318 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42, positive: 36, positive conditional: 36, positive unconditional: 0, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42, positive: 36, positive conditional: 24, positive unconditional: 12, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 36, positive conditional: 24, positive unconditional: 12, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 42, positive: 36, positive conditional: 24, positive unconditional: 12, negative: 6, negative conditional: 6, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 910, Positive cache size: 859, Positive conditional cache size: 12, Positive unconditional cache size: 847, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 107.8ms, 71 PlacesBefore, 71 PlacesAfterwards, 74 TransitionsBefore, 74 TransitionsAfterwards, 994 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 275 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 35, positive: 30, positive conditional: 30, positive unconditional: 0, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 35, positive: 30, positive conditional: 20, positive unconditional: 10, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 35, positive: 30, positive conditional: 20, positive unconditional: 10, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 35, positive: 30, positive conditional: 20, positive unconditional: 10, negative: 5, negative conditional: 5, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 910, Positive cache size: 859, Positive conditional cache size: 12, Positive unconditional cache size: 847, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 151.5ms, 72 PlacesBefore, 72 PlacesAfterwards, 75 TransitionsBefore, 75 TransitionsAfterwards, 1008 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 0 MoverChecksTotal, Independence Relation Statistics: 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: SemanticConditionEliminator.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] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 910, Positive cache size: 859, Positive conditional cache size: 12, Positive unconditional cache size: 847, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1191.6ms, 77 PlacesBefore, 77 PlacesAfterwards, 75 TransitionsBefore, 72 TransitionsAfterwards, 1086 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 79 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 79, positive: 79, positive conditional: 79, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 79, positive: 79, positive conditional: 77, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 79, positive: 79, positive conditional: 77, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 10, positive: 10, positive conditional: 9, 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: 10, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 79, positive: 69, positive conditional: 68, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 10, unknown conditional: 9, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 920, Positive cache size: 869, Positive conditional cache size: 21, Positive unconditional cache size: 848, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 2 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9210.3ms, 71 PlacesBefore, 67 PlacesAfterwards, 60 TransitionsBefore, 57 TransitionsAfterwards, 564 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 4 TotalNumberOfCompositions, 29 MoverChecksTotal, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 29, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29, positive: 29, positive conditional: 18, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29, positive: 29, positive conditional: 18, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, 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: 29, positive: 29, positive conditional: 18, positive unconditional: 11, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 920, Positive cache size: 869, Positive conditional cache size: 21, Positive unconditional cache size: 848, Negative cache size: 51, Negative conditional cache size: 2, Negative unconditional cache size: 49, Eliminated conditions: 11 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L854] 0 pthread_t t2225; [L855] FCALL, FORK 0 pthread_create(&t2225, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L856] 0 pthread_t t2226; [L857] FCALL, FORK 0 pthread_create(&t2226, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L858] 0 pthread_t t2227; [L859] FCALL, FORK 0 pthread_create(&t2227, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L860] 0 pthread_t t2228; [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] EXPR 1 \read(y) [L771] EXPR 1 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L771] 1 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L772] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L772] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)))) [L773] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L773] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)))) [L774] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L774] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L775] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L776] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L777] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (weak$$choice0 ? y$r_buff1_thd1 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd1 && y$w_buff1_used && !y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L778] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L779] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L780] EXPR 1 \read(y) [L780] 1 __unbuffered_p0_EAX = y [L781] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L781] 1 y = y$flush_delayed ? y$mem_tmp : y [L782] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=255, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=255, x=0, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 __unbuffered_p2_EAX = x [L812] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L861] FCALL, FORK 0 pthread_create(&t2228, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 \read(y) [L815] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L815] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L816] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L818] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L819] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L819] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L829] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=255, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 \read(y) [L832] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L832] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L833] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L833] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L834] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L834] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L835] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L835] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L836] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L836] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L790] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L792] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L4] COND FALSE 0 !(!cond) [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 \read(y) [L867] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L867] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L869] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L870] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L870] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L871] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L871] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L874] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 0 y$flush_delayed = weak$$choice2 [L877] EXPR 0 \read(y) [L877] 0 y$mem_tmp = y [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] EXPR 0 \read(y) [L878] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L879] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L879] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L879] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L879] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L880] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L880] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L880] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L880] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L881] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L881] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L881] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L881] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L882] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L882] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L883] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L883] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L883] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L884] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L884] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L885] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L886] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L886] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L887] EXPR 0 \read(y) [L887] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] EXPR 0 \read(y) [L888] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L888] 0 y = y$flush_delayed ? y$mem_tmp : y [L889] 0 y$flush_delayed = (_Bool)0 [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={7:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=0, x=1, y={7:0}, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 14.3ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 57366.7ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 2837.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 32000.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 52 SDslu, 21 SDs, 0 SdLazy, 419 SolverSat, 112 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 602.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 860.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=663occurred in iteration=10, InterpolantAutomatonStates: 66, 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: 62.3ms SsaConstructionTime, 810.7ms SatisfiabilityAnalysisTime, 1534.9ms InterpolantComputationTime, 267 NumberOfCodeBlocks, 267 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 232 ConstructedInterpolants, 0 QuantifiedInterpolants, 2187 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...