/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/mix033_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:29:01,579 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:29:01,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:29:01,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:29:01,598 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:29:01,599 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:29:01,600 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:29:01,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:29:01,602 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:29:01,602 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:29:01,603 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:29:01,604 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:29:01,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:29:01,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:29:01,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:29:01,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:29:01,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:29:01,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:29:01,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:29:01,609 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:29:01,609 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:29:01,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:29:01,612 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:29:01,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:29:01,614 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:29:01,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:29:01,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:29:01,615 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:29:01,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:29:01,616 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:29:01,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:29:01,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:29:01,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:29:01,637 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:29:01,637 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:29:01,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:29:01,638 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:29:01,638 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:29:01,638 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:29:01,639 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:29:01,639 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:29:01,640 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:29:01,672 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:29:01,672 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:29:01,673 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:29:01,673 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:29:01,673 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:29:01,673 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:29:01,674 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:29:01,675 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:29:01,675 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:29:01,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:29:01,676 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:29:01,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:29:01,917 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:29:01,919 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:29:01,920 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:29:01,921 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:29:01,922 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-03-25 14:29:01,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992fa4ad7/f8e88042915e4afa8e814be04aa4044f/FLAG3b3b11b9a [2021-03-25 14:29:02,368 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:29:02,368 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix033_tso.oepc.i [2021-03-25 14:29:02,387 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992fa4ad7/f8e88042915e4afa8e814be04aa4044f/FLAG3b3b11b9a [2021-03-25 14:29:02,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/992fa4ad7/f8e88042915e4afa8e814be04aa4044f [2021-03-25 14:29:02,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:29:02,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:29:02,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:29:02,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:29:02,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:29:02,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d74cb92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02, skipping insertion in model container [2021-03-25 14:29:02,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:29:02,449 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:29:02,582 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/mix033_tso.oepc.i[949,962] [2021-03-25 14:29:02,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:29:02,729 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:29:02,736 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/mix033_tso.oepc.i[949,962] [2021-03-25 14:29:02,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:29:02,804 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:29:02,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02 WrapperNode [2021-03-25 14:29:02,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:29:02,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:29:02,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:29:02,805 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:29:02,810 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:29:02" (1/1) ... [2021-03-25 14:29:02,820 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:29:02" (1/1) ... [2021-03-25 14:29:02,837 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:29:02,837 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:29:02,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:29:02,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:29:02,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,847 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,852 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (1/1) ... [2021-03-25 14:29:02,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:29:02,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:29:02,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:29:02,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:29:02,868 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:29:02,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:29:02,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:29:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:29:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:29:02,933 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:29:02,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:29:02,934 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:29:02,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:29:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:29:02,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:29:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:29:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:29:02,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:29:02,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:29:02,936 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:29:04,147 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:29:04,148 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:29:04,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:29:04 BoogieIcfgContainer [2021-03-25 14:29:04,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:29:04,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:29:04,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:29:04,152 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:29:04,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:29:02" (1/3) ... [2021-03-25 14:29:04,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe89f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:29:04, skipping insertion in model container [2021-03-25 14:29:04,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:29:02" (2/3) ... [2021-03-25 14:29:04,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fe89f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:29:04, skipping insertion in model container [2021-03-25 14:29:04,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:29:04" (3/3) ... [2021-03-25 14:29:04,154 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_tso.oepc.i [2021-03-25 14:29:04,158 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:29:04,161 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:29:04,161 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:29:04,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,182 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,183 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,184 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,185 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,187 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,188 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,189 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,190 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,191 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,193 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,193 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,196 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:29:04,198 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:29:04,209 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 14:29:04,221 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:29:04,221 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:29:04,221 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:29:04,222 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:29:04,222 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:29:04,222 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:29:04,222 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:29:04,222 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:29:04,228 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 114 places, 106 transitions, 227 flow [2021-03-25 14:29:04,273 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-03-25 14:29:04,274 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:04,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-25 14:29:04,281 INFO L82 GeneralOperation]: Start removeDead. Operand has 114 places, 106 transitions, 227 flow [2021-03-25 14:29:04,285 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 103 transitions, 215 flow [2021-03-25 14:29:04,286 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:04,296 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 103 transitions, 215 flow [2021-03-25 14:29:04,300 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 103 transitions, 215 flow [2021-03-25 14:29:04,303 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 215 flow [2021-03-25 14:29:04,327 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2021-03-25 14:29:04,327 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:04,328 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2021-03-25 14:29:04,331 INFO L142 LiptonReduction]: Number of co-enabled transitions 2042 [2021-03-25 14:29:05,826 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 189 [2021-03-25 14:29:06,070 WARN L205 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 14:29:07,336 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 14:29:07,884 WARN L205 SmtUtils]: Spent 546.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:29:08,085 WARN L205 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:29:08,433 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 14:29:08,559 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 14:29:09,529 WARN L205 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:29:09,790 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:29:10,372 WARN L205 SmtUtils]: Spent 580.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:29:10,979 WARN L205 SmtUtils]: Spent 605.00 ms on a formula simplification that was a NOOP. DAG size: 269 [2021-03-25 14:29:11,171 INFO L154 LiptonReduction]: Checked pairs total: 3464 [2021-03-25 14:29:11,172 INFO L156 LiptonReduction]: Total number of compositions: 69 [2021-03-25 14:29:11,173 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6888 [2021-03-25 14:29:11,179 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2021-03-25 14:29:11,179 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:11,179 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:11,179 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:29:11,179 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:11,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:11,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1125728361, now seen corresponding path program 1 times [2021-03-25 14:29:11,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:11,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233904713] [2021-03-25 14:29:11,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:11,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:11,343 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:11,344 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:11,345 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:11,349 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:29:11,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233904713] [2021-03-25 14:29:11,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:11,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:29:11,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38241970] [2021-03-25 14:29:11,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:29:11,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:11,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:29:11,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:29:11,365 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 175 [2021-03-25 14:29:11,369 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:11,369 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:11,369 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 175 [2021-03-25 14:29:11,369 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:11,446 INFO L129 PetriNetUnfolder]: 69/205 cut-off events. [2021-03-25 14:29:11,447 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:11,448 INFO L84 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 205 events. 69/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 966 event pairs, 39 based on Foata normal form. 11/197 useless extension candidates. Maximal degree in co-relation 312. Up to 89 conditions per place. [2021-03-25 14:29:11,449 INFO L132 encePairwiseOnDemand]: 171/175 looper letters, 9 selfloop transitions, 2 changer transitions 5/45 dead transitions. [2021-03-25 14:29:11,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 125 flow [2021-03-25 14:29:11,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:29:11,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:29:11,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2021-03-25 14:29:11,462 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8990476190476191 [2021-03-25 14:29:11,462 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2021-03-25 14:29:11,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2021-03-25 14:29:11,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:11,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2021-03-25 14:29:11,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 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:29:11,473 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 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:29:11,473 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 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:29:11,474 INFO L185 Difference]: Start difference. First operand has 52 places, 43 transitions, 95 flow. Second operand 3 states and 472 transitions. [2021-03-25 14:29:11,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 125 flow [2021-03-25 14:29:11,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 45 transitions, 122 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 14:29:11,478 INFO L241 Difference]: Finished difference. Result has 49 places, 36 transitions, 82 flow [2021-03-25 14:29:11,479 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2021-03-25 14:29:11,479 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2021-03-25 14:29:11,479 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:11,479 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 36 transitions, 82 flow [2021-03-25 14:29:11,480 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 36 transitions, 82 flow [2021-03-25 14:29:11,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 36 transitions, 82 flow [2021-03-25 14:29:11,483 INFO L129 PetriNetUnfolder]: 0/36 cut-off events. [2021-03-25 14:29:11,483 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:11,483 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 36 events. 0/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 42 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:29:11,484 INFO L142 LiptonReduction]: Number of co-enabled transitions 322 [2021-03-25 14:29:11,951 WARN L205 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:29:12,208 WARN L205 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:29:12,723 WARN L205 SmtUtils]: Spent 508.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 14:29:13,228 WARN L205 SmtUtils]: Spent 503.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 14:29:14,010 INFO L154 LiptonReduction]: Checked pairs total: 1266 [2021-03-25 14:29:14,011 INFO L156 LiptonReduction]: Total number of compositions: 11 [2021-03-25 14:29:14,011 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2532 [2021-03-25 14:29:14,012 INFO L480 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 60 flow [2021-03-25 14:29:14,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:14,012 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:14,012 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:14,012 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:29:14,012 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:14,013 INFO L82 PathProgramCache]: Analyzing trace with hash -921272129, now seen corresponding path program 1 times [2021-03-25 14:29:14,013 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:14,013 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429734886] [2021-03-25 14:29:14,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:14,086 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:14,087 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:14,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:14,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:14,094 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:29:14,094 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:29:14,098 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:29:14,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429734886] [2021-03-25 14:29:14,098 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:14,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:14,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565113451] [2021-03-25 14:29:14,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:14,099 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:14,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:14,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:14,100 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 186 [2021-03-25 14:29:14,101 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 60 flow. Second operand has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 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:29:14,101 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:14,101 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 186 [2021-03-25 14:29:14,101 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:14,110 INFO L129 PetriNetUnfolder]: 0/25 cut-off events. [2021-03-25 14:29:14,111 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:29:14,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 25 events. 0/25 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 31 event pairs, 0 based on Foata normal form. 1/25 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:29:14,111 INFO L132 encePairwiseOnDemand]: 183/186 looper letters, 1 selfloop transitions, 2 changer transitions 1/25 dead transitions. [2021-03-25 14:29:14,111 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 66 flow [2021-03-25 14:29:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:29:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:29:14,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions. [2021-03-25 14:29:14,114 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8727598566308243 [2021-03-25 14:29:14,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 487 transitions. [2021-03-25 14:29:14,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions. [2021-03-25 14:29:14,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:14,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions. [2021-03-25 14:29:14,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 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:29:14,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 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:29:14,116 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 186.0) internal successors, (744), 4 states have internal predecessors, (744), 0 states have call successors, (0), 0 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:29:14,117 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 60 flow. Second operand 3 states and 487 transitions. [2021-03-25 14:29:14,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 66 flow [2021-03-25 14:29:14,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 25 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:29:14,117 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 62 flow [2021-03-25 14:29:14,117 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=186, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-25 14:29:14,118 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -17 predicate places. [2021-03-25 14:29:14,118 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:14,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 62 flow [2021-03-25 14:29:14,118 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 62 flow [2021-03-25 14:29:14,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 34 places, 24 transitions, 62 flow [2021-03-25 14:29:14,120 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 14:29:14,121 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:29:14,121 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:29:14,121 INFO L142 LiptonReduction]: Number of co-enabled transitions 214 [2021-03-25 14:29:14,755 WARN L205 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:29:14,895 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:29:15,162 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2021-03-25 14:29:15,279 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2021-03-25 14:29:15,282 INFO L154 LiptonReduction]: Checked pairs total: 771 [2021-03-25 14:29:15,282 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:29:15,282 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1164 [2021-03-25 14:29:15,282 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 56 flow [2021-03-25 14:29:15,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 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:29:15,283 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:15,283 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:15,283 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:29:15,283 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:15,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:15,283 INFO L82 PathProgramCache]: Analyzing trace with hash 900137721, now seen corresponding path program 1 times [2021-03-25 14:29:15,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:15,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371322768] [2021-03-25 14:29:15,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:15,326 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:15,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:15,328 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:29:15,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371322768] [2021-03-25 14:29:15,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:15,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:29:15,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984345621] [2021-03-25 14:29:15,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:29:15,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:15,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:29:15,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:29:15,330 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 189 [2021-03-25 14:29:15,330 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 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:29:15,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:15,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 189 [2021-03-25 14:29:15,330 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:15,338 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 14:29:15,338 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-03-25 14:29:15,338 INFO L84 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 21 events. 0/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 29 event pairs, 0 based on Foata normal form. 1/22 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:29:15,339 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 1 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2021-03-25 14:29:15,339 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 21 transitions, 62 flow [2021-03-25 14:29:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:29:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:29:15,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 502 transitions. [2021-03-25 14:29:15,340 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8853615520282186 [2021-03-25 14:29:15,340 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 502 transitions. [2021-03-25 14:29:15,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 502 transitions. [2021-03-25 14:29:15,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:15,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 502 transitions. [2021-03-25 14:29:15,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:29:15,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:15,343 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 189.0) internal successors, (756), 4 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:15,343 INFO L185 Difference]: Start difference. First operand has 31 places, 21 transitions, 56 flow. Second operand 3 states and 502 transitions. [2021-03-25 14:29:15,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 21 transitions, 62 flow [2021-03-25 14:29:15,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 21 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:29:15,343 INFO L241 Difference]: Finished difference. Result has 32 places, 21 transitions, 60 flow [2021-03-25 14:29:15,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2021-03-25 14:29:15,344 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -20 predicate places. [2021-03-25 14:29:15,344 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:15,344 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-25 14:29:15,344 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 21 transitions, 60 flow [2021-03-25 14:29:15,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 21 transitions, 60 flow [2021-03-25 14:29:15,346 INFO L129 PetriNetUnfolder]: 0/21 cut-off events. [2021-03-25 14:29:15,346 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 14:29:15,346 INFO L84 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 21 events. 0/21 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2021-03-25 14:29:15,347 INFO L142 LiptonReduction]: Number of co-enabled transitions 212 [2021-03-25 14:29:15,347 INFO L154 LiptonReduction]: Checked pairs total: 246 [2021-03-25 14:29:15,347 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:15,348 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4 [2021-03-25 14:29:15,348 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 60 flow [2021-03-25 14:29:15,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 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:29:15,348 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:15,349 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:15,349 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:29:15,349 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:15,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1299979742, now seen corresponding path program 1 times [2021-03-25 14:29:15,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:15,349 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052678334] [2021-03-25 14:29:15,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:15,448 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:29:15,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:29:15,456 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:29:15,457 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:29:15,466 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:29:15,468 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:29:15,483 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:29:15,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052678334] [2021-03-25 14:29:15,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:15,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:15,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80575293] [2021-03-25 14:29:15,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:29:15,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:15,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:29:15,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:29:15,485 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 189 [2021-03-25 14:29:15,486 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 60 flow. Second operand has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:29:15,486 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:15,486 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 189 [2021-03-25 14:29:15,486 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:15,565 INFO L129 PetriNetUnfolder]: 69/149 cut-off events. [2021-03-25 14:29:15,565 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2021-03-25 14:29:15,567 INFO L84 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 149 events. 69/149 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 617 event pairs, 44 based on Foata normal form. 2/145 useless extension candidates. Maximal degree in co-relation 304. Up to 108 conditions per place. [2021-03-25 14:29:15,569 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 10 selfloop transitions, 6 changer transitions 0/29 dead transitions. [2021-03-25 14:29:15,569 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 109 flow [2021-03-25 14:29:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:29:15,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:29:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2021-03-25 14:29:15,572 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7843915343915344 [2021-03-25 14:29:15,572 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 593 transitions. [2021-03-25 14:29:15,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 593 transitions. [2021-03-25 14:29:15,573 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:15,573 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 593 transitions. [2021-03-25 14:29:15,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 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:29:15,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 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:29:15,576 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 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:29:15,576 INFO L185 Difference]: Start difference. First operand has 32 places, 21 transitions, 60 flow. Second operand 4 states and 593 transitions. [2021-03-25 14:29:15,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 109 flow [2021-03-25 14:29:15,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 29 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:29:15,578 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 96 flow [2021-03-25 14:29:15,578 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2021-03-25 14:29:15,578 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -17 predicate places. [2021-03-25 14:29:15,578 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:15,579 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 96 flow [2021-03-25 14:29:15,579 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 96 flow [2021-03-25 14:29:15,579 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 96 flow [2021-03-25 14:29:15,586 INFO L129 PetriNetUnfolder]: 15/59 cut-off events. [2021-03-25 14:29:15,586 INFO L130 PetriNetUnfolder]: For 26/28 co-relation queries the response was YES. [2021-03-25 14:29:15,587 INFO L84 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 59 events. 15/59 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 187 event pairs, 7 based on Foata normal form. 0/57 useless extension candidates. Maximal degree in co-relation 122. Up to 27 conditions per place. [2021-03-25 14:29:15,588 INFO L142 LiptonReduction]: Number of co-enabled transitions 274 [2021-03-25 14:29:15,605 INFO L154 LiptonReduction]: Checked pairs total: 218 [2021-03-25 14:29:15,606 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:15,606 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 28 [2021-03-25 14:29:15,606 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 96 flow [2021-03-25 14:29:15,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 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:29:15,607 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:15,607 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:15,607 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:29:15,607 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:15,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:15,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2041395943, now seen corresponding path program 1 times [2021-03-25 14:29:15,608 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:15,608 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118206167] [2021-03-25 14:29:15,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:15,682 INFO L142 QuantifierPusher]: treesize reduction 30, result has 30.2 percent of original size [2021-03-25 14:29:15,682 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:29:15,688 INFO L142 QuantifierPusher]: treesize reduction 30, result has 34.8 percent of original size [2021-03-25 14:29:15,688 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:29:15,695 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:29:15,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:29:15,720 INFO L142 QuantifierPusher]: treesize reduction 11, result has 86.4 percent of original size [2021-03-25 14:29:15,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 70 [2021-03-25 14:29:15,742 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:29:15,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118206167] [2021-03-25 14:29:15,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:15,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:29:15,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460931944] [2021-03-25 14:29:15,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:29:15,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:29:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:29:15,744 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 189 [2021-03-25 14:29:15,744 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:15,744 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:15,744 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 189 [2021-03-25 14:29:15,745 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:15,821 INFO L129 PetriNetUnfolder]: 80/178 cut-off events. [2021-03-25 14:29:15,821 INFO L130 PetriNetUnfolder]: For 89/115 co-relation queries the response was YES. [2021-03-25 14:29:15,822 INFO L84 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 178 events. 80/178 cut-off events. For 89/115 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 801 event pairs, 9 based on Foata normal form. 7/179 useless extension candidates. Maximal degree in co-relation 459. Up to 106 conditions per place. [2021-03-25 14:29:15,823 INFO L132 encePairwiseOnDemand]: 182/189 looper letters, 14 selfloop transitions, 10 changer transitions 0/37 dead transitions. [2021-03-25 14:29:15,823 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 37 transitions, 177 flow [2021-03-25 14:29:15,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:29:15,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:29:15,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2021-03-25 14:29:15,825 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7682539682539683 [2021-03-25 14:29:15,825 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 726 transitions. [2021-03-25 14:29:15,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 726 transitions. [2021-03-25 14:29:15,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:15,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 726 transitions. [2021-03-25 14:29:15,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.2) internal successors, (726), 5 states have internal predecessors, (726), 0 states have call successors, (0), 0 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:29:15,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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:29:15,828 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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:29:15,828 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 96 flow. Second operand 5 states and 726 transitions. [2021-03-25 14:29:15,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 37 transitions, 177 flow [2021-03-25 14:29:15,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 37 transitions, 177 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:29:15,830 INFO L241 Difference]: Finished difference. Result has 41 places, 32 transitions, 157 flow [2021-03-25 14:29:15,830 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2021-03-25 14:29:15,830 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -11 predicate places. [2021-03-25 14:29:15,830 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:15,830 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 32 transitions, 157 flow [2021-03-25 14:29:15,831 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 32 transitions, 157 flow [2021-03-25 14:29:15,831 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 32 transitions, 157 flow [2021-03-25 14:29:15,847 INFO L129 PetriNetUnfolder]: 35/99 cut-off events. [2021-03-25 14:29:15,847 INFO L130 PetriNetUnfolder]: For 124/144 co-relation queries the response was YES. [2021-03-25 14:29:15,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 99 events. 35/99 cut-off events. For 124/144 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 398 event pairs, 9 based on Foata normal form. 1/93 useless extension candidates. Maximal degree in co-relation 285. Up to 49 conditions per place. [2021-03-25 14:29:15,848 INFO L142 LiptonReduction]: Number of co-enabled transitions 334 [2021-03-25 14:29:15,877 INFO L154 LiptonReduction]: Checked pairs total: 265 [2021-03-25 14:29:15,877 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:15,877 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 47 [2021-03-25 14:29:15,879 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 157 flow [2021-03-25 14:29:15,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:15,880 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:15,880 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:15,881 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:29:15,882 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:15,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:15,883 INFO L82 PathProgramCache]: Analyzing trace with hash -804960765, now seen corresponding path program 2 times [2021-03-25 14:29:15,883 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:15,883 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259454364] [2021-03-25 14:29:15,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:15,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:15,951 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:29:15,962 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 14:29:15,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:29:15,977 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 14:29:15,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 14:29:15,995 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:29:15,996 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:29:16,014 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:29:16,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259454364] [2021-03-25 14:29:16,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:16,015 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:29:16,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777470706] [2021-03-25 14:29:16,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:29:16,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:16,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:29:16,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:29:16,016 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 189 [2021-03-25 14:29:16,017 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:29:16,017 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:16,017 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 189 [2021-03-25 14:29:16,017 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:16,143 INFO L129 PetriNetUnfolder]: 97/201 cut-off events. [2021-03-25 14:29:16,143 INFO L130 PetriNetUnfolder]: For 374/462 co-relation queries the response was YES. [2021-03-25 14:29:16,144 INFO L84 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 201 events. 97/201 cut-off events. For 374/462 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 856 event pairs, 20 based on Foata normal form. 18/215 useless extension candidates. Maximal degree in co-relation 727. Up to 122 conditions per place. [2021-03-25 14:29:16,147 INFO L132 encePairwiseOnDemand]: 181/189 looper letters, 15 selfloop transitions, 18 changer transitions 0/46 dead transitions. [2021-03-25 14:29:16,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 46 transitions, 303 flow [2021-03-25 14:29:16,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:29:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:29:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 885 transitions. [2021-03-25 14:29:16,149 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7804232804232805 [2021-03-25 14:29:16,149 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 885 transitions. [2021-03-25 14:29:16,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 885 transitions. [2021-03-25 14:29:16,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:16,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 885 transitions. [2021-03-25 14:29:16,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.5) internal successors, (885), 6 states have internal predecessors, (885), 0 states have call successors, (0), 0 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:29:16,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:16,153 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:16,153 INFO L185 Difference]: Start difference. First operand has 41 places, 32 transitions, 157 flow. Second operand 6 states and 885 transitions. [2021-03-25 14:29:16,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 46 transitions, 303 flow [2021-03-25 14:29:16,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 46 transitions, 278 flow, removed 8 selfloop flow, removed 1 redundant places. [2021-03-25 14:29:16,158 INFO L241 Difference]: Finished difference. Result has 47 places, 43 transitions, 269 flow [2021-03-25 14:29:16,158 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=269, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2021-03-25 14:29:16,158 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2021-03-25 14:29:16,158 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:16,158 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 47 places, 43 transitions, 269 flow [2021-03-25 14:29:16,158 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 47 places, 43 transitions, 269 flow [2021-03-25 14:29:16,158 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 47 places, 43 transitions, 269 flow [2021-03-25 14:29:16,179 INFO L129 PetriNetUnfolder]: 88/193 cut-off events. [2021-03-25 14:29:16,179 INFO L130 PetriNetUnfolder]: For 365/393 co-relation queries the response was YES. [2021-03-25 14:29:16,180 INFO L84 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 193 events. 88/193 cut-off events. For 365/393 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 856 event pairs, 14 based on Foata normal form. 7/192 useless extension candidates. Maximal degree in co-relation 703. Up to 109 conditions per place. [2021-03-25 14:29:16,181 INFO L142 LiptonReduction]: Number of co-enabled transitions 382 [2021-03-25 14:29:16,208 INFO L154 LiptonReduction]: Checked pairs total: 385 [2021-03-25 14:29:16,208 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:16,209 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 51 [2021-03-25 14:29:16,209 INFO L480 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 269 flow [2021-03-25 14:29:16,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:29:16,210 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:16,210 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:16,210 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:29:16,210 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:16,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1120987389, now seen corresponding path program 3 times [2021-03-25 14:29:16,210 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:16,210 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247101849] [2021-03-25 14:29:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:16,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:16,252 INFO L142 QuantifierPusher]: treesize reduction 30, result has 25.0 percent of original size [2021-03-25 14:29:16,256 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:29:16,264 INFO L142 QuantifierPusher]: treesize reduction 40, result has 52.4 percent of original size [2021-03-25 14:29:16,266 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:29:16,278 INFO L142 QuantifierPusher]: treesize reduction 40, result has 54.0 percent of original size [2021-03-25 14:29:16,279 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 14:29:16,295 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.3 percent of original size [2021-03-25 14:29:16,296 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 36 [2021-03-25 14:29:16,315 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:29:16,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247101849] [2021-03-25 14:29:16,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:16,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:29:16,316 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672805877] [2021-03-25 14:29:16,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:29:16,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:16,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:29:16,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:29:16,318 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 189 [2021-03-25 14:29:16,319 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 269 flow. Second operand has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:29:16,319 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:16,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 189 [2021-03-25 14:29:16,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:16,429 INFO L129 PetriNetUnfolder]: 102/219 cut-off events. [2021-03-25 14:29:16,429 INFO L130 PetriNetUnfolder]: For 631/834 co-relation queries the response was YES. [2021-03-25 14:29:16,430 INFO L84 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 219 events. 102/219 cut-off events. For 631/834 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 977 event pairs, 9 based on Foata normal form. 39/255 useless extension candidates. Maximal degree in co-relation 972. Up to 128 conditions per place. [2021-03-25 14:29:16,432 INFO L132 encePairwiseOnDemand]: 182/189 looper letters, 19 selfloop transitions, 20 changer transitions 0/52 dead transitions. [2021-03-25 14:29:16,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 419 flow [2021-03-25 14:29:16,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:29:16,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:29:16,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 884 transitions. [2021-03-25 14:29:16,434 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7795414462081128 [2021-03-25 14:29:16,434 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 884 transitions. [2021-03-25 14:29:16,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 884 transitions. [2021-03-25 14:29:16,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:16,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 884 transitions. [2021-03-25 14:29:16,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 147.33333333333334) internal successors, (884), 6 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:16,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:16,438 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 189.0) internal successors, (1323), 7 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:16,438 INFO L185 Difference]: Start difference. First operand has 47 places, 43 transitions, 269 flow. Second operand 6 states and 884 transitions. [2021-03-25 14:29:16,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 419 flow [2021-03-25 14:29:16,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 410 flow, removed 4 selfloop flow, removed 1 redundant places. [2021-03-25 14:29:16,442 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 351 flow [2021-03-25 14:29:16,442 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=351, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2021-03-25 14:29:16,442 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2021-03-25 14:29:16,442 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:16,443 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 46 transitions, 351 flow [2021-03-25 14:29:16,443 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 46 transitions, 351 flow [2021-03-25 14:29:16,443 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 46 transitions, 351 flow [2021-03-25 14:29:16,467 INFO L129 PetriNetUnfolder]: 95/215 cut-off events. [2021-03-25 14:29:16,467 INFO L130 PetriNetUnfolder]: For 680/747 co-relation queries the response was YES. [2021-03-25 14:29:16,467 INFO L84 FinitePrefix]: Finished finitePrefix Result has 948 conditions, 215 events. 95/215 cut-off events. For 680/747 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 992 event pairs, 18 based on Foata normal form. 7/213 useless extension candidates. Maximal degree in co-relation 928. Up to 121 conditions per place. [2021-03-25 14:29:16,469 INFO L142 LiptonReduction]: Number of co-enabled transitions 412 [2021-03-25 14:29:16,475 INFO L154 LiptonReduction]: Checked pairs total: 672 [2021-03-25 14:29:16,475 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:16,475 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 14:29:16,476 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 351 flow [2021-03-25 14:29:16,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 144.83333333333334) internal successors, (869), 6 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:29:16,476 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:16,476 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:16,476 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:29:16,476 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:16,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash -863878737, now seen corresponding path program 1 times [2021-03-25 14:29:16,477 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:16,477 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259087188] [2021-03-25 14:29:16,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:16,517 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,519 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:16,522 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:29:16,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:29:16,529 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,530 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:16,530 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:29:16,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259087188] [2021-03-25 14:29:16,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:16,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:16,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752667741] [2021-03-25 14:29:16,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:16,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:16,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:16,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:16,532 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2021-03-25 14:29:16,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 351 flow. Second operand has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 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:29:16,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:16,532 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2021-03-25 14:29:16,532 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:16,588 INFO L129 PetriNetUnfolder]: 148/328 cut-off events. [2021-03-25 14:29:16,588 INFO L130 PetriNetUnfolder]: For 1017/1152 co-relation queries the response was YES. [2021-03-25 14:29:16,589 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 328 events. 148/328 cut-off events. For 1017/1152 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 1817 event pairs, 40 based on Foata normal form. 80/395 useless extension candidates. Maximal degree in co-relation 1267. Up to 151 conditions per place. [2021-03-25 14:29:16,591 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 10 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2021-03-25 14:29:16,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 391 flow [2021-03-25 14:29:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:29:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:29:16,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 793 transitions. [2021-03-25 14:29:16,593 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8391534391534392 [2021-03-25 14:29:16,593 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 793 transitions. [2021-03-25 14:29:16,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 793 transitions. [2021-03-25 14:29:16,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:16,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 793 transitions. [2021-03-25 14:29:16,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 158.6) internal successors, (793), 5 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:16,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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:29:16,596 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 189.0) internal successors, (1134), 6 states have internal predecessors, (1134), 0 states have call successors, (0), 0 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:29:16,596 INFO L185 Difference]: Start difference. First operand has 52 places, 46 transitions, 351 flow. Second operand 5 states and 793 transitions. [2021-03-25 14:29:16,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 391 flow [2021-03-25 14:29:16,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 354 flow, removed 9 selfloop flow, removed 4 redundant places. [2021-03-25 14:29:16,598 INFO L241 Difference]: Finished difference. Result has 55 places, 51 transitions, 366 flow [2021-03-25 14:29:16,599 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=366, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2021-03-25 14:29:16,599 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 3 predicate places. [2021-03-25 14:29:16,599 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:16,599 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 55 places, 51 transitions, 366 flow [2021-03-25 14:29:16,599 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 55 places, 51 transitions, 366 flow [2021-03-25 14:29:16,599 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 55 places, 51 transitions, 366 flow [2021-03-25 14:29:16,628 INFO L129 PetriNetUnfolder]: 152/338 cut-off events. [2021-03-25 14:29:16,628 INFO L130 PetriNetUnfolder]: For 823/916 co-relation queries the response was YES. [2021-03-25 14:29:16,629 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 338 events. 152/338 cut-off events. For 823/916 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 1859 event pairs, 45 based on Foata normal form. 29/350 useless extension candidates. Maximal degree in co-relation 1314. Up to 159 conditions per place. [2021-03-25 14:29:16,631 INFO L142 LiptonReduction]: Number of co-enabled transitions 522 [2021-03-25 14:29:16,635 INFO L154 LiptonReduction]: Checked pairs total: 385 [2021-03-25 14:29:16,635 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:16,636 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 37 [2021-03-25 14:29:16,636 INFO L480 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 366 flow [2021-03-25 14:29:16,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 155.75) internal successors, (623), 4 states have internal predecessors, (623), 0 states have call successors, (0), 0 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:29:16,636 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:16,636 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:16,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:29:16,636 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:16,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:16,637 INFO L82 PathProgramCache]: Analyzing trace with hash 949960706, now seen corresponding path program 1 times [2021-03-25 14:29:16,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:16,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123543825] [2021-03-25 14:29:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:16,693 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:16,695 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,696 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:16,698 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:29:16,699 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:29:16,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,703 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:16,704 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:29:16,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123543825] [2021-03-25 14:29:16,704 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:16,704 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:29:16,704 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64585757] [2021-03-25 14:29:16,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:29:16,705 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:16,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:29:16,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:29:16,706 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2021-03-25 14:29:16,706 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 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:29:16,706 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:16,706 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2021-03-25 14:29:16,706 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:16,755 INFO L129 PetriNetUnfolder]: 68/205 cut-off events. [2021-03-25 14:29:16,756 INFO L130 PetriNetUnfolder]: For 791/1129 co-relation queries the response was YES. [2021-03-25 14:29:16,756 INFO L84 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 205 events. 68/205 cut-off events. For 791/1129 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1124 event pairs, 7 based on Foata normal form. 156/351 useless extension candidates. Maximal degree in co-relation 823. Up to 95 conditions per place. [2021-03-25 14:29:16,757 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 6 selfloop transitions, 15 changer transitions 3/56 dead transitions. [2021-03-25 14:29:16,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 56 transitions, 427 flow [2021-03-25 14:29:16,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:29:16,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:29:16,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1110 transitions. [2021-03-25 14:29:16,759 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8390022675736961 [2021-03-25 14:29:16,759 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1110 transitions. [2021-03-25 14:29:16,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1110 transitions. [2021-03-25 14:29:16,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:16,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1110 transitions. [2021-03-25 14:29:16,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 158.57142857142858) internal successors, (1110), 7 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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:29:16,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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:29:16,763 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 189.0) internal successors, (1512), 8 states have internal predecessors, (1512), 0 states have call successors, (0), 0 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:29:16,763 INFO L185 Difference]: Start difference. First operand has 55 places, 51 transitions, 366 flow. Second operand 7 states and 1110 transitions. [2021-03-25 14:29:16,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 56 transitions, 427 flow [2021-03-25 14:29:16,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 56 transitions, 407 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-25 14:29:16,766 INFO L241 Difference]: Finished difference. Result has 61 places, 53 transitions, 404 flow [2021-03-25 14:29:16,767 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2021-03-25 14:29:16,767 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2021-03-25 14:29:16,767 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:16,767 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 53 transitions, 404 flow [2021-03-25 14:29:16,767 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 53 transitions, 404 flow [2021-03-25 14:29:16,767 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 53 transitions, 404 flow [2021-03-25 14:29:16,782 INFO L129 PetriNetUnfolder]: 64/199 cut-off events. [2021-03-25 14:29:16,782 INFO L130 PetriNetUnfolder]: For 717/826 co-relation queries the response was YES. [2021-03-25 14:29:16,783 INFO L84 FinitePrefix]: Finished finitePrefix Result has 864 conditions, 199 events. 64/199 cut-off events. For 717/826 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1077 event pairs, 9 based on Foata normal form. 20/211 useless extension candidates. Maximal degree in co-relation 839. Up to 89 conditions per place. [2021-03-25 14:29:16,784 INFO L142 LiptonReduction]: Number of co-enabled transitions 568 [2021-03-25 14:29:16,788 INFO L154 LiptonReduction]: Checked pairs total: 345 [2021-03-25 14:29:16,788 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:16,788 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 14:29:16,788 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 404 flow [2021-03-25 14:29:16,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 0 states have call successors, (0), 0 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:29:16,789 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:16,789 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:29:16,789 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:29:16,789 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:16,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:16,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1900482053, now seen corresponding path program 1 times [2021-03-25 14:29:16,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:16,789 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469498676] [2021-03-25 14:29:16,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:16,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:16,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:16,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:16,829 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:29:16,829 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469498676] [2021-03-25 14:29:16,830 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:16,830 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:16,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894142923] [2021-03-25 14:29:16,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:16,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:16,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:16,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:16,831 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 189 [2021-03-25 14:29:16,832 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 404 flow. Second operand has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:29:16,832 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:16,832 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 189 [2021-03-25 14:29:16,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:16,871 INFO L129 PetriNetUnfolder]: 110/333 cut-off events. [2021-03-25 14:29:16,871 INFO L130 PetriNetUnfolder]: For 1404/1677 co-relation queries the response was YES. [2021-03-25 14:29:16,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 333 events. 110/333 cut-off events. For 1404/1677 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2134 event pairs, 10 based on Foata normal form. 44/356 useless extension candidates. Maximal degree in co-relation 1432. Up to 160 conditions per place. [2021-03-25 14:29:16,873 INFO L132 encePairwiseOnDemand]: 186/189 looper letters, 3 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2021-03-25 14:29:16,873 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 416 flow [2021-03-25 14:29:16,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:29:16,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:29:16,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2021-03-25 14:29:16,875 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8492063492063492 [2021-03-25 14:29:16,875 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 642 transitions. [2021-03-25 14:29:16,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 642 transitions. [2021-03-25 14:29:16,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:16,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 642 transitions. [2021-03-25 14:29:16,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.5) internal successors, (642), 4 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:29:16,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 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:29:16,878 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 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:29:16,878 INFO L185 Difference]: Start difference. First operand has 61 places, 53 transitions, 404 flow. Second operand 4 states and 642 transitions. [2021-03-25 14:29:16,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 416 flow [2021-03-25 14:29:16,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 381 flow, removed 13 selfloop flow, removed 2 redundant places. [2021-03-25 14:29:16,882 INFO L241 Difference]: Finished difference. Result has 64 places, 54 transitions, 382 flow [2021-03-25 14:29:16,882 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=369, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=382, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2021-03-25 14:29:16,883 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 12 predicate places. [2021-03-25 14:29:16,883 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:16,883 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 64 places, 54 transitions, 382 flow [2021-03-25 14:29:16,883 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 64 places, 54 transitions, 382 flow [2021-03-25 14:29:16,883 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 54 transitions, 382 flow [2021-03-25 14:29:16,907 INFO L129 PetriNetUnfolder]: 110/334 cut-off events. [2021-03-25 14:29:16,907 INFO L130 PetriNetUnfolder]: For 988/1101 co-relation queries the response was YES. [2021-03-25 14:29:16,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 334 events. 110/334 cut-off events. For 988/1101 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2113 event pairs, 14 based on Foata normal form. 37/353 useless extension candidates. Maximal degree in co-relation 1264. Up to 98 conditions per place. [2021-03-25 14:29:16,910 INFO L142 LiptonReduction]: Number of co-enabled transitions 580 [2021-03-25 14:29:16,914 INFO L154 LiptonReduction]: Checked pairs total: 202 [2021-03-25 14:29:16,914 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:29:16,914 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 31 [2021-03-25 14:29:16,916 INFO L480 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 382 flow [2021-03-25 14:29:16,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 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:29:16,916 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:16,916 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:29:16,916 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:29:16,917 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:16,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:16,917 INFO L82 PathProgramCache]: Analyzing trace with hash -457155589, now seen corresponding path program 2 times [2021-03-25 14:29:16,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:16,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940842757] [2021-03-25 14:29:16,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:16,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:16,980 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:16,982 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,983 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:16,987 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:29:16,987 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:29:16,992 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:16,992 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:16,992 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:29:16,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940842757] [2021-03-25 14:29:16,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:16,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:29:16,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335658744] [2021-03-25 14:29:16,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:29:16,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:16,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:29:16,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:29:16,994 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 189 [2021-03-25 14:29:16,995 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 382 flow. Second operand has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 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:29:16,995 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:16,995 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 189 [2021-03-25 14:29:16,995 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:17,066 INFO L129 PetriNetUnfolder]: 87/282 cut-off events. [2021-03-25 14:29:17,066 INFO L130 PetriNetUnfolder]: For 1287/1857 co-relation queries the response was YES. [2021-03-25 14:29:17,067 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 282 events. 87/282 cut-off events. For 1287/1857 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 1831 event pairs, 3 based on Foata normal form. 262/525 useless extension candidates. Maximal degree in co-relation 1158. Up to 65 conditions per place. [2021-03-25 14:29:17,068 INFO L132 encePairwiseOnDemand]: 183/189 looper letters, 2 selfloop transitions, 19 changer transitions 5/57 dead transitions. [2021-03-25 14:29:17,068 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 57 transitions, 448 flow [2021-03-25 14:29:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-03-25 14:29:17,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-03-25 14:29:17,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1421 transitions. [2021-03-25 14:29:17,071 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8353909465020576 [2021-03-25 14:29:17,071 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1421 transitions. [2021-03-25 14:29:17,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1421 transitions. [2021-03-25 14:29:17,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:17,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1421 transitions. [2021-03-25 14:29:17,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 157.88888888888889) internal successors, (1421), 9 states have internal predecessors, (1421), 0 states have call successors, (0), 0 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:29:17,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 0 states have call successors, (0), 0 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:29:17,076 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 189.0) internal successors, (1890), 10 states have internal predecessors, (1890), 0 states have call successors, (0), 0 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:29:17,076 INFO L185 Difference]: Start difference. First operand has 64 places, 54 transitions, 382 flow. Second operand 9 states and 1421 transitions. [2021-03-25 14:29:17,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 57 transitions, 448 flow [2021-03-25 14:29:17,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 57 transitions, 431 flow, removed 5 selfloop flow, removed 3 redundant places. [2021-03-25 14:29:17,079 INFO L241 Difference]: Finished difference. Result has 72 places, 52 transitions, 401 flow [2021-03-25 14:29:17,080 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=189, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=401, PETRI_PLACES=72, PETRI_TRANSITIONS=52} [2021-03-25 14:29:17,119 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 20 predicate places. [2021-03-25 14:29:17,119 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:17,119 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 72 places, 52 transitions, 401 flow [2021-03-25 14:29:17,119 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 72 places, 52 transitions, 401 flow [2021-03-25 14:29:17,120 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 71 places, 52 transitions, 401 flow [2021-03-25 14:29:17,144 INFO L129 PetriNetUnfolder]: 80/267 cut-off events. [2021-03-25 14:29:17,144 INFO L130 PetriNetUnfolder]: For 939/1040 co-relation queries the response was YES. [2021-03-25 14:29:17,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 267 events. 80/267 cut-off events. For 939/1040 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1711 event pairs, 4 based on Foata normal form. 27/279 useless extension candidates. Maximal degree in co-relation 1099. Up to 65 conditions per place. [2021-03-25 14:29:17,147 INFO L142 LiptonReduction]: Number of co-enabled transitions 548 [2021-03-25 14:29:17,417 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:29:17,549 WARN L205 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2021-03-25 14:29:18,109 WARN L205 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 196 [2021-03-25 14:29:18,316 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:29:20,026 WARN L205 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 350 DAG size of output: 278 [2021-03-25 14:29:20,504 WARN L205 SmtUtils]: Spent 476.00 ms on a formula simplification that was a NOOP. DAG size: 258 [2021-03-25 14:29:20,511 INFO L154 LiptonReduction]: Checked pairs total: 425 [2021-03-25 14:29:20,511 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 14:29:20,511 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3392 [2021-03-25 14:29:20,511 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 47 transitions, 371 flow [2021-03-25 14:29:20,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 155.83333333333334) internal successors, (935), 6 states have internal predecessors, (935), 0 states have call successors, (0), 0 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:29:20,512 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:20,512 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:29:20,512 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:29:20,512 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:20,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:20,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1743691073, now seen corresponding path program 1 times [2021-03-25 14:29:20,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:20,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078140478] [2021-03-25 14:29:20,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:20,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:29:20,538 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:20,538 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:29:20,539 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:20,539 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:20,541 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:29:20,541 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:29:20,543 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:29:20,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078140478] [2021-03-25 14:29:20,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:29:20,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:29:20,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568844581] [2021-03-25 14:29:20,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:29:20,544 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:29:20,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:29:20,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:29:20,545 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 191 [2021-03-25 14:29:20,545 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 47 transitions, 371 flow. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:20,545 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:29:20,545 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 191 [2021-03-25 14:29:20,545 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:29:20,579 INFO L129 PetriNetUnfolder]: 104/284 cut-off events. [2021-03-25 14:29:20,579 INFO L130 PetriNetUnfolder]: For 1687/1772 co-relation queries the response was YES. [2021-03-25 14:29:20,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1199 conditions, 284 events. 104/284 cut-off events. For 1687/1772 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1599 event pairs, 7 based on Foata normal form. 36/310 useless extension candidates. Maximal degree in co-relation 1168. Up to 101 conditions per place. [2021-03-25 14:29:20,580 INFO L132 encePairwiseOnDemand]: 188/191 looper letters, 3 selfloop transitions, 1 changer transitions 11/42 dead transitions. [2021-03-25 14:29:20,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 42 transitions, 326 flow [2021-03-25 14:29:20,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:29:20,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:29:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 662 transitions. [2021-03-25 14:29:20,582 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8664921465968587 [2021-03-25 14:29:20,582 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 662 transitions. [2021-03-25 14:29:20,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 662 transitions. [2021-03-25 14:29:20,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:29:20,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 662 transitions. [2021-03-25 14:29:20,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.5) internal successors, (662), 4 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:29:20,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 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:29:20,585 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 0 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:29:20,585 INFO L185 Difference]: Start difference. First operand has 69 places, 47 transitions, 371 flow. Second operand 4 states and 662 transitions. [2021-03-25 14:29:20,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 42 transitions, 326 flow [2021-03-25 14:29:20,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 42 transitions, 278 flow, removed 15 selfloop flow, removed 10 redundant places. [2021-03-25 14:29:20,588 INFO L241 Difference]: Finished difference. Result has 57 places, 31 transitions, 193 flow [2021-03-25 14:29:20,588 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2021-03-25 14:29:20,588 INFO L343 CegarLoopForPetriNet]: 52 programPoint places, 5 predicate places. [2021-03-25 14:29:20,588 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:29:20,588 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 31 transitions, 193 flow [2021-03-25 14:29:20,588 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 31 transitions, 193 flow [2021-03-25 14:29:20,588 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 31 transitions, 193 flow [2021-03-25 14:29:20,595 INFO L129 PetriNetUnfolder]: 26/96 cut-off events. [2021-03-25 14:29:20,595 INFO L130 PetriNetUnfolder]: For 200/208 co-relation queries the response was YES. [2021-03-25 14:29:20,596 INFO L84 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 96 events. 26/96 cut-off events. For 200/208 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 348 event pairs, 0 based on Foata normal form. 5/99 useless extension candidates. Maximal degree in co-relation 335. Up to 32 conditions per place. [2021-03-25 14:29:20,596 INFO L142 LiptonReduction]: Number of co-enabled transitions 166 [2021-03-25 14:29:20,648 INFO L154 LiptonReduction]: Checked pairs total: 40 [2021-03-25 14:29:20,648 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:29:20,648 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 60 [2021-03-25 14:29:20,648 INFO L480 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 194 flow [2021-03-25 14:29:20,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:29:20,649 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:29:20,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] [2021-03-25 14:29:20,649 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:29:20,649 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:29:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:29:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1061051988, now seen corresponding path program 1 times [2021-03-25 14:29:20,649 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:29:20,649 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924986176] [2021-03-25 14:29:20,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:29:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:29:20,675 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:29:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:29:20,702 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:29:20,734 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:29:20,734 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:29:20,734 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:29:20,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:29:20 BasicIcfg [2021-03-25 14:29:20,795 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:29:20,795 INFO L168 Benchmark]: Toolchain (without parser) took 18392.56 ms. Allocated memory was 383.8 MB in the beginning and 690.0 MB in the end (delta: 306.2 MB). Free memory was 347.0 MB in the beginning and 288.0 MB in the end (delta: 58.9 MB). Peak memory consumption was 366.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:20,796 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 383.8 MB. Free memory was 365.1 MB in the beginning and 365.1 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:29:20,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.02 ms. Allocated memory is still 383.8 MB. Free memory was 346.8 MB in the beginning and 342.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:20,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.78 ms. Allocated memory is still 383.8 MB. Free memory was 342.5 MB in the beginning and 339.4 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:29:20,796 INFO L168 Benchmark]: Boogie Preprocessor took 29.16 ms. Allocated memory is still 383.8 MB. Free memory was 339.4 MB in the beginning and 337.3 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:29:20,796 INFO L168 Benchmark]: RCFGBuilder took 1282.10 ms. Allocated memory is still 383.8 MB. Free memory was 337.3 MB in the beginning and 292.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:20,796 INFO L168 Benchmark]: TraceAbstraction took 16644.92 ms. Allocated memory was 383.8 MB in the beginning and 690.0 MB in the end (delta: 306.2 MB). Free memory was 292.1 MB in the beginning and 288.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 309.2 MB. Max. memory is 16.0 GB. [2021-03-25 14:29:20,797 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.11 ms. Allocated memory is still 383.8 MB. Free memory was 365.1 MB in the beginning and 365.1 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 401.02 ms. Allocated memory is still 383.8 MB. Free memory was 346.8 MB in the beginning and 342.5 MB in the end (delta: 4.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 31.78 ms. Allocated memory is still 383.8 MB. Free memory was 342.5 MB in the beginning and 339.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 29.16 ms. Allocated memory is still 383.8 MB. Free memory was 339.4 MB in the beginning and 337.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1282.10 ms. Allocated memory is still 383.8 MB. Free memory was 337.3 MB in the beginning and 292.1 MB in the end (delta: 45.1 MB). Peak memory consumption was 167.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16644.92 ms. Allocated memory was 383.8 MB in the beginning and 690.0 MB in the end (delta: 306.2 MB). Free memory was 292.1 MB in the beginning and 288.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 309.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6871.9ms, 111 PlacesBefore, 52 PlacesAfterwards, 103 TransitionsBefore, 43 TransitionsAfterwards, 2042 CoEnabledTransitionPairs, 5 FixpointIterations, 29 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 3464 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1526, positive: 1434, positive conditional: 0, positive unconditional: 1434, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1171, positive: 1134, positive conditional: 0, positive unconditional: 1134, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1171, positive: 1134, positive conditional: 0, positive unconditional: 1134, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1171, positive: 1130, positive conditional: 0, positive unconditional: 1130, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 41, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 524, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 515, negative conditional: 0, negative unconditional: 515, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1526, positive: 300, positive conditional: 0, positive unconditional: 300, negative: 55, negative conditional: 0, negative unconditional: 55, unknown: 1171, unknown conditional: 0, unknown unconditional: 1171] , Statistics on independence cache: Total cache size (in pairs): 126, Positive cache size: 101, Positive conditional cache size: 0, Positive unconditional cache size: 101, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2531.2ms, 49 PlacesBefore, 34 PlacesAfterwards, 36 TransitionsBefore, 25 TransitionsAfterwards, 322 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 11 TotalNumberOfCompositions, 1266 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 236, positive: 153, positive conditional: 0, positive unconditional: 153, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 61, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 61, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 61, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 15, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 233, positive: 58, positive conditional: 0, positive unconditional: 58, negative: 176, negative conditional: 0, negative unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 236, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 61, unknown conditional: 0, unknown unconditional: 61] , Statistics on independence cache: Total cache size (in pairs): 92, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1163.5ms, 35 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 21 TransitionsAfterwards, 214 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 771 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 162, positive: 102, positive conditional: 0, positive unconditional: 102, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 12, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 12, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 4, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 23, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 162, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 57, negative conditional: 0, negative unconditional: 57, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5ms, 32 PlacesBefore, 32 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 212 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 246 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 53, positive: 34, positive conditional: 0, positive unconditional: 34, 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: 0, 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: 53, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 19, negative conditional: 0, negative unconditional: 19, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 104, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 26.7ms, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 274 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 218 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 28, positive: 14, positive conditional: 0, positive unconditional: 14, 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: 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: 16, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 28, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 105, Positive cache size: 75, Positive conditional cache size: 0, Positive unconditional cache size: 75, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 46.2ms, 41 PlacesBefore, 41 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 334 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 265 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 77, positive: 62, positive conditional: 0, positive unconditional: 62, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, 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: 23, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 77, positive: 54, positive conditional: 0, positive unconditional: 54, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 32, Negative conditional cache size: 0, Negative unconditional cache size: 32 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 50.3ms, 47 PlacesBefore, 47 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 382 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 385 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 109, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 4, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 20, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 109, positive: 88, positive conditional: 0, positive unconditional: 88, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 4, unknown conditional: 0, unknown unconditional: 4] , Statistics on independence cache: Total cache size (in pairs): 119, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.5ms, 52 PlacesBefore, 52 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 412 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 672 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 182, positive: 154, positive conditional: 0, positive unconditional: 154, negative: 28, negative conditional: 0, negative unconditional: 28, 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: 182, positive: 152, positive conditional: 0, positive unconditional: 152, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 121, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 36.4ms, 55 PlacesBefore, 55 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 522 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 385 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 169, positive: 155, positive conditional: 0, positive unconditional: 155, 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: 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: 169, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 129, Positive cache size: 96, Positive conditional cache size: 0, Positive unconditional cache size: 96, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.8ms, 61 PlacesBefore, 61 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 568 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 345 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 175, positive: 163, positive conditional: 0, positive unconditional: 163, 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: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 175, positive: 160, positive conditional: 0, positive unconditional: 160, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 31.0ms, 64 PlacesBefore, 64 PlacesAfterwards, 54 TransitionsBefore, 54 TransitionsAfterwards, 580 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 202 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 90, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 7, negative conditional: 0, negative unconditional: 7, 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: 90, positive: 83, positive conditional: 0, positive unconditional: 83, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 132, Positive cache size: 99, Positive conditional cache size: 0, Positive unconditional cache size: 99, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3391.6ms, 72 PlacesBefore, 69 PlacesAfterwards, 52 TransitionsBefore, 47 TransitionsAfterwards, 548 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 3 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 425 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 178, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 178, positive: 163, positive conditional: 0, positive unconditional: 163, negative: 15, negative conditional: 0, negative unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 94, Positive cache size: 77, Positive conditional cache size: 0, Positive unconditional cache size: 77, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 59.6ms, 57 PlacesBefore, 51 PlacesAfterwards, 31 TransitionsBefore, 30 TransitionsAfterwards, 166 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 40 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 40, positive: 39, positive conditional: 0, positive unconditional: 39, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 5, positive: 4, positive conditional: 0, positive unconditional: 4, 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: 3, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 40, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 56, Positive conditional cache size: 0, Positive unconditional cache size: 56, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L726] 0 _Bool x$flush_delayed; [L727] 0 int x$mem_tmp; [L728] 0 _Bool x$r_buff0_thd0; [L729] 0 _Bool x$r_buff0_thd1; [L730] 0 _Bool x$r_buff0_thd2; [L731] 0 _Bool x$r_buff0_thd3; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$read_delayed; [L737] 0 int *x$read_delayed_var; [L738] 0 int x$w_buff0; [L739] 0 _Bool x$w_buff0_used; [L740] 0 int x$w_buff1; [L741] 0 _Bool x$w_buff1_used; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L840] 0 pthread_t t891; [L841] FCALL, FORK 0 pthread_create(&t891, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L842] 0 pthread_t t892; [L843] FCALL, FORK 0 pthread_create(&t892, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L844] 0 pthread_t t893; [L845] FCALL, FORK 0 pthread_create(&t893, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 2 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L780] 2 x$r_buff0_thd2 = (_Bool)1 [L783] 2 y = 1 [L786] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L806] 3 z = 1 [L809] 3 a = 1 [L812] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L815] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L818] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L818] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L819] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L819] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L820] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L821] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L822] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L761] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L761] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L847] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L851] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L851] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L852] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L852] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L853] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L853] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L854] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L854] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L855] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L855] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 x$flush_delayed = weak$$choice2 [L861] 0 x$mem_tmp = x [L862] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L862] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L863] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L863] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L864] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L864] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L865] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L865] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L867] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L868] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L870] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L870] 0 x = x$flush_delayed ? x$mem_tmp : x [L871] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=55, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 105 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 2.4ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16515.7ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 951.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6954.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 41 SDtfs, 28 SDslu, 17 SDs, 0 SdLazy, 274 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 257.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 297.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=9, InterpolantAutomatonStates: 59, 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: 29.7ms SsaConstructionTime, 315.8ms SatisfiabilityAnalysisTime, 653.4ms InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...