/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/mix044_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 14:33:42,629 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 14:33:42,631 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 14:33:42,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 14:33:42,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 14:33:42,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 14:33:42,664 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 14:33:42,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 14:33:42,669 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 14:33:42,672 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 14:33:42,673 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 14:33:42,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 14:33:42,674 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 14:33:42,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 14:33:42,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 14:33:42,679 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 14:33:42,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 14:33:42,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 14:33:42,683 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 14:33:42,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 14:33:42,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 14:33:42,688 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 14:33:42,689 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 14:33:42,690 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 14:33:42,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 14:33:42,695 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 14:33:42,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 14:33:42,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 14:33:42,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 14:33:42,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 14:33:42,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 14:33:42,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 14:33:42,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 14:33:42,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 14:33:42,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 14:33:42,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 14:33:42,700 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 14:33:42,700 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 14:33:42,700 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 14:33:42,701 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 14:33:42,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 14:33:42,704 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:33:42,730 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 14:33:42,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 14:33:42,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 14:33:42,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 14:33:42,733 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 14:33:42,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 14:33:42,734 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 14:33:42,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 14:33:42,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 14:33:42,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 14:33:42,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 14:33:42,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 14:33:42,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 14:33:42,735 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 14:33:42,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 14:33:42,735 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 14:33:42,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 14:33:42,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 14:33:42,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 14:33:42,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 14:33:42,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 14:33:42,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 14:33:42,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 14:33:42,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 14:33:42,736 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 14:33:42,736 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 14:33:42,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 14:33:42,737 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 14:33:42,737 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 14:33:42,737 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:33:42,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 14:33:43,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 14:33:43,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 14:33:43,003 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 14:33:43,003 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 14:33:43,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i [2021-03-25 14:33:43,047 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff18933eb/10f38cc4d4554c209b98c10e0091b272/FLAGc9c693b22 [2021-03-25 14:33:43,455 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 14:33:43,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_tso.opt.i [2021-03-25 14:33:43,471 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff18933eb/10f38cc4d4554c209b98c10e0091b272/FLAGc9c693b22 [2021-03-25 14:33:43,783 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff18933eb/10f38cc4d4554c209b98c10e0091b272 [2021-03-25 14:33:43,785 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 14:33:43,786 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 14:33:43,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 14:33:43,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 14:33:43,789 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 14:33:43,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:33:43" (1/1) ... [2021-03-25 14:33:43,793 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@796b47e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:43, skipping insertion in model container [2021-03-25 14:33:43,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 02:33:43" (1/1) ... [2021-03-25 14:33:43,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 14:33:43,821 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 14:33:43,930 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/mix044_tso.opt.i[948,961] [2021-03-25 14:33:44,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:33:44,121 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 14:33:44,130 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/mix044_tso.opt.i[948,961] [2021-03-25 14:33:44,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 14:33:44,230 INFO L208 MainTranslator]: Completed translation [2021-03-25 14:33:44,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44 WrapperNode [2021-03-25 14:33:44,231 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 14:33:44,232 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 14:33:44,232 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 14:33:44,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 14:33:44,237 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:33:44" (1/1) ... [2021-03-25 14:33:44,261 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:33:44" (1/1) ... [2021-03-25 14:33:44,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 14:33:44,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 14:33:44,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 14:33:44,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 14:33:44,301 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (1/1) ... [2021-03-25 14:33:44,301 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (1/1) ... [2021-03-25 14:33:44,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (1/1) ... [2021-03-25 14:33:44,309 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (1/1) ... [2021-03-25 14:33:44,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (1/1) ... [2021-03-25 14:33:44,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (1/1) ... [2021-03-25 14:33:44,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (1/1) ... [2021-03-25 14:33:44,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 14:33:44,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 14:33:44,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 14:33:44,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 14:33:44,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (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:33:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 14:33:44,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 14:33:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 14:33:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 14:33:44,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 14:33:44,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 14:33:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 14:33:44,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 14:33:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 14:33:44,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 14:33:44,384 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-03-25 14:33:44,384 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-03-25 14:33:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 14:33:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 14:33:44,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 14:33:44,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 14:33:44,386 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:33:45,601 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 14:33:45,601 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 14:33:45,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:33:45 BoogieIcfgContainer [2021-03-25 14:33:45,602 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 14:33:45,603 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 14:33:45,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 14:33:45,605 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 14:33:45,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 02:33:43" (1/3) ... [2021-03-25 14:33:45,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dec9753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:33:45, skipping insertion in model container [2021-03-25 14:33:45,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 02:33:44" (2/3) ... [2021-03-25 14:33:45,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dec9753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 02:33:45, skipping insertion in model container [2021-03-25 14:33:45,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 02:33:45" (3/3) ... [2021-03-25 14:33:45,607 INFO L111 eAbstractionObserver]: Analyzing ICFG mix044_tso.opt.i [2021-03-25 14:33:45,611 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 14:33:45,618 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 14:33:45,619 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 14:33:45,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,641 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,641 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,641 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,642 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,645 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,646 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,651 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,651 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,652 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,652 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,653 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,653 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,654 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,655 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,656 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 14:33:45,657 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 14:33:45,669 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-03-25 14:33:45,681 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 14:33:45,681 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 14:33:45,682 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 14:33:45,682 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 14:33:45,682 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 14:33:45,682 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 14:33:45,682 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 14:33:45,682 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 14:33:45,689 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:33:45,715 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:33:45,715 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:45,718 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:33:45,718 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 117 transitions, 254 flow [2021-03-25 14:33:45,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 113 transitions, 238 flow [2021-03-25 14:33:45,722 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:45,730 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:33:45,731 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 113 transitions, 238 flow [2021-03-25 14:33:45,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 113 transitions, 238 flow [2021-03-25 14:33:45,746 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-03-25 14:33:45,746 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:45,747 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 82 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2021-03-25 14:33:45,749 INFO L142 LiptonReduction]: Number of co-enabled transitions 2598 [2021-03-25 14:33:46,976 WARN L205 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 14:33:47,358 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-03-25 14:33:47,463 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-03-25 14:33:48,052 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2021-03-25 14:33:48,519 WARN L205 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2021-03-25 14:33:49,611 WARN L205 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 314 DAG size of output: 270 [2021-03-25 14:33:50,085 WARN L205 SmtUtils]: Spent 470.00 ms on a formula simplification that was a NOOP. DAG size: 267 [2021-03-25 14:33:51,073 WARN L205 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:33:51,304 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 189 [2021-03-25 14:33:52,467 WARN L205 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 269 DAG size of output: 268 [2021-03-25 14:33:53,015 WARN L205 SmtUtils]: Spent 545.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2021-03-25 14:33:53,180 INFO L154 LiptonReduction]: Checked pairs total: 4166 [2021-03-25 14:33:53,181 INFO L156 LiptonReduction]: Total number of compositions: 74 [2021-03-25 14:33:53,182 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7461 [2021-03-25 14:33:53,189 INFO L129 PetriNetUnfolder]: 0/32 cut-off events. [2021-03-25 14:33:53,189 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:53,190 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:53,190 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:53,190 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:53,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1459371111, now seen corresponding path program 1 times [2021-03-25 14:33:53,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:53,199 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961502504] [2021-03-25 14:33:53,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:53,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:53,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:53,399 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:53,400 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:53,400 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:53,407 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:33:53,407 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961502504] [2021-03-25 14:33:53,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:53,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:33:53,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535215922] [2021-03-25 14:33:53,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:33:53,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:33:53,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:33:53,427 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 191 [2021-03-25 14:33:53,431 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:33:53,431 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:53,431 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 191 [2021-03-25 14:33:53,432 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:53,497 INFO L129 PetriNetUnfolder]: 23/111 cut-off events. [2021-03-25 14:33:53,497 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:53,498 INFO L84 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 111 events. 23/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 394 event pairs, 3 based on Foata normal form. 6/110 useless extension candidates. Maximal degree in co-relation 148. Up to 37 conditions per place. [2021-03-25 14:33:53,499 INFO L132 encePairwiseOnDemand]: 187/191 looper letters, 7 selfloop transitions, 2 changer transitions 5/49 dead transitions. [2021-03-25 14:33:53,499 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 49 transitions, 132 flow [2021-03-25 14:33:53,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:53,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2021-03-25 14:33:53,513 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9144851657940664 [2021-03-25 14:33:53,513 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 524 transitions. [2021-03-25 14:33:53,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 524 transitions. [2021-03-25 14:33:53,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:53,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 524 transitions. [2021-03-25 14:33:53,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 0 states have call successors, (0), 0 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:33:53,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 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:33:53,533 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 191.0) internal successors, (764), 4 states have internal predecessors, (764), 0 states have call successors, (0), 0 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:33:53,534 INFO L185 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 3 states and 524 transitions. [2021-03-25 14:33:53,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 49 transitions, 132 flow [2021-03-25 14:33:53,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 49 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2021-03-25 14:33:53,538 INFO L241 Difference]: Finished difference. Result has 56 places, 41 transitions, 94 flow [2021-03-25 14:33:53,539 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=191, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2021-03-25 14:33:53,539 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -4 predicate places. [2021-03-25 14:33:53,539 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:53,540 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 14:33:53,541 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 56 places, 41 transitions, 94 flow [2021-03-25 14:33:53,541 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 41 transitions, 94 flow [2021-03-25 14:33:53,552 INFO L129 PetriNetUnfolder]: 0/41 cut-off events. [2021-03-25 14:33:53,552 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:53,552 INFO L84 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 41 events. 0/41 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 14:33:53,553 INFO L142 LiptonReduction]: Number of co-enabled transitions 392 [2021-03-25 14:33:53,857 WARN L205 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:33:54,190 WARN L205 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2021-03-25 14:33:54,811 WARN L205 SmtUtils]: Spent 619.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 14:33:55,383 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 270 [2021-03-25 14:33:56,492 INFO L154 LiptonReduction]: Checked pairs total: 1274 [2021-03-25 14:33:56,493 INFO L156 LiptonReduction]: Total number of compositions: 12 [2021-03-25 14:33:56,493 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2954 [2021-03-25 14:33:56,494 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 70 flow [2021-03-25 14:33:56,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 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:33:56,494 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:56,494 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:56,494 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 14:33:56,494 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:56,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:56,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1826671133, now seen corresponding path program 1 times [2021-03-25 14:33:56,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:56,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103348075] [2021-03-25 14:33:56,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:56,588 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:56,588 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:56,589 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:56,589 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:56,595 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 14:33:56,595 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 14:33:56,598 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:33:56,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103348075] [2021-03-25 14:33:56,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:56,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:56,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41060777] [2021-03-25 14:33:56,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:56,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:56,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:56,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:56,601 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 203 [2021-03-25 14:33:56,602 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:33:56,602 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:56,602 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 203 [2021-03-25 14:33:56,602 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:56,614 INFO L129 PetriNetUnfolder]: 3/39 cut-off events. [2021-03-25 14:33:56,614 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:56,615 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 1 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 50. Up to 10 conditions per place. [2021-03-25 14:33:56,615 INFO L132 encePairwiseOnDemand]: 199/203 looper letters, 3 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2021-03-25 14:33:56,615 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 86 flow [2021-03-25 14:33:56,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:56,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:56,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2021-03-25 14:33:56,617 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8981937602627258 [2021-03-25 14:33:56,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2021-03-25 14:33:56,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2021-03-25 14:33:56,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:56,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2021-03-25 14:33:56,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 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:33:56,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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:33:56,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 203.0) internal successors, (812), 4 states have internal predecessors, (812), 0 states have call successors, (0), 0 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:33:56,620 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 70 flow. Second operand 3 states and 547 transitions. [2021-03-25 14:33:56,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 86 flow [2021-03-25 14:33:56,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:56,621 INFO L241 Difference]: Finished difference. Result has 41 places, 31 transitions, 85 flow [2021-03-25 14:33:56,621 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=41, PETRI_TRANSITIONS=31} [2021-03-25 14:33:56,621 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -19 predicate places. [2021-03-25 14:33:56,622 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:56,622 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 31 transitions, 85 flow [2021-03-25 14:33:56,622 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 31 transitions, 85 flow [2021-03-25 14:33:56,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 31 transitions, 85 flow [2021-03-25 14:33:56,625 INFO L129 PetriNetUnfolder]: 3/37 cut-off events. [2021-03-25 14:33:56,625 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 14:33:56,626 INFO L84 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 37 events. 3/37 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 1 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 49. Up to 10 conditions per place. [2021-03-25 14:33:56,626 INFO L142 LiptonReduction]: Number of co-enabled transitions 388 [2021-03-25 14:33:57,387 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:33:57,572 WARN L205 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:33:57,901 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2021-03-25 14:33:58,052 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2021-03-25 14:33:58,056 INFO L154 LiptonReduction]: Checked pairs total: 1047 [2021-03-25 14:33:58,056 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:33:58,056 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1435 [2021-03-25 14:33:58,057 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 79 flow [2021-03-25 14:33:58,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 180.75) internal successors, (723), 4 states have internal predecessors, (723), 0 states have call successors, (0), 0 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:33:58,058 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:58,058 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:58,058 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 14:33:58,058 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:58,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:58,058 INFO L82 PathProgramCache]: Analyzing trace with hash 2131944862, now seen corresponding path program 1 times [2021-03-25 14:33:58,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:58,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603484194] [2021-03-25 14:33:58,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:58,130 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,132 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:58,134 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:33:58,134 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603484194] [2021-03-25 14:33:58,134 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:58,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-03-25 14:33:58,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093531727] [2021-03-25 14:33:58,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:33:58,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:58,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:33:58,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:33:58,138 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 206 [2021-03-25 14:33:58,139 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:33:58,139 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:58,139 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 206 [2021-03-25 14:33:58,139 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:58,159 INFO L129 PetriNetUnfolder]: 3/36 cut-off events. [2021-03-25 14:33:58,160 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 14:33:58,160 INFO L84 FinitePrefix]: Finished finitePrefix Result has 65 conditions, 36 events. 3/36 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 1 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 55. Up to 10 conditions per place. [2021-03-25 14:33:58,160 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 1 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2021-03-25 14:33:58,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 28 transitions, 85 flow [2021-03-25 14:33:58,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:58,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:58,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2021-03-25 14:33:58,164 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8996763754045307 [2021-03-25 14:33:58,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2021-03-25 14:33:58,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2021-03-25 14:33:58,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:58,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2021-03-25 14:33:58,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 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:33:58,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:33:58,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:33:58,167 INFO L185 Difference]: Start difference. First operand has 38 places, 28 transitions, 79 flow. Second operand 3 states and 556 transitions. [2021-03-25 14:33:58,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 28 transitions, 85 flow [2021-03-25 14:33:58,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 28 transitions, 82 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:58,168 INFO L241 Difference]: Finished difference. Result has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:58,168 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2021-03-25 14:33:58,168 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -20 predicate places. [2021-03-25 14:33:58,168 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:58,169 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:58,169 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:58,169 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:58,172 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-25 14:33:58,172 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-03-25 14:33:58,173 INFO L84 FinitePrefix]: Finished finitePrefix Result has 62 conditions, 34 events. 3/34 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 52. Up to 10 conditions per place. [2021-03-25 14:33:58,173 INFO L142 LiptonReduction]: Number of co-enabled transitions 386 [2021-03-25 14:33:58,174 INFO L154 LiptonReduction]: Checked pairs total: 333 [2021-03-25 14:33:58,174 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:58,174 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6 [2021-03-25 14:33:58,175 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 84 flow [2021-03-25 14:33:58,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:33:58,177 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:58,177 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:58,177 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 14:33:58,177 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:58,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1719635881, now seen corresponding path program 1 times [2021-03-25 14:33:58,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:58,178 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917082440] [2021-03-25 14:33:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:58,248 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,249 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:58,256 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 14:33:58,257 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 14:33:58,271 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,272 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-03-25 14:33:58,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917082440] [2021-03-25 14:33:58,272 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:58,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:33:58,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620763936] [2021-03-25 14:33:58,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:58,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:58,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:58,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:58,275 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2021-03-25 14:33:58,276 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:58,276 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:58,276 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2021-03-25 14:33:58,276 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:58,363 INFO L129 PetriNetUnfolder]: 37/112 cut-off events. [2021-03-25 14:33:58,363 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2021-03-25 14:33:58,367 INFO L84 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 112 events. 37/112 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 377 event pairs, 22 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 230. Up to 55 conditions per place. [2021-03-25 14:33:58,370 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 8 selfloop transitions, 5 changer transitions 0/34 dead transitions. [2021-03-25 14:33:58,370 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 125 flow [2021-03-25 14:33:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:33:58,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:33:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2021-03-25 14:33:58,377 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8228155339805825 [2021-03-25 14:33:58,377 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2021-03-25 14:33:58,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2021-03-25 14:33:58,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:58,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2021-03-25 14:33:58,391 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 0 states have call successors, (0), 0 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:33:58,392 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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:33:58,393 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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:33:58,398 INFO L185 Difference]: Start difference. First operand has 40 places, 28 transitions, 84 flow. Second operand 4 states and 678 transitions. [2021-03-25 14:33:58,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 125 flow [2021-03-25 14:33:58,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 119 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:58,400 INFO L241 Difference]: Finished difference. Result has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:58,401 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2021-03-25 14:33:58,401 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -17 predicate places. [2021-03-25 14:33:58,401 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:58,401 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:58,402 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:58,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:58,410 INFO L129 PetriNetUnfolder]: 9/53 cut-off events. [2021-03-25 14:33:58,410 INFO L130 PetriNetUnfolder]: For 34/37 co-relation queries the response was YES. [2021-03-25 14:33:58,411 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 53 events. 9/53 cut-off events. For 34/37 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 162 event pairs, 4 based on Foata normal form. 1/47 useless extension candidates. Maximal degree in co-relation 107. Up to 18 conditions per place. [2021-03-25 14:33:58,413 INFO L142 LiptonReduction]: Number of co-enabled transitions 468 [2021-03-25 14:33:58,447 INFO L154 LiptonReduction]: Checked pairs total: 353 [2021-03-25 14:33:58,447 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:58,447 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 46 [2021-03-25 14:33:58,453 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 113 flow [2021-03-25 14:33:58,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:33:58,454 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:58,454 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:58,454 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 14:33:58,455 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:58,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:58,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1193190939, now seen corresponding path program 1 times [2021-03-25 14:33:58,456 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:58,456 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208446045] [2021-03-25 14:33:58,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:58,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:58,586 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,586 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:33:58,594 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,594 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:33:58,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,600 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:58,607 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:33:58,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208446045] [2021-03-25 14:33:58,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:58,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:58,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285266862] [2021-03-25 14:33:58,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:58,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:58,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:58,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:58,609 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 206 [2021-03-25 14:33:58,610 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 113 flow. Second operand has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 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:33:58,610 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:58,610 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 206 [2021-03-25 14:33:58,610 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:58,669 INFO L129 PetriNetUnfolder]: 40/118 cut-off events. [2021-03-25 14:33:58,669 INFO L130 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2021-03-25 14:33:58,670 INFO L84 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 118 events. 40/118 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 414 event pairs, 8 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 284. Up to 54 conditions per place. [2021-03-25 14:33:58,670 INFO L132 encePairwiseOnDemand]: 200/206 looper letters, 10 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2021-03-25 14:33:58,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 168 flow [2021-03-25 14:33:58,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 846 transitions. [2021-03-25 14:33:58,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8213592233009709 [2021-03-25 14:33:58,673 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 846 transitions. [2021-03-25 14:33:58,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 846 transitions. [2021-03-25 14:33:58,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:58,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 846 transitions. [2021-03-25 14:33:58,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.2) internal successors, (846), 5 states have internal predecessors, (846), 0 states have call successors, (0), 0 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:33:58,676 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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:33:58,676 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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:33:58,676 INFO L185 Difference]: Start difference. First operand has 43 places, 32 transitions, 113 flow. Second operand 5 states and 846 transitions. [2021-03-25 14:33:58,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 168 flow [2021-03-25 14:33:58,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 168 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:58,679 INFO L241 Difference]: Finished difference. Result has 48 places, 36 transitions, 151 flow [2021-03-25 14:33:58,679 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2021-03-25 14:33:58,679 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -12 predicate places. [2021-03-25 14:33:58,679 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:58,679 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 48 places, 36 transitions, 151 flow [2021-03-25 14:33:58,680 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 48 places, 36 transitions, 151 flow [2021-03-25 14:33:58,680 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 48 places, 36 transitions, 151 flow [2021-03-25 14:33:58,687 INFO L129 PetriNetUnfolder]: 16/72 cut-off events. [2021-03-25 14:33:58,687 INFO L130 PetriNetUnfolder]: For 84/87 co-relation queries the response was YES. [2021-03-25 14:33:58,687 INFO L84 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 72 events. 16/72 cut-off events. For 84/87 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 255 event pairs, 4 based on Foata normal form. 1/64 useless extension candidates. Maximal degree in co-relation 174. Up to 25 conditions per place. [2021-03-25 14:33:58,688 INFO L142 LiptonReduction]: Number of co-enabled transitions 556 [2021-03-25 14:33:58,694 INFO L154 LiptonReduction]: Checked pairs total: 382 [2021-03-25 14:33:58,694 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:58,694 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 14:33:58,695 INFO L480 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 151 flow [2021-03-25 14:33:58,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 166.83333333333334) internal successors, (1001), 6 states have internal predecessors, (1001), 0 states have call successors, (0), 0 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:33:58,697 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:58,697 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:58,697 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 14:33:58,697 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash 565111697, now seen corresponding path program 2 times [2021-03-25 14:33:58,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:58,707 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208303336] [2021-03-25 14:33:58,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:58,772 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,773 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:58,775 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,775 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:58,777 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,778 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 14:33:58,783 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 14:33:58,790 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:33:58,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208303336] [2021-03-25 14:33:58,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:58,791 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:58,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524561802] [2021-03-25 14:33:58,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:33:58,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:58,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:33:58,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:33:58,792 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:33:58,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:33:58,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:58,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:33:58,794 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:58,839 INFO L129 PetriNetUnfolder]: 35/112 cut-off events. [2021-03-25 14:33:58,839 INFO L130 PetriNetUnfolder]: For 144/144 co-relation queries the response was YES. [2021-03-25 14:33:58,840 INFO L84 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 112 events. 35/112 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 400 event pairs, 12 based on Foata normal form. 2/105 useless extension candidates. Maximal degree in co-relation 309. Up to 48 conditions per place. [2021-03-25 14:33:58,840 INFO L132 encePairwiseOnDemand]: 201/206 looper letters, 9 selfloop transitions, 9 changer transitions 0/39 dead transitions. [2021-03-25 14:33:58,840 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 39 transitions, 199 flow [2021-03-25 14:33:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:33:58,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:33:58,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 696 transitions. [2021-03-25 14:33:58,842 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8446601941747572 [2021-03-25 14:33:58,842 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 696 transitions. [2021-03-25 14:33:58,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 696 transitions. [2021-03-25 14:33:58,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:58,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 696 transitions. [2021-03-25 14:33:58,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 174.0) internal successors, (696), 4 states have internal predecessors, (696), 0 states have call successors, (0), 0 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:33:58,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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:33:58,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 0 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:33:58,845 INFO L185 Difference]: Start difference. First operand has 48 places, 36 transitions, 151 flow. Second operand 4 states and 696 transitions. [2021-03-25 14:33:58,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 39 transitions, 199 flow [2021-03-25 14:33:58,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 39 transitions, 195 flow, removed 2 selfloop flow, removed 0 redundant places. [2021-03-25 14:33:58,848 INFO L241 Difference]: Finished difference. Result has 52 places, 38 transitions, 189 flow [2021-03-25 14:33:58,848 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=52, PETRI_TRANSITIONS=38} [2021-03-25 14:33:58,848 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -8 predicate places. [2021-03-25 14:33:58,848 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:58,848 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 38 transitions, 189 flow [2021-03-25 14:33:58,848 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 38 transitions, 189 flow [2021-03-25 14:33:58,849 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 38 transitions, 189 flow [2021-03-25 14:33:58,856 INFO L129 PetriNetUnfolder]: 20/75 cut-off events. [2021-03-25 14:33:58,856 INFO L130 PetriNetUnfolder]: For 176/182 co-relation queries the response was YES. [2021-03-25 14:33:58,856 INFO L84 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 75 events. 20/75 cut-off events. For 176/182 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 242 event pairs, 6 based on Foata normal form. 1/67 useless extension candidates. Maximal degree in co-relation 217. Up to 27 conditions per place. [2021-03-25 14:33:58,857 INFO L142 LiptonReduction]: Number of co-enabled transitions 596 [2021-03-25 14:33:58,860 INFO L154 LiptonReduction]: Checked pairs total: 469 [2021-03-25 14:33:58,860 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:58,860 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 12 [2021-03-25 14:33:58,867 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 189 flow [2021-03-25 14:33:58,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 0 states have call successors, (0), 0 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:33:58,867 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:58,867 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:58,868 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 14:33:58,868 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:58,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1499289564, now seen corresponding path program 1 times [2021-03-25 14:33:58,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:58,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533768184] [2021-03-25 14:33:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:58,943 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,943 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:58,946 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:58,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:58,951 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:58,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:58,952 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:33:58,952 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533768184] [2021-03-25 14:33:58,952 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:58,952 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:33:58,952 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910071009] [2021-03-25 14:33:58,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:33:58,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:58,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:33:58,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:33:58,953 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:33:58,954 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 38 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 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:33:58,954 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:58,954 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:33:58,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:59,034 INFO L129 PetriNetUnfolder]: 350/638 cut-off events. [2021-03-25 14:33:59,034 INFO L130 PetriNetUnfolder]: For 917/1080 co-relation queries the response was YES. [2021-03-25 14:33:59,036 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1624 conditions, 638 events. 350/638 cut-off events. For 917/1080 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 3958 event pairs, 169 based on Foata normal form. 35/500 useless extension candidates. Maximal degree in co-relation 1604. Up to 395 conditions per place. [2021-03-25 14:33:59,038 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 12 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2021-03-25 14:33:59,038 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 52 transitions, 261 flow [2021-03-25 14:33:59,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:33:59,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:33:59,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 879 transitions. [2021-03-25 14:33:59,041 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8533980582524272 [2021-03-25 14:33:59,041 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 879 transitions. [2021-03-25 14:33:59,041 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 879 transitions. [2021-03-25 14:33:59,041 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:59,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 879 transitions. [2021-03-25 14:33:59,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 175.8) internal successors, (879), 5 states have internal predecessors, (879), 0 states have call successors, (0), 0 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:33:59,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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:33:59,044 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 0 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:33:59,044 INFO L185 Difference]: Start difference. First operand has 52 places, 38 transitions, 189 flow. Second operand 5 states and 879 transitions. [2021-03-25 14:33:59,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 52 transitions, 261 flow [2021-03-25 14:33:59,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 52 transitions, 245 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:59,047 INFO L241 Difference]: Finished difference. Result has 57 places, 47 transitions, 248 flow [2021-03-25 14:33:59,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2021-03-25 14:33:59,047 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -3 predicate places. [2021-03-25 14:33:59,048 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:59,048 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 47 transitions, 248 flow [2021-03-25 14:33:59,048 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 47 transitions, 248 flow [2021-03-25 14:33:59,076 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 47 transitions, 248 flow [2021-03-25 14:33:59,144 INFO L129 PetriNetUnfolder]: 254/475 cut-off events. [2021-03-25 14:33:59,144 INFO L130 PetriNetUnfolder]: For 766/1012 co-relation queries the response was YES. [2021-03-25 14:33:59,146 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1503 conditions, 475 events. 254/475 cut-off events. For 766/1012 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 2854 event pairs, 118 based on Foata normal form. 0/374 useless extension candidates. Maximal degree in co-relation 1482. Up to 276 conditions per place. [2021-03-25 14:33:59,150 INFO L142 LiptonReduction]: Number of co-enabled transitions 860 [2021-03-25 14:33:59,159 INFO L154 LiptonReduction]: Checked pairs total: 739 [2021-03-25 14:33:59,159 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:59,160 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 112 [2021-03-25 14:33:59,160 INFO L480 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 242 flow [2021-03-25 14:33:59,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 171.75) internal successors, (687), 4 states have internal predecessors, (687), 0 states have call successors, (0), 0 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:33:59,161 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:59,161 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:33:59,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 14:33:59,161 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:59,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1227077792, now seen corresponding path program 1 times [2021-03-25 14:33:59,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:59,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860436414] [2021-03-25 14:33:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:59,200 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,200 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,203 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,207 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:59,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:59,214 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:59,215 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:33:59,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860436414] [2021-03-25 14:33:59,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:59,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:33:59,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860991009] [2021-03-25 14:33:59,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 14:33:59,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:59,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 14:33:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 14:33:59,217 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:33:59,217 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 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:33:59,217 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:59,218 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:33:59,218 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:59,311 INFO L129 PetriNetUnfolder]: 240/469 cut-off events. [2021-03-25 14:33:59,311 INFO L130 PetriNetUnfolder]: For 623/1088 co-relation queries the response was YES. [2021-03-25 14:33:59,313 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 469 events. 240/469 cut-off events. For 623/1088 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 2558 event pairs, 37 based on Foata normal form. 54/440 useless extension candidates. Maximal degree in co-relation 1701. Up to 304 conditions per place. [2021-03-25 14:33:59,315 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 13 selfloop transitions, 14 changer transitions 0/57 dead transitions. [2021-03-25 14:33:59,315 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 57 transitions, 352 flow [2021-03-25 14:33:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-03-25 14:33:59,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2021-03-25 14:33:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1055 transitions. [2021-03-25 14:33:59,318 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8535598705501618 [2021-03-25 14:33:59,318 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1055 transitions. [2021-03-25 14:33:59,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1055 transitions. [2021-03-25 14:33:59,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:59,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1055 transitions. [2021-03-25 14:33:59,320 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 175.83333333333334) internal successors, (1055), 6 states have internal predecessors, (1055), 0 states have call successors, (0), 0 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:33:59,322 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 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:33:59,323 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 0 states have call successors, (0), 0 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:33:59,323 INFO L185 Difference]: Start difference. First operand has 57 places, 46 transitions, 242 flow. Second operand 6 states and 1055 transitions. [2021-03-25 14:33:59,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 57 transitions, 352 flow [2021-03-25 14:33:59,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 345 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 14:33:59,328 INFO L241 Difference]: Finished difference. Result has 61 places, 51 transitions, 331 flow [2021-03-25 14:33:59,328 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=331, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2021-03-25 14:33:59,328 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 1 predicate places. [2021-03-25 14:33:59,328 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:59,328 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 51 transitions, 331 flow [2021-03-25 14:33:59,329 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 51 transitions, 331 flow [2021-03-25 14:33:59,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 51 transitions, 331 flow [2021-03-25 14:33:59,363 INFO L129 PetriNetUnfolder]: 170/365 cut-off events. [2021-03-25 14:33:59,363 INFO L130 PetriNetUnfolder]: For 952/1174 co-relation queries the response was YES. [2021-03-25 14:33:59,365 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1565 conditions, 365 events. 170/365 cut-off events. For 952/1174 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2052 event pairs, 39 based on Foata normal form. 3/312 useless extension candidates. Maximal degree in co-relation 1541. Up to 235 conditions per place. [2021-03-25 14:33:59,368 INFO L142 LiptonReduction]: Number of co-enabled transitions 946 [2021-03-25 14:33:59,387 INFO L154 LiptonReduction]: Checked pairs total: 915 [2021-03-25 14:33:59,387 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 14:33:59,387 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-25 14:33:59,387 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 323 flow [2021-03-25 14:33:59,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 171.8) internal successors, (859), 5 states have internal predecessors, (859), 0 states have call successors, (0), 0 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:33:59,388 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:59,388 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:59,388 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 14:33:59,388 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:59,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:59,388 INFO L82 PathProgramCache]: Analyzing trace with hash 688805962, now seen corresponding path program 1 times [2021-03-25 14:33:59,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:59,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312495685] [2021-03-25 14:33:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:59,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:59,432 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,433 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:59,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,434 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,436 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:33:59,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312495685] [2021-03-25 14:33:59,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:59,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 14:33:59,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635896112] [2021-03-25 14:33:59,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 14:33:59,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:59,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 14:33:59,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 14:33:59,437 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 206 [2021-03-25 14:33:59,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 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:33:59,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:59,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 206 [2021-03-25 14:33:59,438 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:59,476 INFO L129 PetriNetUnfolder]: 186/387 cut-off events. [2021-03-25 14:33:59,476 INFO L130 PetriNetUnfolder]: For 1488/1819 co-relation queries the response was YES. [2021-03-25 14:33:59,477 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1720 conditions, 387 events. 186/387 cut-off events. For 1488/1819 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2068 event pairs, 48 based on Foata normal form. 25/356 useless extension candidates. Maximal degree in co-relation 1694. Up to 260 conditions per place. [2021-03-25 14:33:59,479 INFO L132 encePairwiseOnDemand]: 203/206 looper letters, 3 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2021-03-25 14:33:59,479 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 46 transitions, 295 flow [2021-03-25 14:33:59,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 14:33:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 14:33:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2021-03-25 14:33:59,481 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.9077669902912622 [2021-03-25 14:33:59,481 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 561 transitions. [2021-03-25 14:33:59,481 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 561 transitions. [2021-03-25 14:33:59,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:59,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 561 transitions. [2021-03-25 14:33:59,482 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 0 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:33:59,483 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:33:59,483 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 0 states have call successors, (0), 0 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:33:59,483 INFO L185 Difference]: Start difference. First operand has 61 places, 50 transitions, 323 flow. Second operand 3 states and 561 transitions. [2021-03-25 14:33:59,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 46 transitions, 295 flow [2021-03-25 14:33:59,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 46 transitions, 257 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 14:33:59,486 INFO L241 Difference]: Finished difference. Result has 58 places, 46 transitions, 256 flow [2021-03-25 14:33:59,486 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2021-03-25 14:33:59,486 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, -2 predicate places. [2021-03-25 14:33:59,486 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:59,486 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 46 transitions, 256 flow [2021-03-25 14:33:59,487 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 46 transitions, 256 flow [2021-03-25 14:33:59,487 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 58 places, 46 transitions, 256 flow [2021-03-25 14:33:59,513 INFO L129 PetriNetUnfolder]: 164/348 cut-off events. [2021-03-25 14:33:59,513 INFO L130 PetriNetUnfolder]: For 757/866 co-relation queries the response was YES. [2021-03-25 14:33:59,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 348 events. 164/348 cut-off events. For 757/866 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 1977 event pairs, 40 based on Foata normal form. 3/303 useless extension candidates. Maximal degree in co-relation 1188. Up to 217 conditions per place. [2021-03-25 14:33:59,517 INFO L142 LiptonReduction]: Number of co-enabled transitions 792 [2021-03-25 14:33:59,520 INFO L154 LiptonReduction]: Checked pairs total: 350 [2021-03-25 14:33:59,521 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:33:59,521 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 35 [2021-03-25 14:33:59,521 INFO L480 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 256 flow [2021-03-25 14:33:59,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 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:33:59,522 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:33:59,522 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:33:59,522 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 14:33:59,522 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:33:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:33:59,522 INFO L82 PathProgramCache]: Analyzing trace with hash -2023540450, now seen corresponding path program 1 times [2021-03-25 14:33:59,522 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:33:59,522 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817905787] [2021-03-25 14:33:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:33:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:33:59,564 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,564 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,567 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,567 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,571 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,571 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:33:59,575 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:33:59,576 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:33:59,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:33:59,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:33:59,582 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:33:59,582 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817905787] [2021-03-25 14:33:59,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:33:59,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 14:33:59,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046425723] [2021-03-25 14:33:59,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:33:59,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:33:59,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:33:59,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:33:59,584 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 206 [2021-03-25 14:33:59,584 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 256 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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:33:59,584 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:33:59,584 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 206 [2021-03-25 14:33:59,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:33:59,666 INFO L129 PetriNetUnfolder]: 221/429 cut-off events. [2021-03-25 14:33:59,666 INFO L130 PetriNetUnfolder]: For 600/1196 co-relation queries the response was YES. [2021-03-25 14:33:59,668 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1666 conditions, 429 events. 221/429 cut-off events. For 600/1196 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 2121 event pairs, 6 based on Foata normal form. 73/421 useless extension candidates. Maximal degree in co-relation 1642. Up to 300 conditions per place. [2021-03-25 14:33:59,670 INFO L132 encePairwiseOnDemand]: 199/206 looper letters, 10 selfloop transitions, 18 changer transitions 4/62 dead transitions. [2021-03-25 14:33:59,670 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 428 flow [2021-03-25 14:33:59,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 14:33:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 14:33:59,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1231 transitions. [2021-03-25 14:33:59,672 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8536754507628294 [2021-03-25 14:33:59,672 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1231 transitions. [2021-03-25 14:33:59,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1231 transitions. [2021-03-25 14:33:59,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:33:59,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1231 transitions. [2021-03-25 14:33:59,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 175.85714285714286) internal successors, (1231), 7 states have internal predecessors, (1231), 0 states have call successors, (0), 0 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:33:59,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 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:33:59,678 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 0 states have call successors, (0), 0 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:33:59,678 INFO L185 Difference]: Start difference. First operand has 58 places, 46 transitions, 256 flow. Second operand 7 states and 1231 transitions. [2021-03-25 14:33:59,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 428 flow [2021-03-25 14:33:59,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 423 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 14:33:59,680 INFO L241 Difference]: Finished difference. Result has 66 places, 55 transitions, 389 flow [2021-03-25 14:33:59,681 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=389, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2021-03-25 14:33:59,681 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 6 predicate places. [2021-03-25 14:33:59,681 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:33:59,681 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 66 places, 55 transitions, 389 flow [2021-03-25 14:33:59,681 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 66 places, 55 transitions, 389 flow [2021-03-25 14:33:59,682 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 66 places, 55 transitions, 389 flow [2021-03-25 14:33:59,701 INFO L129 PetriNetUnfolder]: 110/268 cut-off events. [2021-03-25 14:33:59,701 INFO L130 PetriNetUnfolder]: For 780/904 co-relation queries the response was YES. [2021-03-25 14:33:59,702 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1228 conditions, 268 events. 110/268 cut-off events. For 780/904 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1416 event pairs, 5 based on Foata normal form. 1/228 useless extension candidates. Maximal degree in co-relation 1202. Up to 196 conditions per place. [2021-03-25 14:33:59,704 INFO L142 LiptonReduction]: Number of co-enabled transitions 866 [2021-03-25 14:33:59,888 WARN L205 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 14:34:00,253 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 14:34:00,362 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 14:34:00,375 INFO L154 LiptonReduction]: Checked pairs total: 853 [2021-03-25 14:34:00,376 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 14:34:00,376 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 695 [2021-03-25 14:34:00,377 INFO L480 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 382 flow [2021-03-25 14:34:00,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 0 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:34:00,378 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:00,378 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:34:00,378 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 14:34:00,379 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:00,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash 774197198, now seen corresponding path program 1 times [2021-03-25 14:34:00,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:00,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530563586] [2021-03-25 14:34:00,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:00,416 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,416 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:00,417 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:00,419 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,420 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:00,422 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:34:00,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530563586] [2021-03-25 14:34:00,422 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:00,422 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:00,422 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483946881] [2021-03-25 14:34:00,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:00,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:00,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:00,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:00,424 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 207 [2021-03-25 14:34:00,424 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 382 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 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:34:00,424 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:00,424 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 207 [2021-03-25 14:34:00,424 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:00,505 INFO L129 PetriNetUnfolder]: 146/360 cut-off events. [2021-03-25 14:34:00,506 INFO L130 PetriNetUnfolder]: For 1142/1327 co-relation queries the response was YES. [2021-03-25 14:34:00,507 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1514 conditions, 360 events. 146/360 cut-off events. For 1142/1327 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2001 event pairs, 10 based on Foata normal form. 9/327 useless extension candidates. Maximal degree in co-relation 1486. Up to 234 conditions per place. [2021-03-25 14:34:00,508 INFO L132 encePairwiseOnDemand]: 204/207 looper letters, 4 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2021-03-25 14:34:00,508 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 360 flow [2021-03-25 14:34:00,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:34:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:34:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 739 transitions. [2021-03-25 14:34:00,510 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.892512077294686 [2021-03-25 14:34:00,510 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 739 transitions. [2021-03-25 14:34:00,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 739 transitions. [2021-03-25 14:34:00,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:00,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 739 transitions. [2021-03-25 14:34:00,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.75) internal successors, (739), 4 states have internal predecessors, (739), 0 states have call successors, (0), 0 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:34:00,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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:34:00,513 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 0 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:34:00,513 INFO L185 Difference]: Start difference. First operand has 66 places, 54 transitions, 382 flow. Second operand 4 states and 739 transitions. [2021-03-25 14:34:00,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 360 flow [2021-03-25 14:34:00,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 315 flow, removed 16 selfloop flow, removed 4 redundant places. [2021-03-25 14:34:00,518 INFO L241 Difference]: Finished difference. Result has 65 places, 51 transitions, 302 flow [2021-03-25 14:34:00,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2021-03-25 14:34:00,518 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 5 predicate places. [2021-03-25 14:34:00,518 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:00,518 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 65 places, 51 transitions, 302 flow [2021-03-25 14:34:00,519 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 65 places, 51 transitions, 302 flow [2021-03-25 14:34:00,519 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 65 places, 51 transitions, 302 flow [2021-03-25 14:34:00,541 INFO L129 PetriNetUnfolder]: 145/358 cut-off events. [2021-03-25 14:34:00,541 INFO L130 PetriNetUnfolder]: For 643/666 co-relation queries the response was YES. [2021-03-25 14:34:00,542 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 358 events. 145/358 cut-off events. For 643/666 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2054 event pairs, 9 based on Foata normal form. 1/312 useless extension candidates. Maximal degree in co-relation 1187. Up to 162 conditions per place. [2021-03-25 14:34:00,545 INFO L142 LiptonReduction]: Number of co-enabled transitions 774 [2021-03-25 14:34:00,551 INFO L154 LiptonReduction]: Checked pairs total: 208 [2021-03-25 14:34:00,551 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:00,551 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 33 [2021-03-25 14:34:00,551 INFO L480 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 302 flow [2021-03-25 14:34:00,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 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:34:00,552 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:00,552 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:34:00,552 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 14:34:00,552 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:00,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:00,552 INFO L82 PathProgramCache]: Analyzing trace with hash -577658615, now seen corresponding path program 1 times [2021-03-25 14:34:00,552 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:00,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448914095] [2021-03-25 14:34:00,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:00,599 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,599 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 14:34:00,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 14:34:00,613 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,614 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 14:34:00,621 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,622 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 14:34:00,631 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:34:00,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448914095] [2021-03-25 14:34:00,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:00,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 14:34:00,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027406781] [2021-03-25 14:34:00,633 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 14:34:00,633 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:00,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 14:34:00,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 14:34:00,634 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 207 [2021-03-25 14:34:00,635 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 302 flow. Second operand has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 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:34:00,635 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:00,635 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 207 [2021-03-25 14:34:00,635 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:00,725 INFO L129 PetriNetUnfolder]: 182/428 cut-off events. [2021-03-25 14:34:00,725 INFO L130 PetriNetUnfolder]: For 806/830 co-relation queries the response was YES. [2021-03-25 14:34:00,726 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 428 events. 182/428 cut-off events. For 806/830 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 2472 event pairs, 10 based on Foata normal form. 7/381 useless extension candidates. Maximal degree in co-relation 1490. Up to 179 conditions per place. [2021-03-25 14:34:00,728 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 8 selfloop transitions, 12 changer transitions 1/55 dead transitions. [2021-03-25 14:34:00,728 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 55 transitions, 364 flow [2021-03-25 14:34:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 14:34:00,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 14:34:00,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2021-03-25 14:34:00,730 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7932367149758454 [2021-03-25 14:34:00,730 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 821 transitions. [2021-03-25 14:34:00,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 821 transitions. [2021-03-25 14:34:00,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:00,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 821 transitions. [2021-03-25 14:34:00,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 164.2) internal successors, (821), 5 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 14:34:00,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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:34:00,733 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 207.0) internal successors, (1242), 6 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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:34:00,733 INFO L185 Difference]: Start difference. First operand has 65 places, 51 transitions, 302 flow. Second operand 5 states and 821 transitions. [2021-03-25 14:34:00,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 55 transitions, 364 flow [2021-03-25 14:34:00,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 55 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 14:34:00,736 INFO L241 Difference]: Finished difference. Result has 69 places, 53 transitions, 352 flow [2021-03-25 14:34:00,736 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=352, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2021-03-25 14:34:00,736 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 9 predicate places. [2021-03-25 14:34:00,737 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:00,737 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 53 transitions, 352 flow [2021-03-25 14:34:00,737 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 53 transitions, 352 flow [2021-03-25 14:34:00,737 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 69 places, 53 transitions, 352 flow [2021-03-25 14:34:00,764 INFO L129 PetriNetUnfolder]: 160/394 cut-off events. [2021-03-25 14:34:00,764 INFO L130 PetriNetUnfolder]: For 795/827 co-relation queries the response was YES. [2021-03-25 14:34:00,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 394 events. 160/394 cut-off events. For 795/827 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2316 event pairs, 8 based on Foata normal form. 7/350 useless extension candidates. Maximal degree in co-relation 1335. Up to 179 conditions per place. [2021-03-25 14:34:00,769 INFO L142 LiptonReduction]: Number of co-enabled transitions 832 [2021-03-25 14:34:00,776 INFO L154 LiptonReduction]: Checked pairs total: 214 [2021-03-25 14:34:00,776 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 14:34:00,776 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 39 [2021-03-25 14:34:00,778 INFO L480 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 352 flow [2021-03-25 14:34:00,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 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:34:00,778 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:00,778 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:34:00,778 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 14:34:00,778 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:00,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:00,779 INFO L82 PathProgramCache]: Analyzing trace with hash 908414426, now seen corresponding path program 2 times [2021-03-25 14:34:00,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:00,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928947529] [2021-03-25 14:34:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:00,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,817 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:00,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:00,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:00,826 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,827 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:00,831 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 14:34:00,831 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 14:34:00,837 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:00,837 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:00,838 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:34:00,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928947529] [2021-03-25 14:34:00,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:00,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-03-25 14:34:00,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436377914] [2021-03-25 14:34:00,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 14:34:00,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:00,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 14:34:00,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-03-25 14:34:00,840 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 207 [2021-03-25 14:34:00,841 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 352 flow. Second operand has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:34:00,841 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:00,841 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 207 [2021-03-25 14:34:00,841 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:00,941 INFO L129 PetriNetUnfolder]: 354/650 cut-off events. [2021-03-25 14:34:00,941 INFO L130 PetriNetUnfolder]: For 929/1738 co-relation queries the response was YES. [2021-03-25 14:34:00,944 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 650 events. 354/650 cut-off events. For 929/1738 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 3620 event pairs, 0 based on Foata normal form. 98/619 useless extension candidates. Maximal degree in co-relation 2465. Up to 273 conditions per place. [2021-03-25 14:34:00,946 INFO L132 encePairwiseOnDemand]: 200/207 looper letters, 6 selfloop transitions, 18 changer transitions 5/62 dead transitions. [2021-03-25 14:34:00,946 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 62 transitions, 466 flow [2021-03-25 14:34:00,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-03-25 14:34:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-03-25 14:34:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1407 transitions. [2021-03-25 14:34:00,949 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8496376811594203 [2021-03-25 14:34:00,949 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1407 transitions. [2021-03-25 14:34:00,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1407 transitions. [2021-03-25 14:34:00,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:00,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1407 transitions. [2021-03-25 14:34:00,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 175.875) internal successors, (1407), 8 states have internal predecessors, (1407), 0 states have call successors, (0), 0 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:34:00,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 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:34:00,954 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 207.0) internal successors, (1863), 9 states have internal predecessors, (1863), 0 states have call successors, (0), 0 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:34:00,954 INFO L185 Difference]: Start difference. First operand has 69 places, 53 transitions, 352 flow. Second operand 8 states and 1407 transitions. [2021-03-25 14:34:00,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 62 transitions, 466 flow [2021-03-25 14:34:00,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 62 transitions, 417 flow, removed 15 selfloop flow, removed 4 redundant places. [2021-03-25 14:34:00,959 INFO L241 Difference]: Finished difference. Result has 75 places, 54 transitions, 371 flow [2021-03-25 14:34:00,959 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=207, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=371, PETRI_PLACES=75, PETRI_TRANSITIONS=54} [2021-03-25 14:34:00,959 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 15 predicate places. [2021-03-25 14:34:00,959 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:00,959 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 75 places, 54 transitions, 371 flow [2021-03-25 14:34:00,960 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 75 places, 54 transitions, 371 flow [2021-03-25 14:34:00,960 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 74 places, 54 transitions, 371 flow [2021-03-25 14:34:00,980 INFO L129 PetriNetUnfolder]: 125/316 cut-off events. [2021-03-25 14:34:00,980 INFO L130 PetriNetUnfolder]: For 745/885 co-relation queries the response was YES. [2021-03-25 14:34:00,981 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 316 events. 125/316 cut-off events. For 745/885 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 1882 event pairs, 0 based on Foata normal form. 1/260 useless extension candidates. Maximal degree in co-relation 1274. Up to 145 conditions per place. [2021-03-25 14:34:00,984 INFO L142 LiptonReduction]: Number of co-enabled transitions 794 [2021-03-25 14:34:01,105 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-03-25 14:34:01,353 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:34:01,497 WARN L205 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2021-03-25 14:34:02,140 WARN L205 SmtUtils]: Spent 636.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 196 [2021-03-25 14:34:02,373 WARN L205 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 180 [2021-03-25 14:34:03,722 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 351 DAG size of output: 274 [2021-03-25 14:34:04,244 WARN L205 SmtUtils]: Spent 520.00 ms on a formula simplification that was a NOOP. DAG size: 256 [2021-03-25 14:34:04,263 INFO L154 LiptonReduction]: Checked pairs total: 704 [2021-03-25 14:34:04,263 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:34:04,263 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 3304 [2021-03-25 14:34:04,263 INFO L480 AbstractCegarLoop]: Abstraction has has 71 places, 51 transitions, 355 flow [2021-03-25 14:34:04,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 172.85714285714286) internal successors, (1210), 7 states have internal predecessors, (1210), 0 states have call successors, (0), 0 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:34:04,264 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:04,264 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:04,264 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 14:34:04,264 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:04,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:04,264 INFO L82 PathProgramCache]: Analyzing trace with hash -787558466, now seen corresponding path program 1 times [2021-03-25 14:34:04,264 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:04,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633928434] [2021-03-25 14:34:04,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 14:34:04,348 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:04,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 14:34:04,349 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:04,349 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:04,353 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 14:34:04,354 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 14:34:04,357 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:34:04,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633928434] [2021-03-25 14:34:04,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 14:34:04,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 14:34:04,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300300521] [2021-03-25 14:34:04,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 14:34:04,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 14:34:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 14:34:04,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 14:34:04,369 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 209 [2021-03-25 14:34:04,370 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 51 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 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:34:04,370 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 14:34:04,370 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 209 [2021-03-25 14:34:04,370 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 14:34:04,434 INFO L129 PetriNetUnfolder]: 249/537 cut-off events. [2021-03-25 14:34:04,434 INFO L130 PetriNetUnfolder]: For 1322/1633 co-relation queries the response was YES. [2021-03-25 14:34:04,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 537 events. 249/537 cut-off events. For 1322/1633 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 3378 event pairs, 0 based on Foata normal form. 20/466 useless extension candidates. Maximal degree in co-relation 2107. Up to 214 conditions per place. [2021-03-25 14:34:04,437 INFO L132 encePairwiseOnDemand]: 206/209 looper letters, 3 selfloop transitions, 2 changer transitions 10/52 dead transitions. [2021-03-25 14:34:04,437 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 52 transitions, 367 flow [2021-03-25 14:34:04,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 14:34:04,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 14:34:04,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions. [2021-03-25 14:34:04,439 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8827751196172249 [2021-03-25 14:34:04,439 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 738 transitions. [2021-03-25 14:34:04,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions. [2021-03-25 14:34:04,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 14:34:04,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions. [2021-03-25 14:34:04,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 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:34:04,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 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:34:04,451 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 209.0) internal successors, (1045), 5 states have internal predecessors, (1045), 0 states have call successors, (0), 0 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:34:04,451 INFO L185 Difference]: Start difference. First operand has 71 places, 51 transitions, 355 flow. Second operand 4 states and 738 transitions. [2021-03-25 14:34:04,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 52 transitions, 367 flow [2021-03-25 14:34:04,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 52 transitions, 306 flow, removed 15 selfloop flow, removed 8 redundant places. [2021-03-25 14:34:04,459 INFO L241 Difference]: Finished difference. Result has 68 places, 42 transitions, 236 flow [2021-03-25 14:34:04,459 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=209, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=42} [2021-03-25 14:34:04,459 INFO L343 CegarLoopForPetriNet]: 60 programPoint places, 8 predicate places. [2021-03-25 14:34:04,459 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 14:34:04,459 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 42 transitions, 236 flow [2021-03-25 14:34:04,459 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 42 transitions, 236 flow [2021-03-25 14:34:04,460 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 64 places, 42 transitions, 236 flow [2021-03-25 14:34:04,470 INFO L129 PetriNetUnfolder]: 63/156 cut-off events. [2021-03-25 14:34:04,470 INFO L130 PetriNetUnfolder]: For 182/191 co-relation queries the response was YES. [2021-03-25 14:34:04,470 INFO L84 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 156 events. 63/156 cut-off events. For 182/191 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 685 event pairs, 0 based on Foata normal form. 2/138 useless extension candidates. Maximal degree in co-relation 453. Up to 52 conditions per place. [2021-03-25 14:34:04,471 INFO L142 LiptonReduction]: Number of co-enabled transitions 432 [2021-03-25 14:34:04,538 INFO L154 LiptonReduction]: Checked pairs total: 105 [2021-03-25 14:34:04,538 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 14:34:04,538 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 79 [2021-03-25 14:34:04,539 INFO L480 AbstractCegarLoop]: Abstraction has has 62 places, 40 transitions, 234 flow [2021-03-25 14:34:04,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 184.0) internal successors, (736), 4 states have internal predecessors, (736), 0 states have call successors, (0), 0 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:34:04,539 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 14:34:04,540 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 14:34:04,540 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 14:34:04,540 INFO L428 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 14:34:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 14:34:04,540 INFO L82 PathProgramCache]: Analyzing trace with hash 609886082, now seen corresponding path program 1 times [2021-03-25 14:34:04,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 14:34:04,540 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110269297] [2021-03-25 14:34:04,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 14:34:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:34:04,563 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:34:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 14:34:04,584 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 14:34:04,613 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 14:34:04,614 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 14:34:04,614 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-03-25 14:34:04,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 02:34:04 BasicIcfg [2021-03-25 14:34:04,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 14:34:04,714 INFO L168 Benchmark]: Toolchain (without parser) took 20928.88 ms. Allocated memory was 381.7 MB in the beginning and 763.4 MB in the end (delta: 381.7 MB). Free memory was 344.4 MB in the beginning and 721.1 MB in the end (delta: -376.7 MB). Peak memory consumption was 434.3 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:04,715 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 381.7 MB. Free memory was 362.9 MB in the beginning and 362.8 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 14:34:04,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.02 ms. Allocated memory is still 381.7 MB. Free memory was 344.2 MB in the beginning and 340.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:04,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.71 ms. Allocated memory is still 381.7 MB. Free memory was 340.1 MB in the beginning and 337.0 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:34:04,715 INFO L168 Benchmark]: Boogie Preprocessor took 42.58 ms. Allocated memory is still 381.7 MB. Free memory was 337.0 MB in the beginning and 334.9 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:34:04,715 INFO L168 Benchmark]: RCFGBuilder took 1265.96 ms. Allocated memory is still 381.7 MB. Free memory was 334.9 MB in the beginning and 312.0 MB in the end (delta: 22.9 MB). Peak memory consumption was 163.4 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:04,718 INFO L168 Benchmark]: TraceAbstraction took 19110.95 ms. Allocated memory was 381.7 MB in the beginning and 763.4 MB in the end (delta: 381.7 MB). Free memory was 312.0 MB in the beginning and 721.1 MB in the end (delta: -409.0 MB). Peak memory consumption was 401.5 MB. Max. memory is 16.0 GB. [2021-03-25 14:34:04,721 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.09 ms. Allocated memory is still 381.7 MB. Free memory was 362.9 MB in the beginning and 362.8 MB in the end (delta: 75.1 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 445.02 ms. Allocated memory is still 381.7 MB. Free memory was 344.2 MB in the beginning and 340.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 60.71 ms. Allocated memory is still 381.7 MB. Free memory was 340.1 MB in the beginning and 337.0 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 42.58 ms. Allocated memory is still 381.7 MB. Free memory was 337.0 MB in the beginning and 334.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1265.96 ms. Allocated memory is still 381.7 MB. Free memory was 334.9 MB in the beginning and 312.0 MB in the end (delta: 22.9 MB). Peak memory consumption was 163.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 19110.95 ms. Allocated memory was 381.7 MB in the beginning and 763.4 MB in the end (delta: 381.7 MB). Free memory was 312.0 MB in the beginning and 721.1 MB in the end (delta: -409.0 MB). Peak memory consumption was 401.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7449.2ms, 124 PlacesBefore, 60 PlacesAfterwards, 113 TransitionsBefore, 48 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 5 FixpointIterations, 28 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 74 TotalNumberOfCompositions, 4166 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2227, positive: 2135, positive conditional: 0, positive unconditional: 2135, 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: 1645, positive: 1604, positive conditional: 0, positive unconditional: 1604, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1645, positive: 1604, positive conditional: 0, positive unconditional: 1604, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1645, positive: 1595, positive conditional: 0, positive unconditional: 1595, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 50, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 562, positive: 25, positive conditional: 0, positive unconditional: 25, negative: 537, negative conditional: 0, negative unconditional: 537, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2227, positive: 531, positive conditional: 0, positive unconditional: 531, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 1645, unknown conditional: 0, unknown unconditional: 1645] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2952.0ms, 56 PlacesBefore, 40 PlacesAfterwards, 41 TransitionsBefore, 29 TransitionsAfterwards, 392 CoEnabledTransitionPairs, 3 FixpointIterations, 10 TrivialSequentialCompositions, 2 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 12 TotalNumberOfCompositions, 1274 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 467, positive: 395, positive conditional: 0, positive unconditional: 395, negative: 72, negative conditional: 0, negative unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 84, positive: 68, positive conditional: 0, positive unconditional: 68, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 84, positive: 63, positive conditional: 0, positive unconditional: 63, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 21, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 262, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 209, negative conditional: 0, negative unconditional: 209, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 467, positive: 327, positive conditional: 0, positive unconditional: 327, negative: 56, negative conditional: 0, negative unconditional: 56, unknown: 84, unknown conditional: 0, unknown unconditional: 84] , Statistics on independence cache: Total cache size (in pairs): 199, Positive cache size: 171, Positive conditional cache size: 0, Positive unconditional cache size: 171, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1434.3ms, 41 PlacesBefore, 38 PlacesAfterwards, 31 TransitionsBefore, 28 TransitionsAfterwards, 388 CoEnabledTransitionPairs, 3 FixpointIterations, 3 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 1047 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 358, positive: 298, positive conditional: 0, positive unconditional: 298, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 358, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 200, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6ms, 40 PlacesBefore, 40 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 386 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 333 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 126, positive: 107, positive conditional: 0, positive unconditional: 107, 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: 126, positive: 107, positive conditional: 0, positive unconditional: 107, 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): 200, Positive cache size: 172, Positive conditional cache size: 0, Positive unconditional cache size: 172, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 45.5ms, 43 PlacesBefore, 43 PlacesAfterwards, 32 TransitionsBefore, 32 TransitionsAfterwards, 468 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 353 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 106, positive: 88, positive conditional: 0, positive unconditional: 88, 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: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 26, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 106, positive: 87, positive conditional: 0, positive unconditional: 87, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 173, Positive conditional cache size: 0, Positive unconditional cache size: 173, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.2ms, 48 PlacesBefore, 48 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 556 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 382 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 209, positive: 190, positive conditional: 0, positive unconditional: 190, 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: 12, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 12, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 12, positive: 11, positive conditional: 0, positive unconditional: 11, 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: 209, positive: 179, positive conditional: 0, positive unconditional: 179, negative: 18, negative conditional: 0, negative unconditional: 18, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.6ms, 52 PlacesBefore, 52 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 596 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 469 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 198, positive: 175, positive conditional: 0, positive unconditional: 175, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 198, positive: 175, positive conditional: 0, positive unconditional: 175, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 111.6ms, 57 PlacesBefore, 57 PlacesAfterwards, 47 TransitionsBefore, 46 TransitionsAfterwards, 860 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 739 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 260, positive: 234, positive conditional: 0, positive unconditional: 234, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 19, positive: 19, positive conditional: 0, positive unconditional: 19, 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: 260, positive: 215, positive conditional: 0, positive unconditional: 215, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , Statistics on independence cache: Total cache size (in pairs): 215, Positive cache size: 188, Positive conditional cache size: 0, Positive unconditional cache size: 188, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.3ms, 61 PlacesBefore, 61 PlacesAfterwards, 51 TransitionsBefore, 50 TransitionsAfterwards, 946 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 915 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 327, positive: 297, positive conditional: 0, positive unconditional: 297, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 12, positive: 12, positive conditional: 0, positive unconditional: 12, 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: 327, positive: 285, positive conditional: 0, positive unconditional: 285, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 12, unknown conditional: 0, unknown unconditional: 12] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 34.0ms, 58 PlacesBefore, 58 PlacesAfterwards, 46 TransitionsBefore, 46 TransitionsAfterwards, 792 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 350 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 203, positive: 190, positive conditional: 0, positive unconditional: 190, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 203, positive: 185, positive conditional: 0, positive unconditional: 185, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 694.3ms, 66 PlacesBefore, 66 PlacesAfterwards, 55 TransitionsBefore, 54 TransitionsAfterwards, 866 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 853 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 378, positive: 352, positive conditional: 0, positive unconditional: 352, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 25, positive: 25, positive conditional: 0, positive unconditional: 25, 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: 25, positive: 25, positive conditional: 0, positive unconditional: 25, 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: 25, positive: 25, positive conditional: 0, positive unconditional: 25, 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: 378, positive: 327, positive conditional: 0, positive unconditional: 327, negative: 26, negative conditional: 0, negative unconditional: 26, unknown: 25, unknown conditional: 0, unknown unconditional: 25] , Statistics on independence cache: Total cache size (in pairs): 216, Positive cache size: 193, Positive conditional cache size: 0, Positive unconditional cache size: 193, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 32.0ms, 65 PlacesBefore, 65 PlacesAfterwards, 51 TransitionsBefore, 51 TransitionsAfterwards, 774 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 208 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 78, positive: 71, positive conditional: 0, positive unconditional: 71, 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: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 78, positive: 70, positive conditional: 0, positive unconditional: 70, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 217, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.5ms, 69 PlacesBefore, 69 PlacesAfterwards, 53 TransitionsBefore, 53 TransitionsAfterwards, 832 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 214 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 137, positive: 130, positive conditional: 0, positive unconditional: 130, 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: 137, positive: 130, positive conditional: 0, positive unconditional: 130, 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): 217, Positive cache size: 194, Positive conditional cache size: 0, Positive unconditional cache size: 194, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3303.3ms, 75 PlacesBefore, 71 PlacesAfterwards, 54 TransitionsBefore, 51 TransitionsAfterwards, 794 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 704 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 632, positive: 608, positive conditional: 0, positive unconditional: 608, negative: 24, negative conditional: 0, negative unconditional: 24, 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: 632, positive: 600, positive conditional: 0, positive unconditional: 600, negative: 24, negative conditional: 0, negative unconditional: 24, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 174, Positive cache size: 164, Positive conditional cache size: 0, Positive unconditional cache size: 164, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 78.9ms, 68 PlacesBefore, 62 PlacesAfterwards, 42 TransitionsBefore, 40 TransitionsAfterwards, 432 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 71, positive: 69, positive conditional: 0, positive unconditional: 69, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 10, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 10, positive: 9, positive conditional: 0, positive unconditional: 9, 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: 71, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 10, unknown conditional: 0, unknown unconditional: 10] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 115, Positive conditional cache size: 0, Positive unconditional cache size: 115, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1189; [L847] FCALL, FORK 0 pthread_create(&t1189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1190; [L849] FCALL, FORK 0 pthread_create(&t1190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1191; [L851] FCALL, FORK 0 pthread_create(&t1191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1192; [L853] FCALL, FORK 0 pthread_create(&t1192, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.5ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 18935.6ms, OverallIterations: 15, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1190.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7503.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 48 SDtfs, 38 SDslu, 25 SDs, 0 SdLazy, 288 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 254.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 213.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=389occurred in iteration=10, InterpolantAutomatonStates: 64, 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: 43.6ms SsaConstructionTime, 373.9ms SatisfiabilityAnalysisTime, 727.3ms InterpolantComputationTime, 282 NumberOfCodeBlocks, 282 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 245 ConstructedInterpolants, 0 QuantifiedInterpolants, 1112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...