/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:32:26,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:32:26,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:32:26,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:32:26,667 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:32:26,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:32:26,672 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:32:26,677 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:32:26,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:32:26,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:32:26,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:32:26,686 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:32:26,686 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:32:26,688 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:32:26,689 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:32:26,690 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:32:26,692 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:32:26,693 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:32:26,695 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:32:26,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:32:26,703 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:32:26,704 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:32:26,705 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:32:26,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:32:26,712 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:32:26,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:32:26,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:32:26,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:32:26,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:32:26,716 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:32:26,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:32:26,717 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:32:26,718 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:32:26,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:32:26,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:32:26,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:32:26,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:32:26,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:32:26,721 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:32:26,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:32:26,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:32:26,725 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-RepeatedSemanticLbe.epf [2021-03-25 14:32:26,757 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:32:26,757 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:32:26,760 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:32:26,761 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:32:26,761 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:32:26,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:32:26,761 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:32:26,761 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:32:26,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:32:26,762 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:32:26,762 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:32:26,763 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:32:26,763 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:32:26,763 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:32:26,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:32:26,763 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:32:26,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:32:26,764 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:32:26,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:32:26,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:32:26,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:32:26,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:32:26,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:32:26,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:32:26,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:32:26,765 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:32:26,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:32:26,765 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:32:26,765 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:32:26,766 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-25 14:32:27,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:32:27,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:32:27,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:32:27,075 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:32:27,075 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:32:27,076 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2021-03-25 14:32:27,161 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a5930a0/e8f38b53a205440c8a51074cd8c7ed18/FLAG1338e8d1f [2021-03-25 14:32:27,648 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:32:27,648 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_power.opt.i [2021-03-25 14:32:27,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a5930a0/e8f38b53a205440c8a51074cd8c7ed18/FLAG1338e8d1f [2021-03-25 14:32:28,120 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a5930a0/e8f38b53a205440c8a51074cd8c7ed18 [2021-03-25 14:32:28,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:32:28,123 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:32:28,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:32:28,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:32:28,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:32:28,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@681ec50c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28, skipping insertion in model container [2021-03-25 14:32:28,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:32:28,165 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:32:28,308 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/mix042_power.opt.i[950,963] [2021-03-25 14:32:28,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:32:28,492 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:32:28,500 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/mix042_power.opt.i[950,963] [2021-03-25 14:32:28,534 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:32:28,601 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:32:28,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28 WrapperNode [2021-03-25 14:32:28,601 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:32:28,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:32:28,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:32:28,602 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:32:28,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,651 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:32:28,652 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:32:28,652 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:32:28,652 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:32:28,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,664 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (1/1) ... [2021-03-25 14:32:28,680 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:32:28,681 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:32:28,681 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:32:28,681 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:32:28,682 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (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-25 14:32:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:32:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:32:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:32:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:32:28,766 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:32:28,766 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:32:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:32:28,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:32:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:32:28,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:32:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:32:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:32:28,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:32:28,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:32:28,769 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-03-25 14:32:30,423 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:32:30,423 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:32:30,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:32:30 BoogieIcfgContainer [2021-03-25 14:32:30,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:32:30,427 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:32:30,427 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:32:30,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:32:30,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:32:28" (1/3) ... [2021-03-25 14:32:30,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0c8d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:32:30, skipping insertion in model container [2021-03-25 14:32:30,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:32:28" (2/3) ... [2021-03-25 14:32:30,430 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e0c8d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:32:30, skipping insertion in model container [2021-03-25 14:32:30,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:32:30" (3/3) ... [2021-03-25 14:32:30,432 INFO L111 eAbstractionObserver]: Analyzing ICFG mix042_power.opt.i [2021-03-25 14:32:30,440 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:32:30,443 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:32:30,444 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:32:30,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,480 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,481 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,481 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,482 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,486 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,486 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,487 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,487 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,488 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,489 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,490 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,492 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,492 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,493 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,497 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,499 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:32:30,502 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:32:30,519 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:32:30,552 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:32:30,552 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:32:30,552 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:32:30,552 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:32:30,556 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:32:30,557 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:32:30,557 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:32:30,557 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:32:30,569 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 14:32:30,614 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 14:32:30,614 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:30,623 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 14:32:30,623 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 101 transitions, 217 flow [2021-03-25 14:32:30,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 98 transitions, 205 flow [2021-03-25 14:32:30,631 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:30,640 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 14:32:30,643 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 205 flow [2021-03-25 14:32:30,646 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 205 flow [2021-03-25 14:32:30,675 INFO L129 PetriNetUnfolder]: 2/98 cut-off events. [2021-03-25 14:32:30,675 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:30,676 INFO L84 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 2/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2021-03-25 14:32:30,680 INFO L142 LiptonReduction]: Number of co-enabled transitions 1738 [2021-03-25 14:32:31,856 WARN L205 SmtUtils]: Spent 781.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2021-03-25 14:32:32,434 WARN L205 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 185 [2021-03-25 14:32:33,818 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2021-03-25 14:32:34,381 WARN L205 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 14:32:35,294 WARN L205 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:32:35,655 WARN L205 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:32:35,777 WARN L205 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:32:37,166 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:32:37,480 WARN L205 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:32:38,144 WARN L205 SmtUtils]: Spent 661.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:32:38,775 WARN L205 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:32:38,890 INFO L154 LiptonReduction]: Checked pairs total: 2986 [2021-03-25 14:32:38,891 INFO L156 LiptonReduction]: Total number of compositions: 67 [2021-03-25 14:32:38,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8264 [2021-03-25 14:32:38,905 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 14:32:38,906 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:38,906 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:38,906 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:38,907 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:38,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:38,913 INFO L82 PathProgramCache]: Analyzing trace with hash 684331068, now seen corresponding path program 1 times [2021-03-25 14:32:38,918 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:38,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098373951] [2021-03-25 14:32:38,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:39,149 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:39,150 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:39,150 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:39,151 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:39,156 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-25 14:32:39,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098373951] [2021-03-25 14:32:39,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:39,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:32:39,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317531792] [2021-03-25 14:32:39,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:32:39,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:39,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:32:39,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:32:39,174 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 168 [2021-03-25 14:32:39,180 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 87 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 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-25 14:32:39,180 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:39,180 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 168 [2021-03-25 14:32:39,181 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:39,286 INFO L129 PetriNetUnfolder]: 23/100 cut-off events. [2021-03-25 14:32:39,287 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:39,288 INFO L84 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 100 events. 23/100 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 325 event pairs, 9 based on Foata normal form. 5/98 useless extension candidates. Maximal degree in co-relation 139. Up to 37 conditions per place. [2021-03-25 14:32:39,290 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 7 selfloop transitions, 2 changer transitions 5/40 dead transitions. [2021-03-25 14:32:39,290 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 111 flow [2021-03-25 14:32:39,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:32:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:32:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2021-03-25 14:32:39,307 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2021-03-25 14:32:39,308 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2021-03-25 14:32:39,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2021-03-25 14:32:39,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:39,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2021-03-25 14:32:39,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:39,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 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-25 14:32:39,324 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 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-25 14:32:39,325 INFO L185 Difference]: Start difference. First operand has 48 places, 39 transitions, 87 flow. Second operand 3 states and 455 transitions. [2021-03-25 14:32:39,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 111 flow [2021-03-25 14:32:39,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 108 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:32:39,329 INFO L241 Difference]: Finished difference. Result has 45 places, 32 transitions, 74 flow [2021-03-25 14:32:39,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2021-03-25 14:32:39,332 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 14:32:39,332 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:39,332 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:32:39,333 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 32 transitions, 74 flow [2021-03-25 14:32:39,333 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 74 flow [2021-03-25 14:32:39,338 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:32:39,338 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:32:39,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 27 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:32:39,339 INFO L142 LiptonReduction]: Number of co-enabled transitions 254 [2021-03-25 14:32:39,641 WARN L205 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 14:32:39,783 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-03-25 14:32:40,383 WARN L205 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:32:40,658 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2021-03-25 14:32:41,262 WARN L205 SmtUtils]: Spent 602.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:32:41,870 WARN L205 SmtUtils]: Spent 606.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:32:42,646 INFO L154 LiptonReduction]: Checked pairs total: 976 [2021-03-25 14:32:42,647 INFO L156 LiptonReduction]: Total number of compositions: 10 [2021-03-25 14:32:42,647 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3315 [2021-03-25 14:32:42,648 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-25 14:32:42,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 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-25 14:32:42,648 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:42,649 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-25 14:32:42,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:32:42,649 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:42,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:42,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1683336467, now seen corresponding path program 1 times [2021-03-25 14:32:42,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:42,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870237925] [2021-03-25 14:32:42,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:42,780 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:42,781 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:42,781 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:42,782 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:42,793 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:32:42,794 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:32:42,797 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-25 14:32:42,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870237925] [2021-03-25 14:32:42,798 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:42,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:42,799 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133793022] [2021-03-25 14:32:42,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:32:42,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:42,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:32:42,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:32:42,803 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 178 [2021-03-25 14:32:42,804 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:42,804 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:42,804 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 178 [2021-03-25 14:32:42,804 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:42,815 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:32:42,815 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:32:42,816 INFO L84 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 1/23 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:32:42,816 INFO L132 encePairwiseOnDemand]: 175/178 looper letters, 1 selfloop transitions, 2 changer transitions 0/22 dead transitions. [2021-03-25 14:32:42,816 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 22 transitions, 60 flow [2021-03-25 14:32:42,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:32:42,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:32:42,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2021-03-25 14:32:42,818 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8726591760299626 [2021-03-25 14:32:42,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 466 transitions. [2021-03-25 14:32:42,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 466 transitions. [2021-03-25 14:32:42,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:42,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 466 transitions. [2021-03-25 14:32:42,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 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-25 14:32:42,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:42,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 178.0) internal successors, (712), 4 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:42,821 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 466 transitions. [2021-03-25 14:32:42,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 22 transitions, 60 flow [2021-03-25 14:32:42,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 22 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:32:42,822 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2021-03-25 14:32:42,822 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2021-03-25 14:32:42,823 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -16 predicate places. [2021-03-25 14:32:42,823 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:42,823 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 22 transitions, 58 flow [2021-03-25 14:32:42,823 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 22 transitions, 58 flow [2021-03-25 14:32:42,824 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 22 transitions, 58 flow [2021-03-25 14:32:42,827 INFO L129 PetriNetUnfolder]: 0/22 cut-off events. [2021-03-25 14:32:42,827 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:32:42,827 INFO L84 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 0/22 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 26 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:32:42,827 INFO L142 LiptonReduction]: Number of co-enabled transitions 184 [2021-03-25 14:32:43,503 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 14:32:43,639 WARN L205 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 14:32:43,937 WARN L205 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2021-03-25 14:32:44,107 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2021-03-25 14:32:44,109 INFO L154 LiptonReduction]: Checked pairs total: 645 [2021-03-25 14:32:44,110 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:32:44,110 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1287 [2021-03-25 14:32:44,110 INFO L480 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 54 flow [2021-03-25 14:32:44,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,111 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:44,111 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:44,111 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:32:44,112 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:44,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1317855793, now seen corresponding path program 1 times [2021-03-25 14:32:44,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:44,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660746596] [2021-03-25 14:32:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:44,209 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,209 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:44,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:32:44,218 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,219 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:32:44,231 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:32:44,242 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-25 14:32:44,242 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660746596] [2021-03-25 14:32:44,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:44,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:32:44,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717950409] [2021-03-25 14:32:44,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:32:44,243 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:44,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:32:44,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:32:44,245 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 180 [2021-03-25 14:32:44,246 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 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-25 14:32:44,246 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:44,246 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 180 [2021-03-25 14:32:44,246 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:44,308 INFO L129 PetriNetUnfolder]: 21/68 cut-off events. [2021-03-25 14:32:44,309 INFO L130 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2021-03-25 14:32:44,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 68 events. 21/68 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 219 event pairs, 8 based on Foata normal form. 1/68 useless extension candidates. Maximal degree in co-relation 130. Up to 40 conditions per place. [2021-03-25 14:32:44,310 INFO L132 encePairwiseOnDemand]: 175/180 looper letters, 8 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2021-03-25 14:32:44,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 95 flow [2021-03-25 14:32:44,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:32:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:32:44,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2021-03-25 14:32:44,312 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7527777777777778 [2021-03-25 14:32:44,312 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2021-03-25 14:32:44,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2021-03-25 14:32:44,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:44,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2021-03-25 14:32:44,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 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-25 14:32:44,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,317 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 180.0) internal successors, (900), 5 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,317 INFO L185 Difference]: Start difference. First operand has 30 places, 20 transitions, 54 flow. Second operand 4 states and 542 transitions. [2021-03-25 14:32:44,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 95 flow [2021-03-25 14:32:44,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 89 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:32:44,318 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 83 flow [2021-03-25 14:32:44,318 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2021-03-25 14:32:44,319 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -15 predicate places. [2021-03-25 14:32:44,319 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:44,319 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 33 places, 24 transitions, 83 flow [2021-03-25 14:32:44,319 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 33 places, 24 transitions, 83 flow [2021-03-25 14:32:44,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 33 places, 24 transitions, 83 flow [2021-03-25 14:32:44,325 INFO L129 PetriNetUnfolder]: 2/31 cut-off events. [2021-03-25 14:32:44,325 INFO L130 PetriNetUnfolder]: For 3/4 co-relation queries the response was YES. [2021-03-25 14:32:44,325 INFO L84 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 31 events. 2/31 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 0 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 51. Up to 7 conditions per place. [2021-03-25 14:32:44,326 INFO L142 LiptonReduction]: Number of co-enabled transitions 218 [2021-03-25 14:32:44,327 INFO L154 LiptonReduction]: Checked pairs total: 229 [2021-03-25 14:32:44,327 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:32:44,328 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 14:32:44,328 INFO L480 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 83 flow [2021-03-25 14:32:44,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 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-25 14:32:44,329 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:44,329 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:44,329 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:32:44,329 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:44,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:44,330 INFO L82 PathProgramCache]: Analyzing trace with hash 540624425, now seen corresponding path program 1 times [2021-03-25 14:32:44,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:44,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140790267] [2021-03-25 14:32:44,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:44,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,430 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:32:44,437 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 14:32:44,442 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,443 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 14:32:44,461 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:44,462 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 14:32:44,475 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-25 14:32:44,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140790267] [2021-03-25 14:32:44,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:44,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:44,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165597855] [2021-03-25 14:32:44,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:32:44,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:32:44,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:32:44,478 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 180 [2021-03-25 14:32:44,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 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-25 14:32:44,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:44,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 180 [2021-03-25 14:32:44,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:44,541 INFO L129 PetriNetUnfolder]: 25/70 cut-off events. [2021-03-25 14:32:44,541 INFO L130 PetriNetUnfolder]: For 29/31 co-relation queries the response was YES. [2021-03-25 14:32:44,541 INFO L84 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 70 events. 25/70 cut-off events. For 29/31 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 209 event pairs, 4 based on Foata normal form. 3/72 useless extension candidates. Maximal degree in co-relation 171. Up to 41 conditions per place. [2021-03-25 14:32:44,542 INFO L132 encePairwiseOnDemand]: 173/180 looper letters, 9 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2021-03-25 14:32:44,542 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 142 flow [2021-03-25 14:32:44,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:32:44,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:32:44,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2021-03-25 14:32:44,545 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7744444444444445 [2021-03-25 14:32:44,545 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 697 transitions. [2021-03-25 14:32:44,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 697 transitions. [2021-03-25 14:32:44,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:44,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 697 transitions. [2021-03-25 14:32:44,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.4) internal successors, (697), 5 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,550 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:44,550 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 83 flow. Second operand 5 states and 697 transitions. [2021-03-25 14:32:44,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 142 flow [2021-03-25 14:32:44,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:32:44,552 INFO L241 Difference]: Finished difference. Result has 39 places, 30 transitions, 140 flow [2021-03-25 14:32:44,552 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=180, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=140, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2021-03-25 14:32:44,552 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -9 predicate places. [2021-03-25 14:32:44,553 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:44,553 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 30 transitions, 140 flow [2021-03-25 14:32:44,553 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 30 transitions, 140 flow [2021-03-25 14:32:44,553 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 30 transitions, 140 flow [2021-03-25 14:32:44,565 INFO L129 PetriNetUnfolder]: 23/70 cut-off events. [2021-03-25 14:32:44,565 INFO L130 PetriNetUnfolder]: For 51/62 co-relation queries the response was YES. [2021-03-25 14:32:44,565 INFO L84 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 70 events. 23/70 cut-off events. For 51/62 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 247 event pairs, 6 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 182. Up to 34 conditions per place. [2021-03-25 14:32:44,566 INFO L142 LiptonReduction]: Number of co-enabled transitions 256 [2021-03-25 14:32:44,767 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:32:45,136 WARN L205 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-25 14:32:45,273 WARN L205 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 14:32:45,281 INFO L154 LiptonReduction]: Checked pairs total: 520 [2021-03-25 14:32:45,281 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:32:45,281 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 728 [2021-03-25 14:32:45,282 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 144 flow [2021-03-25 14:32:45,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 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-25 14:32:45,283 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:45,283 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:45,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:32:45,283 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:45,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:45,283 INFO L82 PathProgramCache]: Analyzing trace with hash -622168205, now seen corresponding path program 2 times [2021-03-25 14:32:45,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:45,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005158160] [2021-03-25 14:32:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:45,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:45,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,381 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:32:45,387 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:32:45,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 14:32:45,410 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:32:45,421 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-25 14:32:45,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005158160] [2021-03-25 14:32:45,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:45,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:32:45,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162122274] [2021-03-25 14:32:45,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:32:45,422 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:45,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:32:45,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:32:45,427 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 181 [2021-03-25 14:32:45,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-25 14:32:45,428 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:45,428 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 181 [2021-03-25 14:32:45,428 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:45,525 INFO L129 PetriNetUnfolder]: 26/73 cut-off events. [2021-03-25 14:32:45,525 INFO L130 PetriNetUnfolder]: For 97/120 co-relation queries the response was YES. [2021-03-25 14:32:45,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 73 events. 26/73 cut-off events. For 97/120 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 223 event pairs, 5 based on Foata normal form. 7/77 useless extension candidates. Maximal degree in co-relation 252. Up to 42 conditions per place. [2021-03-25 14:32:45,527 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 11 selfloop transitions, 10 changer transitions 0/34 dead transitions. [2021-03-25 14:32:45,527 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 210 flow [2021-03-25 14:32:45,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:32:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:32:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2021-03-25 14:32:45,530 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7425414364640884 [2021-03-25 14:32:45,530 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2021-03-25 14:32:45,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2021-03-25 14:32:45,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:45,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2021-03-25 14:32:45,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 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-25 14:32:45,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,536 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,536 INFO L185 Difference]: Start difference. First operand has 39 places, 30 transitions, 144 flow. Second operand 5 states and 672 transitions. [2021-03-25 14:32:45,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 210 flow [2021-03-25 14:32:45,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 34 transitions, 198 flow, removed 3 selfloop flow, removed 1 redundant places. [2021-03-25 14:32:45,540 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 175 flow [2021-03-25 14:32:45,540 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=175, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-25 14:32:45,540 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -5 predicate places. [2021-03-25 14:32:45,540 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:45,540 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 175 flow [2021-03-25 14:32:45,541 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 175 flow [2021-03-25 14:32:45,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 175 flow [2021-03-25 14:32:45,551 INFO L129 PetriNetUnfolder]: 21/69 cut-off events. [2021-03-25 14:32:45,551 INFO L130 PetriNetUnfolder]: For 112/127 co-relation queries the response was YES. [2021-03-25 14:32:45,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 225 conditions, 69 events. 21/69 cut-off events. For 112/127 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 222 event pairs, 4 based on Foata normal form. 3/67 useless extension candidates. Maximal degree in co-relation 209. Up to 32 conditions per place. [2021-03-25 14:32:45,553 INFO L142 LiptonReduction]: Number of co-enabled transitions 270 [2021-03-25 14:32:45,559 INFO L154 LiptonReduction]: Checked pairs total: 261 [2021-03-25 14:32:45,559 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:32:45,559 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 19 [2021-03-25 14:32:45,562 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 175 flow [2021-03-25 14:32:45,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 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-25 14:32:45,562 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:45,562 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:45,562 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:32:45,563 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:45,563 INFO L82 PathProgramCache]: Analyzing trace with hash -226945495, now seen corresponding path program 3 times [2021-03-25 14:32:45,563 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:45,563 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935356025] [2021-03-25 14:32:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:45,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:32:45,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,671 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:32:45,689 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,690 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 14:32:45,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,718 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 30 [2021-03-25 14:32:45,743 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-25 14:32:45,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935356025] [2021-03-25 14:32:45,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:45,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:32:45,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940613148] [2021-03-25 14:32:45,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:32:45,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:45,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:32:45,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:32:45,746 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 181 [2021-03-25 14:32:45,747 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 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-25 14:32:45,747 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:45,747 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 181 [2021-03-25 14:32:45,747 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:45,838 INFO L129 PetriNetUnfolder]: 25/78 cut-off events. [2021-03-25 14:32:45,838 INFO L130 PetriNetUnfolder]: For 172/188 co-relation queries the response was YES. [2021-03-25 14:32:45,839 INFO L84 FinitePrefix]: Finished finitePrefix Result has 297 conditions, 78 events. 25/78 cut-off events. For 172/188 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 257 event pairs, 2 based on Foata normal form. 8/85 useless extension candidates. Maximal degree in co-relation 279. Up to 34 conditions per place. [2021-03-25 14:32:45,840 INFO L132 encePairwiseOnDemand]: 174/181 looper letters, 11 selfloop transitions, 13 changer transitions 0/37 dead transitions. [2021-03-25 14:32:45,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 37 transitions, 259 flow [2021-03-25 14:32:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:32:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:32:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 698 transitions. [2021-03-25 14:32:45,842 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7712707182320442 [2021-03-25 14:32:45,842 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 698 transitions. [2021-03-25 14:32:45,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 698 transitions. [2021-03-25 14:32:45,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:45,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 698 transitions. [2021-03-25 14:32:45,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 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-25 14:32:45,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,846 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:45,846 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 175 flow. Second operand 5 states and 698 transitions. [2021-03-25 14:32:45,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 37 transitions, 259 flow [2021-03-25 14:32:45,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 240 flow, removed 2 selfloop flow, removed 3 redundant places. [2021-03-25 14:32:45,848 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 214 flow [2021-03-25 14:32:45,848 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2021-03-25 14:32:45,848 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, -3 predicate places. [2021-03-25 14:32:45,848 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:45,849 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 214 flow [2021-03-25 14:32:45,849 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 214 flow [2021-03-25 14:32:45,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 214 flow [2021-03-25 14:32:45,859 INFO L129 PetriNetUnfolder]: 21/71 cut-off events. [2021-03-25 14:32:45,859 INFO L130 PetriNetUnfolder]: For 166/180 co-relation queries the response was YES. [2021-03-25 14:32:45,859 INFO L84 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 71 events. 21/71 cut-off events. For 166/180 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 246 event pairs, 2 based on Foata normal form. 5/72 useless extension candidates. Maximal degree in co-relation 249. Up to 33 conditions per place. [2021-03-25 14:32:45,860 INFO L142 LiptonReduction]: Number of co-enabled transitions 286 [2021-03-25 14:32:45,912 INFO L154 LiptonReduction]: Checked pairs total: 316 [2021-03-25 14:32:45,912 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:32:45,912 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 64 [2021-03-25 14:32:45,918 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 214 flow [2021-03-25 14:32:45,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 136.83333333333334) internal successors, (821), 6 states have internal predecessors, (821), 0 states have call successors, (0), 0 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-25 14:32:45,918 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:45,918 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:45,919 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:32:45,919 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:45,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1018210983, now seen corresponding path program 1 times [2021-03-25 14:32:45,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:45,919 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199593518] [2021-03-25 14:32:45,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:45,996 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:45,997 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,001 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:32:46,001 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:32:46,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,008 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:46,009 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-25 14:32:46,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199593518] [2021-03-25 14:32:46,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:46,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:46,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775673216] [2021-03-25 14:32:46,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:32:46,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:46,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:32:46,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:32:46,013 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 181 [2021-03-25 14:32:46,013 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,014 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:46,014 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 181 [2021-03-25 14:32:46,014 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:46,100 INFO L129 PetriNetUnfolder]: 73/175 cut-off events. [2021-03-25 14:32:46,101 INFO L130 PetriNetUnfolder]: For 309/361 co-relation queries the response was YES. [2021-03-25 14:32:46,101 INFO L84 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 175 events. 73/175 cut-off events. For 309/361 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 855 event pairs, 20 based on Foata normal form. 33/197 useless extension candidates. Maximal degree in co-relation 545. Up to 88 conditions per place. [2021-03-25 14:32:46,102 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 10 selfloop transitions, 8 changer transitions 0/44 dead transitions. [2021-03-25 14:32:46,102 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 44 transitions, 270 flow [2021-03-25 14:32:46,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:32:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:32:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 788 transitions. [2021-03-25 14:32:46,105 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8707182320441988 [2021-03-25 14:32:46,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 788 transitions. [2021-03-25 14:32:46,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 788 transitions. [2021-03-25 14:32:46,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:46,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 788 transitions. [2021-03-25 14:32:46,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.6) internal successors, (788), 5 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-25 14:32:46,109 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,109 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 181.0) internal successors, (1086), 6 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,109 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 214 flow. Second operand 5 states and 788 transitions. [2021-03-25 14:32:46,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 44 transitions, 270 flow [2021-03-25 14:32:46,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 244 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-25 14:32:46,112 INFO L241 Difference]: Finished difference. Result has 49 places, 41 transitions, 256 flow [2021-03-25 14:32:46,112 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=256, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2021-03-25 14:32:46,112 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 1 predicate places. [2021-03-25 14:32:46,112 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:46,112 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 41 transitions, 256 flow [2021-03-25 14:32:46,113 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 41 transitions, 256 flow [2021-03-25 14:32:46,113 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 41 transitions, 256 flow [2021-03-25 14:32:46,133 INFO L129 PetriNetUnfolder]: 74/178 cut-off events. [2021-03-25 14:32:46,133 INFO L130 PetriNetUnfolder]: For 324/372 co-relation queries the response was YES. [2021-03-25 14:32:46,134 INFO L84 FinitePrefix]: Finished finitePrefix Result has 615 conditions, 178 events. 74/178 cut-off events. For 324/372 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 891 event pairs, 24 based on Foata normal form. 8/172 useless extension candidates. Maximal degree in co-relation 595. Up to 88 conditions per place. [2021-03-25 14:32:46,136 INFO L142 LiptonReduction]: Number of co-enabled transitions 378 [2021-03-25 14:32:46,140 INFO L154 LiptonReduction]: Checked pairs total: 262 [2021-03-25 14:32:46,140 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:32:46,140 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 14:32:46,143 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 256 flow [2021-03-25 14:32:46,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 154.75) internal successors, (619), 4 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,144 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:46,144 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:46,144 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:32:46,144 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:46,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:46,145 INFO L82 PathProgramCache]: Analyzing trace with hash -487523961, now seen corresponding path program 1 times [2021-03-25 14:32:46,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:46,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43252644] [2021-03-25 14:32:46,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:46,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,240 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:32:46,241 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:32:46,249 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:46,250 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-25 14:32:46,250 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43252644] [2021-03-25 14:32:46,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:46,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:32:46,250 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137429957] [2021-03-25 14:32:46,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:32:46,251 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:46,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:32:46,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:32:46,252 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 181 [2021-03-25 14:32:46,253 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 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-25 14:32:46,253 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:46,253 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 181 [2021-03-25 14:32:46,253 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:46,321 INFO L129 PetriNetUnfolder]: 40/124 cut-off events. [2021-03-25 14:32:46,321 INFO L130 PetriNetUnfolder]: For 428/648 co-relation queries the response was YES. [2021-03-25 14:32:46,322 INFO L84 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 124 events. 40/124 cut-off events. For 428/648 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 556 event pairs, 3 based on Foata normal form. 69/186 useless extension candidates. Maximal degree in co-relation 466. Up to 72 conditions per place. [2021-03-25 14:32:46,323 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 5 selfloop transitions, 15 changer transitions 3/47 dead transitions. [2021-03-25 14:32:46,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 47 transitions, 327 flow [2021-03-25 14:32:46,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:32:46,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:32:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1103 transitions. [2021-03-25 14:32:46,326 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8705603788476717 [2021-03-25 14:32:46,327 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1103 transitions. [2021-03-25 14:32:46,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1103 transitions. [2021-03-25 14:32:46,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:46,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1103 transitions. [2021-03-25 14:32:46,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 157.57142857142858) internal successors, (1103), 7 states have internal predecessors, (1103), 0 states have call successors, (0), 0 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-25 14:32:46,331 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,332 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,332 INFO L185 Difference]: Start difference. First operand has 49 places, 41 transitions, 256 flow. Second operand 7 states and 1103 transitions. [2021-03-25 14:32:46,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 47 transitions, 327 flow [2021-03-25 14:32:46,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 47 transitions, 311 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-25 14:32:46,337 INFO L241 Difference]: Finished difference. Result has 55 places, 44 transitions, 306 flow [2021-03-25 14:32:46,337 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2021-03-25 14:32:46,337 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 7 predicate places. [2021-03-25 14:32:46,338 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:46,338 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 44 transitions, 306 flow [2021-03-25 14:32:46,338 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 44 transitions, 306 flow [2021-03-25 14:32:46,338 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 44 transitions, 306 flow [2021-03-25 14:32:46,350 INFO L129 PetriNetUnfolder]: 33/106 cut-off events. [2021-03-25 14:32:46,350 INFO L130 PetriNetUnfolder]: For 343/421 co-relation queries the response was YES. [2021-03-25 14:32:46,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 106 events. 33/106 cut-off events. For 343/421 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 476 event pairs, 3 based on Foata normal form. 5/105 useless extension candidates. Maximal degree in co-relation 423. Up to 57 conditions per place. [2021-03-25 14:32:46,351 INFO L142 LiptonReduction]: Number of co-enabled transitions 422 [2021-03-25 14:32:46,359 INFO L154 LiptonReduction]: Checked pairs total: 622 [2021-03-25 14:32:46,359 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:32:46,359 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 14:32:46,359 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 290 flow [2021-03-25 14:32:46,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 154.8) internal successors, (774), 5 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-25 14:32:46,360 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:46,360 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:46,361 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:32:46,361 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:46,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:46,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1029889496, now seen corresponding path program 1 times [2021-03-25 14:32:46,361 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:46,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145682228] [2021-03-25 14:32:46,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:46,421 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,421 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,424 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,424 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,428 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,429 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:46,436 INFO L142 QuantifierPusher]: treesize reduction 11, result has 54.2 percent of original size [2021-03-25 14:32:46,436 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:32:46,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:46,445 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:32:46,446 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145682228] [2021-03-25 14:32:46,446 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:46,446 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:32:46,446 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617513114] [2021-03-25 14:32:46,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:32:46,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:32:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:32:46,448 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 181 [2021-03-25 14:32:46,448 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 290 flow. Second operand has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 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-25 14:32:46,448 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:46,448 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 181 [2021-03-25 14:32:46,448 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:46,503 INFO L129 PetriNetUnfolder]: 15/60 cut-off events. [2021-03-25 14:32:46,503 INFO L130 PetriNetUnfolder]: For 258/291 co-relation queries the response was YES. [2021-03-25 14:32:46,505 INFO L84 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 60 events. 15/60 cut-off events. For 258/291 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 167 event pairs, 0 based on Foata normal form. 23/82 useless extension candidates. Maximal degree in co-relation 235. Up to 32 conditions per place. [2021-03-25 14:32:46,505 INFO L132 encePairwiseOnDemand]: 175/181 looper letters, 2 selfloop transitions, 11 changer transitions 3/40 dead transitions. [2021-03-25 14:32:46,505 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 40 transitions, 295 flow [2021-03-25 14:32:46,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:32:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:32:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1096 transitions. [2021-03-25 14:32:46,508 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8650355169692187 [2021-03-25 14:32:46,508 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1096 transitions. [2021-03-25 14:32:46,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1096 transitions. [2021-03-25 14:32:46,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:46,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1096 transitions. [2021-03-25 14:32:46,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 156.57142857142858) internal successors, (1096), 7 states have internal predecessors, (1096), 0 states have call successors, (0), 0 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-25 14:32:46,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,514 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 181.0) internal successors, (1448), 8 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:46,514 INFO L185 Difference]: Start difference. First operand has 55 places, 42 transitions, 290 flow. Second operand 7 states and 1096 transitions. [2021-03-25 14:32:46,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 40 transitions, 295 flow [2021-03-25 14:32:46,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 261 flow, removed 13 selfloop flow, removed 5 redundant places. [2021-03-25 14:32:46,517 INFO L241 Difference]: Finished difference. Result has 54 places, 37 transitions, 241 flow [2021-03-25 14:32:46,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=181, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=54, PETRI_TRANSITIONS=37} [2021-03-25 14:32:46,518 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 6 predicate places. [2021-03-25 14:32:46,518 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:46,518 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 37 transitions, 241 flow [2021-03-25 14:32:46,518 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 37 transitions, 241 flow [2021-03-25 14:32:46,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 37 transitions, 241 flow [2021-03-25 14:32:46,525 INFO L129 PetriNetUnfolder]: 12/53 cut-off events. [2021-03-25 14:32:46,525 INFO L130 PetriNetUnfolder]: For 104/109 co-relation queries the response was YES. [2021-03-25 14:32:46,526 INFO L84 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 53 events. 12/53 cut-off events. For 104/109 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 153 event pairs, 0 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 180. Up to 17 conditions per place. [2021-03-25 14:32:46,526 INFO L142 LiptonReduction]: Number of co-enabled transitions 232 [2021-03-25 14:32:47,131 WARN L205 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 237 DAG size of output: 184 [2021-03-25 14:32:47,345 WARN L205 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2021-03-25 14:32:48,731 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification. DAG size of input: 339 DAG size of output: 262 [2021-03-25 14:32:49,228 WARN L205 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2021-03-25 14:32:49,478 WARN L205 SmtUtils]: Spent 232.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:32:49,714 WARN L205 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2021-03-25 14:32:50,257 WARN L205 SmtUtils]: Spent 540.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:32:50,782 WARN L205 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 14:32:50,787 INFO L154 LiptonReduction]: Checked pairs total: 528 [2021-03-25 14:32:50,787 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:32:50,788 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4270 [2021-03-25 14:32:50,788 INFO L480 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 227 flow [2021-03-25 14:32:50,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 154.83333333333334) internal successors, (929), 6 states have internal predecessors, (929), 0 states have call successors, (0), 0 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-25 14:32:50,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:50,789 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-25 14:32:50,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:32:50,789 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:50,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:50,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1221285820, now seen corresponding path program 1 times [2021-03-25 14:32:50,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:50,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971938602] [2021-03-25 14:32:50,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:50,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:50,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:50,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:50,825 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:50,828 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:50,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:50,832 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-25 14:32:50,832 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971938602] [2021-03-25 14:32:50,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:50,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:50,832 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236768667] [2021-03-25 14:32:50,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:32:50,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:50,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:32:50,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:32:50,834 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 183 [2021-03-25 14:32:50,834 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 227 flow. Second operand has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 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-25 14:32:50,834 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:50,834 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 183 [2021-03-25 14:32:50,834 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:50,859 INFO L129 PetriNetUnfolder]: 26/86 cut-off events. [2021-03-25 14:32:50,859 INFO L130 PetriNetUnfolder]: For 438/470 co-relation queries the response was YES. [2021-03-25 14:32:50,860 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 86 events. 26/86 cut-off events. For 438/470 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 322 event pairs, 0 based on Foata normal form. 13/93 useless extension candidates. Maximal degree in co-relation 302. Up to 31 conditions per place. [2021-03-25 14:32:50,860 INFO L132 encePairwiseOnDemand]: 180/183 looper letters, 3 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2021-03-25 14:32:50,860 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 35 transitions, 239 flow [2021-03-25 14:32:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:32:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:32:50,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 614 transitions. [2021-03-25 14:32:50,862 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8387978142076503 [2021-03-25 14:32:50,863 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 614 transitions. [2021-03-25 14:32:50,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 614 transitions. [2021-03-25 14:32:50,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:50,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 614 transitions. [2021-03-25 14:32:50,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 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-25 14:32:50,865 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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-25 14:32:50,865 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 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-25 14:32:50,866 INFO L185 Difference]: Start difference. First operand has 50 places, 34 transitions, 227 flow. Second operand 4 states and 614 transitions. [2021-03-25 14:32:50,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 35 transitions, 239 flow [2021-03-25 14:32:50,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 197 flow, removed 12 selfloop flow, removed 7 redundant places. [2021-03-25 14:32:50,868 INFO L241 Difference]: Finished difference. Result has 48 places, 34 transitions, 192 flow [2021-03-25 14:32:50,868 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=192, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2021-03-25 14:32:50,868 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2021-03-25 14:32:50,868 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:50,868 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 34 transitions, 192 flow [2021-03-25 14:32:50,868 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 34 transitions, 192 flow [2021-03-25 14:32:50,869 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 34 transitions, 192 flow [2021-03-25 14:32:50,875 INFO L129 PetriNetUnfolder]: 18/67 cut-off events. [2021-03-25 14:32:50,875 INFO L130 PetriNetUnfolder]: For 148/156 co-relation queries the response was YES. [2021-03-25 14:32:50,876 INFO L84 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 67 events. 18/67 cut-off events. For 148/156 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 219 event pairs, 0 based on Foata normal form. 4/68 useless extension candidates. Maximal degree in co-relation 187. Up to 16 conditions per place. [2021-03-25 14:32:50,876 INFO L142 LiptonReduction]: Number of co-enabled transitions 182 [2021-03-25 14:32:51,208 WARN L205 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-25 14:32:51,346 WARN L205 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2021-03-25 14:32:51,357 INFO L154 LiptonReduction]: Checked pairs total: 189 [2021-03-25 14:32:51,357 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:32:51,358 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 490 [2021-03-25 14:32:51,359 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 201 flow [2021-03-25 14:32:51,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 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-25 14:32:51,359 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:51,359 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:51,360 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:32:51,360 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:51,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2080609229, now seen corresponding path program 1 times [2021-03-25 14:32:51,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:51,360 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279883259] [2021-03-25 14:32:51,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:32:51,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:51,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:32:51,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:51,419 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:51,422 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:32:51,423 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:32:51,426 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-25 14:32:51,426 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279883259] [2021-03-25 14:32:51,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:32:51,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:32:51,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519045467] [2021-03-25 14:32:51,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:32:51,427 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:32:51,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:32:51,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:32:51,428 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 186 [2021-03-25 14:32:51,428 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 201 flow. Second operand has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 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-25 14:32:51,429 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:32:51,429 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 186 [2021-03-25 14:32:51,429 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:32:51,458 INFO L129 PetriNetUnfolder]: 33/114 cut-off events. [2021-03-25 14:32:51,458 INFO L130 PetriNetUnfolder]: For 549/578 co-relation queries the response was YES. [2021-03-25 14:32:51,459 INFO L84 FinitePrefix]: Finished finitePrefix Result has 357 conditions, 114 events. 33/114 cut-off events. For 549/578 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 489 event pairs, 0 based on Foata normal form. 19/129 useless extension candidates. Maximal degree in co-relation 335. Up to 28 conditions per place. [2021-03-25 14:32:51,459 INFO L132 encePairwiseOnDemand]: 183/186 looper letters, 3 selfloop transitions, 1 changer transitions 7/35 dead transitions. [2021-03-25 14:32:51,459 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 213 flow [2021-03-25 14:32:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:32:51,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:32:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2021-03-25 14:32:51,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8575268817204301 [2021-03-25 14:32:51,462 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2021-03-25 14:32:51,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2021-03-25 14:32:51,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:32:51,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2021-03-25 14:32:51,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 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-25 14:32:51,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:51,465 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 186.0) internal successors, (930), 5 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:32:51,465 INFO L185 Difference]: Start difference. First operand has 47 places, 34 transitions, 201 flow. Second operand 4 states and 638 transitions. [2021-03-25 14:32:51,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 213 flow [2021-03-25 14:32:51,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 207 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:32:51,467 INFO L241 Difference]: Finished difference. Result has 50 places, 28 transitions, 158 flow [2021-03-25 14:32:51,468 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2021-03-25 14:32:51,468 INFO L343 CegarLoopForPetriNet]: 48 programPoint places, 2 predicate places. [2021-03-25 14:32:51,468 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:32:51,468 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 50 places, 28 transitions, 158 flow [2021-03-25 14:32:51,468 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 50 places, 28 transitions, 158 flow [2021-03-25 14:32:51,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 28 transitions, 158 flow [2021-03-25 14:32:51,477 INFO L129 PetriNetUnfolder]: 13/58 cut-off events. [2021-03-25 14:32:51,477 INFO L130 PetriNetUnfolder]: For 112/119 co-relation queries the response was YES. [2021-03-25 14:32:51,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 58 events. 13/58 cut-off events. For 112/119 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 170 event pairs, 0 based on Foata normal form. 6/61 useless extension candidates. Maximal degree in co-relation 164. Up to 16 conditions per place. [2021-03-25 14:32:51,478 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-25 14:32:51,534 INFO L154 LiptonReduction]: Checked pairs total: 43 [2021-03-25 14:32:51,534 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:32:51,534 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 66 [2021-03-25 14:32:51,535 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 154 flow [2021-03-25 14:32:51,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 159.0) internal successors, (636), 4 states have internal predecessors, (636), 0 states have call successors, (0), 0 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-25 14:32:51,535 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:32:51,535 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:32:51,535 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:32:51,535 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:32:51,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:32:51,536 INFO L82 PathProgramCache]: Analyzing trace with hash -770726866, now seen corresponding path program 1 times [2021-03-25 14:32:51,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:32:51,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060064848] [2021-03-25 14:32:51,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:32:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:32:51,562 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:32:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:32:51,586 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:32:51,623 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:32:51,623 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:32:51,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:32:51,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:32:51 BasicIcfg [2021-03-25 14:32:51,716 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:32:51,717 INFO L168 Benchmark]: Toolchain (without parser) took 23593.36 ms. Allocated memory was 356.5 MB in the beginning and 633.3 MB in the end (delta: 276.8 MB). Free memory was 319.6 MB in the beginning and 310.2 MB in the end (delta: 9.4 MB). Peak memory consumption was 288.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:51,717 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 356.5 MB. Free memory was 338.0 MB in the beginning and 337.9 MB in the end (delta: 76.4 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:32:51,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 475.92 ms. Allocated memory is still 356.5 MB. Free memory was 319.4 MB in the beginning and 317.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:51,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.92 ms. Allocated memory is still 356.5 MB. Free memory was 317.0 MB in the beginning and 313.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:51,718 INFO L168 Benchmark]: Boogie Preprocessor took 28.90 ms. Allocated memory is still 356.5 MB. Free memory was 313.8 MB in the beginning and 311.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:51,718 INFO L168 Benchmark]: RCFGBuilder took 1744.61 ms. Allocated memory is still 356.5 MB. Free memory was 311.8 MB in the beginning and 278.9 MB in the end (delta: 32.9 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:51,718 INFO L168 Benchmark]: TraceAbstraction took 21289.27 ms. Allocated memory was 356.5 MB in the beginning and 633.3 MB in the end (delta: 276.8 MB). Free memory was 277.8 MB in the beginning and 310.2 MB in the end (delta: -32.4 MB). Peak memory consumption was 243.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:32:51,726 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.12 ms. Allocated memory is still 356.5 MB. Free memory was 338.0 MB in the beginning and 337.9 MB in the end (delta: 76.4 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 475.92 ms. Allocated memory is still 356.5 MB. Free memory was 319.4 MB in the beginning and 317.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 48.92 ms. Allocated memory is still 356.5 MB. Free memory was 317.0 MB in the beginning and 313.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 28.90 ms. Allocated memory is still 356.5 MB. Free memory was 313.8 MB in the beginning and 311.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1744.61 ms. Allocated memory is still 356.5 MB. Free memory was 311.8 MB in the beginning and 278.9 MB in the end (delta: 32.9 MB). Peak memory consumption was 151.0 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21289.27 ms. Allocated memory was 356.5 MB in the beginning and 633.3 MB in the end (delta: 276.8 MB). Free memory was 277.8 MB in the beginning and 310.2 MB in the end (delta: -32.4 MB). Peak memory consumption was 243.4 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8248.2ms, 106 PlacesBefore, 48 PlacesAfterwards, 98 TransitionsBefore, 39 TransitionsAfterwards, 1738 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 67 TotalNumberOfCompositions, 2986 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1504, positive: 1420, positive conditional: 0, positive unconditional: 1420, negative: 84, negative conditional: 0, negative unconditional: 84, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1101, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1101, positive: 1059, positive conditional: 0, positive unconditional: 1059, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1101, positive: 1054, positive conditional: 0, positive unconditional: 1054, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 762, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 747, negative conditional: 0, negative unconditional: 747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1504, positive: 361, positive conditional: 0, positive unconditional: 361, negative: 42, negative conditional: 0, negative unconditional: 42, unknown: 1101, unknown conditional: 0, unknown unconditional: 1101] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 122, Positive conditional cache size: 0, Positive unconditional cache size: 122, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3314.0ms, 45 PlacesBefore, 31 PlacesAfterwards, 32 TransitionsBefore, 22 TransitionsAfterwards, 254 CoEnabledTransitionPairs, 4 FixpointIterations, 7 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 10 TotalNumberOfCompositions, 976 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 390, positive: 316, positive conditional: 0, positive unconditional: 316, negative: 74, negative conditional: 0, negative unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 64, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 64, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 64, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 17, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 239, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 191, negative conditional: 0, negative unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 390, positive: 264, positive conditional: 0, positive unconditional: 264, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 64, unknown conditional: 0, unknown unconditional: 64] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1286.2ms, 32 PlacesBefore, 30 PlacesAfterwards, 22 TransitionsBefore, 20 TransitionsAfterwards, 184 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 645 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 249, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.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] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.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] , 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: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 249, positive: 195, positive conditional: 0, positive unconditional: 195, negative: 52, negative conditional: 0, negative unconditional: 52, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 134, Positive cache size: 113, Positive conditional cache size: 0, Positive unconditional cache size: 113, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3ms, 33 PlacesBefore, 33 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 218 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 229 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 108, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 108, positive: 85, positive conditional: 0, positive unconditional: 85, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 728.2ms, 39 PlacesBefore, 39 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 256 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 520 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 244, positive: 210, positive conditional: 0, positive unconditional: 210, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 244, positive: 202, positive conditional: 0, positive unconditional: 202, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 18.6ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 270 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 138, positive: 123, positive conditional: 0, positive unconditional: 123, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 138, positive: 115, positive conditional: 0, positive unconditional: 115, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 148, Positive cache size: 134, Positive conditional cache size: 0, Positive unconditional cache size: 134, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 63.2ms, 45 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 286 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 316 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 175, positive: 156, positive conditional: 0, positive unconditional: 156, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 49, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.6ms, 49 PlacesBefore, 49 PlacesAfterwards, 41 TransitionsBefore, 41 TransitionsAfterwards, 378 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 262 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 88, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 88, positive: 76, positive conditional: 0, positive unconditional: 76, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 153, Positive cache size: 137, Positive conditional cache size: 0, Positive unconditional cache size: 137, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.0ms, 55 PlacesBefore, 55 PlacesAfterwards, 44 TransitionsBefore, 42 TransitionsAfterwards, 422 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 622 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 208, positive: 182, positive conditional: 0, positive unconditional: 182, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 208, positive: 178, positive conditional: 0, positive unconditional: 178, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 143, Positive cache size: 130, Positive conditional cache size: 0, Positive unconditional cache size: 130, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4269.3ms, 54 PlacesBefore, 50 PlacesAfterwards, 37 TransitionsBefore, 34 TransitionsAfterwards, 232 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 528 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 256, positive: 220, positive conditional: 0, positive unconditional: 220, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 9, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 256, positive: 211, positive conditional: 0, positive unconditional: 211, negative: 36, negative conditional: 0, negative unconditional: 36, unknown: 9, unknown conditional: 0, unknown unconditional: 9] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 489.2ms, 48 PlacesBefore, 47 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 182 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 189 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 87, positive: 73, positive conditional: 0, positive unconditional: 73, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 87, positive: 71, positive conditional: 0, positive unconditional: 71, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 124, Positive cache size: 119, Positive conditional cache size: 0, Positive unconditional cache size: 119, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 66.0ms, 50 PlacesBefore, 45 PlacesAfterwards, 28 TransitionsBefore, 26 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 43 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 33, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 4, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 33, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 67, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L724] 0 _Bool y$flush_delayed; [L725] 0 int y$mem_tmp; [L726] 0 _Bool y$r_buff0_thd0; [L727] 0 _Bool y$r_buff0_thd1; [L728] 0 _Bool y$r_buff0_thd2; [L729] 0 _Bool y$r_buff0_thd3; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$read_delayed; [L735] 0 int *y$read_delayed_var; [L736] 0 int y$w_buff0; [L737] 0 _Bool y$w_buff0_used; [L738] 0 int y$w_buff1; [L739] 0 _Bool y$w_buff1_used; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1108; [L826] FCALL, FORK 0 pthread_create(&t1108, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L827] 0 pthread_t t1109; [L828] FCALL, FORK 0 pthread_create(&t1109, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t1110; [L830] FCALL, FORK 0 pthread_create(&t1110, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L787] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L788] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L789] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L790] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L791] 3 y$r_buff0_thd3 = (_Bool)1 [L794] 3 z = 1 [L797] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L762] 2 x = 1 [L765] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 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) [L803] 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) [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L804] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L805] 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 [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L806] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L807] 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 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L836] 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) [L836] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L836] 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) [L836] 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) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L837] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L838] 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 [L839] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L839] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L840] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L840] 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 [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 y$flush_delayed = weak$$choice2 [L846] 0 y$mem_tmp = y [L847] 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) [L847] 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) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 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)) [L852] 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)) [L853] 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)) [L853] 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)) [L854] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L855] 0 y = y$flush_delayed ? y$mem_tmp : y [L856] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 100 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 21077.5ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 883.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8344.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 37 SDtfs, 18 SDslu, 16 SDs, 0 SdLazy, 245 SolverSat, 54 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 269.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 288.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=8, InterpolantAutomatonStates: 52, 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: 42.7ms SsaConstructionTime, 404.8ms SatisfiabilityAnalysisTime, 837.3ms InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 150 ConstructedInterpolants, 0 QuantifiedInterpolants, 706 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...