/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/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 15:01:21,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 15:01:21,509 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 15:01:21,546 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 15:01:21,546 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 15:01:21,549 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 15:01:21,552 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 15:01:21,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 15:01:21,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 15:01:21,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 15:01:21,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 15:01:21,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 15:01:21,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 15:01:21,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 15:01:21,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 15:01:21,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 15:01:21,573 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 15:01:21,574 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 15:01:21,576 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 15:01:21,581 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 15:01:21,582 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 15:01:21,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 15:01:21,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 15:01:21,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 15:01:21,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 15:01:21,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 15:01:21,591 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 15:01:21,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 15:01:21,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 15:01:21,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 15:01:21,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 15:01:21,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 15:01:21,593 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 15:01:21,594 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 15:01:21,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 15:01:21,595 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 15:01:21,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 15:01:21,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 15:01:21,596 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 15:01:21,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 15:01:21,597 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 15:01:21,600 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 15:01:21,631 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 15:01:21,631 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 15:01:21,634 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 15:01:21,635 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 15:01:21,635 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 15:01:21,635 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 15:01:21,635 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 15:01:21,635 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 15:01:21,635 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 15:01:21,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 15:01:21,636 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 15:01:21,636 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 15:01:21,636 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 15:01:21,636 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 15:01:21,637 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 15:01:21,637 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 15:01:21,637 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 15:01:21,637 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 15:01:21,637 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 15:01:21,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 15:01:21,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 15:01:21,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 15:01:21,638 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 15:01:21,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 15:01:21,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 15:01:21,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 15:01:21,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 15:01:21,638 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 15:01:21,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 15:01:21,638 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 15:01:21,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 15:01:21,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 15:01:21,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 15:01:21,987 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 15:01:21,988 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 15:01:21,989 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-03-25 15:01:22,050 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751b8fa78/b789a932ec1746669b5fdb87aed25bd6/FLAG303dddc13 [2021-03-25 15:01:22,493 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 15:01:22,494 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2021-03-25 15:01:22,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751b8fa78/b789a932ec1746669b5fdb87aed25bd6/FLAG303dddc13 [2021-03-25 15:01:23,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/751b8fa78/b789a932ec1746669b5fdb87aed25bd6 [2021-03-25 15:01:23,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 15:01:23,024 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 15:01:23,026 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 15:01:23,026 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 15:01:23,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 15:01:23,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@659b9b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23, skipping insertion in model container [2021-03-25 15:01:23,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 15:01:23,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 15:01:23,222 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/safe029_power.opt.i[951,964] [2021-03-25 15:01:23,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:01:23,381 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 15:01:23,390 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/safe029_power.opt.i[951,964] [2021-03-25 15:01:23,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 15:01:23,531 INFO L208 MainTranslator]: Completed translation [2021-03-25 15:01:23,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23 WrapperNode [2021-03-25 15:01:23,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 15:01:23,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 15:01:23,535 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 15:01:23,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 15:01:23,540 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,583 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 15:01:23,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 15:01:23,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 15:01:23,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 15:01:23,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,599 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,604 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (1/1) ... [2021-03-25 15:01:23,608 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 15:01:23,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 15:01:23,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 15:01:23,609 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 15:01:23,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (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 15:01:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 15:01:23,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 15:01:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 15:01:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 15:01:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 15:01:23,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 15:01:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 15:01:23,671 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 15:01:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 15:01:23,671 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 15:01:23,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 15:01:23,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 15:01:23,673 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 15:01:25,164 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 15:01:25,165 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 15:01:25,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:01:25 BoogieIcfgContainer [2021-03-25 15:01:25,167 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 15:01:25,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 15:01:25,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 15:01:25,171 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 15:01:25,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 03:01:23" (1/3) ... [2021-03-25 15:01:25,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f76d9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:01:25, skipping insertion in model container [2021-03-25 15:01:25,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 03:01:23" (2/3) ... [2021-03-25 15:01:25,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f76d9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 03:01:25, skipping insertion in model container [2021-03-25 15:01:25,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 03:01:25" (3/3) ... [2021-03-25 15:01:25,173 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2021-03-25 15:01:25,181 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 15:01:25,185 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 15:01:25,186 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 15:01:25,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,219 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,219 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,222 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,223 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,224 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,225 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,225 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,226 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,226 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,227 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,228 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,229 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,232 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,232 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,236 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 15:01:25,237 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 15:01:25,253 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 15:01:25,279 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 15:01:25,279 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 15:01:25,279 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 15:01:25,279 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 15:01:25,279 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 15:01:25,279 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 15:01:25,279 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 15:01:25,280 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 15:01:25,288 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-25 15:01:25,313 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-25 15:01:25,313 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:01:25,316 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 50 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 15:01:25,316 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-25 15:01:25,320 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-25 15:01:25,321 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:25,332 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-25 15:01:25,335 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-25 15:01:25,336 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-25 15:01:25,350 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-25 15:01:25,350 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:01:25,350 INFO L84 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 77 events. 2/77 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 54 event pairs, 0 based on Foata normal form. 0/73 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2021-03-25 15:01:25,352 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-25 15:01:26,636 WARN L205 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2021-03-25 15:01:26,938 WARN L205 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 182 [2021-03-25 15:01:28,342 WARN L205 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-25 15:01:28,954 WARN L205 SmtUtils]: Spent 610.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-25 15:01:29,617 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 15:01:29,955 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 15:01:30,067 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 15:01:31,327 WARN L205 SmtUtils]: Spent 517.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 183 [2021-03-25 15:01:31,645 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 15:01:32,259 WARN L205 SmtUtils]: Spent 612.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 15:01:32,825 WARN L205 SmtUtils]: Spent 564.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 15:01:33,134 INFO L154 LiptonReduction]: Checked pairs total: 1657 [2021-03-25 15:01:33,135 INFO L156 LiptonReduction]: Total number of compositions: 53 [2021-03-25 15:01:33,137 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7817 [2021-03-25 15:01:33,149 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 15:01:33,149 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:01:33,149 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:33,149 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:33,150 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:33,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1463710772, now seen corresponding path program 1 times [2021-03-25 15:01:33,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:33,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984995486] [2021-03-25 15:01:33,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:33,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:33,384 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:33,385 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:01:33,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:33,386 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:01:33,391 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 15:01:33,392 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984995486] [2021-03-25 15:01:33,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:33,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:01:33,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858513639] [2021-03-25 15:01:33,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:01:33,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:33,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:01:33,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:01:33,411 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 132 [2021-03-25 15:01:33,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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 15:01:33,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:33,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 132 [2021-03-25 15:01:33,416 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:33,516 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-25 15:01:33,516 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:01:33,517 INFO L84 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 91 events. 23/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 332 event pairs, 9 based on Foata normal form. 6/90 useless extension candidates. Maximal degree in co-relation 130. Up to 37 conditions per place. [2021-03-25 15:01:33,519 INFO L132 encePairwiseOnDemand]: 128/132 looper letters, 7 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2021-03-25 15:01:33,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 92 flow [2021-03-25 15:01:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:01:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:01:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2021-03-25 15:01:33,529 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8762626262626263 [2021-03-25 15:01:33,530 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2021-03-25 15:01:33,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2021-03-25 15:01:33,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:33,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2021-03-25 15:01:33,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 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 15:01:33,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 15:01:33,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 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 15:01:33,551 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 347 transitions. [2021-03-25 15:01:33,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 92 flow [2021-03-25 15:01:33,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 90 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:01:33,554 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 56 flow [2021-03-25 15:01:33,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=132, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=56, PETRI_PLACES=35, PETRI_TRANSITIONS=24} [2021-03-25 15:01:33,566 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-25 15:01:33,567 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:33,567 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-25 15:01:33,567 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-25 15:01:33,567 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2021-03-25 15:01:33,571 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 15:01:33,571 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:01:33,571 INFO L84 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 24 events. 0/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 15:01:33,572 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-25 15:01:33,984 WARN L205 SmtUtils]: Spent 330.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 15:01:34,281 WARN L205 SmtUtils]: Spent 296.00 ms on a formula simplification that was a NOOP. DAG size: 185 [2021-03-25 15:01:34,936 WARN L205 SmtUtils]: Spent 652.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 15:01:35,566 WARN L205 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 15:01:36,068 INFO L154 LiptonReduction]: Checked pairs total: 448 [2021-03-25 15:01:36,069 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 15:01:36,069 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2502 [2021-03-25 15:01:36,070 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-25 15:01:36,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 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 15:01:36,071 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:36,071 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:36,071 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 15:01:36,071 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:36,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1396965882, now seen corresponding path program 1 times [2021-03-25 15:01:36,079 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:36,079 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581048547] [2021-03-25 15:01:36,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:36,233 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:36,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:01:36,234 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:36,234 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:01:36,240 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:36,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:01:36,248 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 15:01:36,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581048547] [2021-03-25 15:01:36,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:36,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:01:36,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220560509] [2021-03-25 15:01:36,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:01:36,249 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:01:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:01:36,251 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2021-03-25 15:01:36,252 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 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 15:01:36,252 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:36,252 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2021-03-25 15:01:36,252 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:36,269 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-25 15:01:36,269 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 15:01:36,269 INFO L84 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 55 event pairs, 1 based on Foata normal form. 1/27 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2021-03-25 15:01:36,270 INFO L132 encePairwiseOnDemand]: 134/138 looper letters, 3 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2021-03-25 15:01:36,270 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 60 flow [2021-03-25 15:01:36,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:01:36,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:01:36,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2021-03-25 15:01:36,274 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2021-03-25 15:01:36,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2021-03-25 15:01:36,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2021-03-25 15:01:36,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:36,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2021-03-25 15:01:36,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 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 15:01:36,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 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 15:01:36,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 138.0) internal successors, (552), 4 states have internal predecessors, (552), 0 states have call successors, (0), 0 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 15:01:36,278 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 3 states and 352 transitions. [2021-03-25 15:01:36,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 60 flow [2021-03-25 15:01:36,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 20 transitions, 56 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 15:01:36,279 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 59 flow [2021-03-25 15:01:36,279 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=59, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2021-03-25 15:01:36,279 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -11 predicate places. [2021-03-25 15:01:36,279 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:36,280 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 59 flow [2021-03-25 15:01:36,280 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 59 flow [2021-03-25 15:01:36,280 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 59 flow [2021-03-25 15:01:36,284 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-03-25 15:01:36,284 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 15:01:36,285 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 27 events. 3/27 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 57 event pairs, 1 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2021-03-25 15:01:36,285 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-25 15:01:36,862 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-25 15:01:36,975 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-25 15:01:37,211 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-25 15:01:37,318 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2021-03-25 15:01:37,320 INFO L154 LiptonReduction]: Checked pairs total: 354 [2021-03-25 15:01:37,320 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 15:01:37,321 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1042 [2021-03-25 15:01:37,321 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-03-25 15:01:37,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 115.75) internal successors, (463), 4 states have internal predecessors, (463), 0 states have call successors, (0), 0 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 15:01:37,322 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:37,322 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:37,322 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 15:01:37,322 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:37,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1388591254, now seen corresponding path program 1 times [2021-03-25 15:01:37,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:37,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492136118] [2021-03-25 15:01:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:37,429 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:37,431 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:01:37,433 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:37,435 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 15:01:37,445 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:37,446 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:01:37,453 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 15:01:37,454 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492136118] [2021-03-25 15:01:37,454 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:37,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:01:37,454 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426209188] [2021-03-25 15:01:37,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:01:37,455 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:37,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:01:37,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:01:37,456 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 140 [2021-03-25 15:01:37,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 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 15:01:37,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:37,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 140 [2021-03-25 15:01:37,457 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:37,499 INFO L129 PetriNetUnfolder]: 35/89 cut-off events. [2021-03-25 15:01:37,499 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 15:01:37,500 INFO L84 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 89 events. 35/89 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 317 event pairs, 24 based on Foata normal form. 1/82 useless extension candidates. Maximal degree in co-relation 176. Up to 61 conditions per place. [2021-03-25 15:01:37,500 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2021-03-25 15:01:37,500 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 81 flow [2021-03-25 15:01:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:01:37,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:01:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2021-03-25 15:01:37,503 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7690476190476191 [2021-03-25 15:01:37,503 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2021-03-25 15:01:37,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2021-03-25 15:01:37,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:37,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2021-03-25 15:01:37,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 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 15:01:37,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 15:01:37,506 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 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 15:01:37,507 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 323 transitions. [2021-03-25 15:01:37,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 81 flow [2021-03-25 15:01:37,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 78 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 15:01:37,508 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 71 flow [2021-03-25 15:01:37,508 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=71, PETRI_PLACES=26, PETRI_TRANSITIONS=20} [2021-03-25 15:01:37,508 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -11 predicate places. [2021-03-25 15:01:37,508 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:37,508 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 71 flow [2021-03-25 15:01:37,509 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 71 flow [2021-03-25 15:01:37,509 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 71 flow [2021-03-25 15:01:37,514 INFO L129 PetriNetUnfolder]: 9/37 cut-off events. [2021-03-25 15:01:37,514 INFO L130 PetriNetUnfolder]: For 6/7 co-relation queries the response was YES. [2021-03-25 15:01:37,514 INFO L84 FinitePrefix]: Finished finitePrefix Result has 77 conditions, 37 events. 9/37 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 97 event pairs, 3 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 67. Up to 15 conditions per place. [2021-03-25 15:01:37,515 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-25 15:01:37,566 INFO L154 LiptonReduction]: Checked pairs total: 76 [2021-03-25 15:01:37,566 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:01:37,567 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 59 [2021-03-25 15:01:37,567 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 71 flow [2021-03-25 15:01:37,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 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 15:01:37,568 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:37,568 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:37,568 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 15:01:37,568 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:37,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1850481260, now seen corresponding path program 1 times [2021-03-25 15:01:37,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:37,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022322842] [2021-03-25 15:01:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:37,643 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:37,644 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 15:01:37,651 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:37,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:01:37,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:37,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 15:01:37,676 INFO L142 QuantifierPusher]: treesize reduction 4, result has 76.5 percent of original size [2021-03-25 15:01:37,677 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:01:37,685 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 15:01:37,685 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022322842] [2021-03-25 15:01:37,685 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:37,685 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:01:37,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072281330] [2021-03-25 15:01:37,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:01:37,685 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:37,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:01:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:01:37,687 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2021-03-25 15:01:37,688 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 71 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 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 15:01:37,688 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:37,688 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2021-03-25 15:01:37,688 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:37,816 INFO L129 PetriNetUnfolder]: 119/227 cut-off events. [2021-03-25 15:01:37,817 INFO L130 PetriNetUnfolder]: For 83/83 co-relation queries the response was YES. [2021-03-25 15:01:37,817 INFO L84 FinitePrefix]: Finished finitePrefix Result has 545 conditions, 227 events. 119/227 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 888 event pairs, 40 based on Foata normal form. 4/211 useless extension candidates. Maximal degree in co-relation 533. Up to 177 conditions per place. [2021-03-25 15:01:37,819 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 15 selfloop transitions, 9 changer transitions 3/34 dead transitions. [2021-03-25 15:01:37,819 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 34 transitions, 157 flow [2021-03-25 15:01:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:01:37,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:01:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2021-03-25 15:01:37,821 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7271428571428571 [2021-03-25 15:01:37,821 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2021-03-25 15:01:37,821 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2021-03-25 15:01:37,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:37,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2021-03-25 15:01:37,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 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 15:01:37,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 15:01:37,825 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 15:01:37,825 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 71 flow. Second operand 5 states and 509 transitions. [2021-03-25 15:01:37,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 34 transitions, 157 flow [2021-03-25 15:01:37,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 34 transitions, 154 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 15:01:37,827 INFO L241 Difference]: Finished difference. Result has 32 places, 25 transitions, 125 flow [2021-03-25 15:01:37,827 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=125, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2021-03-25 15:01:37,827 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -5 predicate places. [2021-03-25 15:01:37,827 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:37,828 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 25 transitions, 125 flow [2021-03-25 15:01:37,828 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 25 transitions, 125 flow [2021-03-25 15:01:37,828 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 25 transitions, 125 flow [2021-03-25 15:01:37,837 INFO L129 PetriNetUnfolder]: 25/67 cut-off events. [2021-03-25 15:01:37,837 INFO L130 PetriNetUnfolder]: For 107/111 co-relation queries the response was YES. [2021-03-25 15:01:37,838 INFO L84 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 67 events. 25/67 cut-off events. For 107/111 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 230 event pairs, 10 based on Foata normal form. 0/62 useless extension candidates. Maximal degree in co-relation 197. Up to 30 conditions per place. [2021-03-25 15:01:37,838 INFO L142 LiptonReduction]: Number of co-enabled transitions 134 [2021-03-25 15:01:37,920 INFO L154 LiptonReduction]: Checked pairs total: 48 [2021-03-25 15:01:37,921 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:01:37,921 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 94 [2021-03-25 15:01:37,921 INFO L480 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 125 flow [2021-03-25 15:01:37,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 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 15:01:37,922 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:37,922 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:37,922 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 15:01:37,922 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:37,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:37,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1125626090, now seen corresponding path program 1 times [2021-03-25 15:01:37,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:37,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394692941] [2021-03-25 15:01:37,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:38,022 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,022 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 15:01:38,039 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:01:38,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:01:38,058 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 15:01:38,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394692941] [2021-03-25 15:01:38,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:38,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:01:38,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181179936] [2021-03-25 15:01:38,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:01:38,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:01:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:01:38,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2021-03-25 15:01:38,061 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 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 15:01:38,061 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:38,061 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2021-03-25 15:01:38,061 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:38,157 INFO L129 PetriNetUnfolder]: 38/102 cut-off events. [2021-03-25 15:01:38,158 INFO L130 PetriNetUnfolder]: For 214/216 co-relation queries the response was YES. [2021-03-25 15:01:38,159 INFO L84 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 102 events. 38/102 cut-off events. For 214/216 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 376 event pairs, 6 based on Foata normal form. 5/106 useless extension candidates. Maximal degree in co-relation 308. Up to 59 conditions per place. [2021-03-25 15:01:38,159 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 12 selfloop transitions, 5 changer transitions 0/29 dead transitions. [2021-03-25 15:01:38,160 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 29 transitions, 173 flow [2021-03-25 15:01:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 15:01:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 15:01:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2021-03-25 15:01:38,162 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7607142857142857 [2021-03-25 15:01:38,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2021-03-25 15:01:38,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2021-03-25 15:01:38,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:38,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2021-03-25 15:01:38,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 15:01:38,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:38,166 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:38,166 INFO L185 Difference]: Start difference. First operand has 32 places, 25 transitions, 125 flow. Second operand 4 states and 426 transitions. [2021-03-25 15:01:38,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 29 transitions, 173 flow [2021-03-25 15:01:38,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 29 transitions, 164 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 15:01:38,169 INFO L241 Difference]: Finished difference. Result has 35 places, 27 transitions, 141 flow [2021-03-25 15:01:38,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2021-03-25 15:01:38,170 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-25 15:01:38,170 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:38,170 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 27 transitions, 141 flow [2021-03-25 15:01:38,170 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 27 transitions, 141 flow [2021-03-25 15:01:38,171 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 27 transitions, 141 flow [2021-03-25 15:01:38,186 INFO L129 PetriNetUnfolder]: 29/76 cut-off events. [2021-03-25 15:01:38,186 INFO L130 PetriNetUnfolder]: For 190/195 co-relation queries the response was YES. [2021-03-25 15:01:38,187 INFO L84 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 76 events. 29/76 cut-off events. For 190/195 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 277 event pairs, 9 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 235. Up to 32 conditions per place. [2021-03-25 15:01:38,188 INFO L142 LiptonReduction]: Number of co-enabled transitions 142 [2021-03-25 15:01:38,190 INFO L154 LiptonReduction]: Checked pairs total: 18 [2021-03-25 15:01:38,190 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:01:38,190 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-25 15:01:38,192 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 141 flow [2021-03-25 15:01:38,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 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 15:01:38,192 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:38,192 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:38,192 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 15:01:38,192 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:38,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:38,193 INFO L82 PathProgramCache]: Analyzing trace with hash -549513630, now seen corresponding path program 1 times [2021-03-25 15:01:38,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:38,193 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715302242] [2021-03-25 15:01:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:38,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:01:38,242 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,243 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:01:38,244 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,244 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:01:38,252 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,253 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:01:38,261 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 15:01:38,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715302242] [2021-03-25 15:01:38,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:38,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:01:38,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674791776] [2021-03-25 15:01:38,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:01:38,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:38,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:01:38,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:01:38,263 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 140 [2021-03-25 15:01:38,264 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 27 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 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 15:01:38,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:38,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 140 [2021-03-25 15:01:38,265 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:38,339 INFO L129 PetriNetUnfolder]: 36/96 cut-off events. [2021-03-25 15:01:38,340 INFO L130 PetriNetUnfolder]: For 239/243 co-relation queries the response was YES. [2021-03-25 15:01:38,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 96 events. 36/96 cut-off events. For 239/243 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 355 event pairs, 7 based on Foata normal form. 4/95 useless extension candidates. Maximal degree in co-relation 322. Up to 53 conditions per place. [2021-03-25 15:01:38,341 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 9 selfloop transitions, 11 changer transitions 0/32 dead transitions. [2021-03-25 15:01:38,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 201 flow [2021-03-25 15:01:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:01:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:01:38,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2021-03-25 15:01:38,344 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7742857142857142 [2021-03-25 15:01:38,344 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2021-03-25 15:01:38,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2021-03-25 15:01:38,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:38,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2021-03-25 15:01:38,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:38,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 15:01:38,348 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 140.0) internal successors, (840), 6 states have internal predecessors, (840), 0 states have call successors, (0), 0 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 15:01:38,348 INFO L185 Difference]: Start difference. First operand has 35 places, 27 transitions, 141 flow. Second operand 5 states and 542 transitions. [2021-03-25 15:01:38,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 201 flow [2021-03-25 15:01:38,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 32 transitions, 192 flow, removed 1 selfloop flow, removed 2 redundant places. [2021-03-25 15:01:38,352 INFO L241 Difference]: Finished difference. Result has 38 places, 30 transitions, 178 flow [2021-03-25 15:01:38,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=38, PETRI_TRANSITIONS=30} [2021-03-25 15:01:38,353 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2021-03-25 15:01:38,353 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:38,353 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 30 transitions, 178 flow [2021-03-25 15:01:38,354 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 30 transitions, 178 flow [2021-03-25 15:01:38,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 178 flow [2021-03-25 15:01:38,369 INFO L129 PetriNetUnfolder]: 40/91 cut-off events. [2021-03-25 15:01:38,370 INFO L130 PetriNetUnfolder]: For 254/270 co-relation queries the response was YES. [2021-03-25 15:01:38,371 INFO L84 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 91 events. 40/91 cut-off events. For 254/270 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 349 event pairs, 12 based on Foata normal form. 1/81 useless extension candidates. Maximal degree in co-relation 333. Up to 48 conditions per place. [2021-03-25 15:01:38,371 INFO L142 LiptonReduction]: Number of co-enabled transitions 150 [2021-03-25 15:01:38,374 INFO L154 LiptonReduction]: Checked pairs total: 44 [2021-03-25 15:01:38,374 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:01:38,375 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 15:01:38,379 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 30 transitions, 178 flow [2021-03-25 15:01:38,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 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 15:01:38,380 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:38,380 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:38,380 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 15:01:38,380 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1579138938, now seen corresponding path program 2 times [2021-03-25 15:01:38,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:38,381 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542958756] [2021-03-25 15:01:38,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:38,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:38,449 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,450 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 15:01:38,455 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,456 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:01:38,464 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,465 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:01:38,475 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:38,477 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:01:38,489 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 15:01:38,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542958756] [2021-03-25 15:01:38,489 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:38,489 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:01:38,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855688515] [2021-03-25 15:01:38,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:01:38,490 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:38,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:01:38,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:01:38,491 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140 [2021-03-25 15:01:38,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 30 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:38,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:38,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140 [2021-03-25 15:01:38,494 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:38,608 INFO L129 PetriNetUnfolder]: 33/90 cut-off events. [2021-03-25 15:01:38,608 INFO L130 PetriNetUnfolder]: For 269/273 co-relation queries the response was YES. [2021-03-25 15:01:38,609 INFO L84 FinitePrefix]: Finished finitePrefix Result has 363 conditions, 90 events. 33/90 cut-off events. For 269/273 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 319 event pairs, 6 based on Foata normal form. 5/90 useless extension candidates. Maximal degree in co-relation 344. Up to 43 conditions per place. [2021-03-25 15:01:38,609 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 11 selfloop transitions, 16 changer transitions 0/39 dead transitions. [2021-03-25 15:01:38,610 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 288 flow [2021-03-25 15:01:38,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:01:38,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:01:38,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 744 transitions. [2021-03-25 15:01:38,613 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7591836734693878 [2021-03-25 15:01:38,613 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 744 transitions. [2021-03-25 15:01:38,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 744 transitions. [2021-03-25 15:01:38,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:38,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 744 transitions. [2021-03-25 15:01:38,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.28571428571429) internal successors, (744), 7 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:38,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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 15:01:38,617 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 140.0) internal successors, (1120), 8 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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 15:01:38,617 INFO L185 Difference]: Start difference. First operand has 38 places, 30 transitions, 178 flow. Second operand 7 states and 744 transitions. [2021-03-25 15:01:38,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 288 flow [2021-03-25 15:01:38,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 262 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-25 15:01:38,620 INFO L241 Difference]: Finished difference. Result has 43 places, 36 transitions, 240 flow [2021-03-25 15:01:38,621 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2021-03-25 15:01:38,621 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2021-03-25 15:01:38,621 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:38,621 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 36 transitions, 240 flow [2021-03-25 15:01:38,621 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 36 transitions, 240 flow [2021-03-25 15:01:38,622 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 43 places, 36 transitions, 240 flow [2021-03-25 15:01:38,633 INFO L129 PetriNetUnfolder]: 36/89 cut-off events. [2021-03-25 15:01:38,634 INFO L130 PetriNetUnfolder]: For 430/447 co-relation queries the response was YES. [2021-03-25 15:01:38,634 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 89 events. 36/89 cut-off events. For 430/447 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 324 event pairs, 8 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 362. Up to 42 conditions per place. [2021-03-25 15:01:38,635 INFO L142 LiptonReduction]: Number of co-enabled transitions 158 [2021-03-25 15:01:38,854 WARN L205 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 15:01:39,221 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 83 [2021-03-25 15:01:39,335 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2021-03-25 15:01:39,341 INFO L154 LiptonReduction]: Checked pairs total: 170 [2021-03-25 15:01:39,341 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 15:01:39,341 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 720 [2021-03-25 15:01:39,341 INFO L480 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 242 flow [2021-03-25 15:01:39,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:39,342 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:39,342 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:39,342 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 15:01:39,342 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:39,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1284735813, now seen corresponding path program 1 times [2021-03-25 15:01:39,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:39,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125985775] [2021-03-25 15:01:39,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:39,381 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:01:39,382 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:01:39,385 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 15:01:39,385 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125985775] [2021-03-25 15:01:39,385 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:39,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 15:01:39,386 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033528236] [2021-03-25 15:01:39,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 15:01:39,386 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:39,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 15:01:39,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 15:01:39,387 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 141 [2021-03-25 15:01:39,387 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 242 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 15:01:39,388 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:39,388 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 141 [2021-03-25 15:01:39,388 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:39,411 INFO L129 PetriNetUnfolder]: 29/98 cut-off events. [2021-03-25 15:01:39,411 INFO L130 PetriNetUnfolder]: For 651/667 co-relation queries the response was YES. [2021-03-25 15:01:39,412 INFO L84 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 98 events. 29/98 cut-off events. For 651/667 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 408 event pairs, 9 based on Foata normal form. 7/95 useless extension candidates. Maximal degree in co-relation 368. Up to 44 conditions per place. [2021-03-25 15:01:39,412 INFO L132 encePairwiseOnDemand]: 138/141 looper letters, 3 selfloop transitions, 3 changer transitions 2/36 dead transitions. [2021-03-25 15:01:39,412 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 36 transitions, 254 flow [2021-03-25 15:01:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 15:01:39,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 15:01:39,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2021-03-25 15:01:39,415 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8723404255319149 [2021-03-25 15:01:39,415 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2021-03-25 15:01:39,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2021-03-25 15:01:39,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:39,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2021-03-25 15:01:39,416 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 15:01:39,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 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 15:01:39,417 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 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 15:01:39,417 INFO L185 Difference]: Start difference. First operand has 43 places, 36 transitions, 242 flow. Second operand 3 states and 369 transitions. [2021-03-25 15:01:39,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 36 transitions, 254 flow [2021-03-25 15:01:39,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 238 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-03-25 15:01:39,420 INFO L241 Difference]: Finished difference. Result has 45 places, 34 transitions, 223 flow [2021-03-25 15:01:39,420 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=223, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2021-03-25 15:01:39,420 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 8 predicate places. [2021-03-25 15:01:39,420 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:39,420 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 45 places, 34 transitions, 223 flow [2021-03-25 15:01:39,420 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 45 places, 34 transitions, 223 flow [2021-03-25 15:01:39,421 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 34 transitions, 223 flow [2021-03-25 15:01:39,433 INFO L129 PetriNetUnfolder]: 29/102 cut-off events. [2021-03-25 15:01:39,433 INFO L130 PetriNetUnfolder]: For 433/449 co-relation queries the response was YES. [2021-03-25 15:01:39,434 INFO L84 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 102 events. 29/102 cut-off events. For 433/449 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 478 event pairs, 9 based on Foata normal form. 2/94 useless extension candidates. Maximal degree in co-relation 383. Up to 44 conditions per place. [2021-03-25 15:01:39,435 INFO L142 LiptonReduction]: Number of co-enabled transitions 154 [2021-03-25 15:01:39,437 INFO L154 LiptonReduction]: Checked pairs total: 42 [2021-03-25 15:01:39,437 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:01:39,437 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 15:01:39,438 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 223 flow [2021-03-25 15:01:39,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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 15:01:39,438 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:39,438 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:39,438 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 15:01:39,438 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:39,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1517133420, now seen corresponding path program 1 times [2021-03-25 15:01:39,439 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:39,439 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421343517] [2021-03-25 15:01:39,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:39,478 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:01:39,487 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,488 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 15:01:39,495 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,496 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 15:01:39,497 INFO L142 QuantifierPusher]: treesize reduction 4, result has 66.7 percent of original size [2021-03-25 15:01:39,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 8 [2021-03-25 15:01:39,504 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-25 15:01:39,504 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 15:01:39,513 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 15:01:39,513 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421343517] [2021-03-25 15:01:39,513 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:39,513 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:01:39,514 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036734596] [2021-03-25 15:01:39,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:01:39,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:01:39,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:01:39,515 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 141 [2021-03-25 15:01:39,516 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 223 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 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 15:01:39,516 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:39,516 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 141 [2021-03-25 15:01:39,516 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:39,653 INFO L129 PetriNetUnfolder]: 168/336 cut-off events. [2021-03-25 15:01:39,653 INFO L130 PetriNetUnfolder]: For 1149/1153 co-relation queries the response was YES. [2021-03-25 15:01:39,655 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1302 conditions, 336 events. 168/336 cut-off events. For 1149/1153 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1521 event pairs, 25 based on Foata normal form. 2/308 useless extension candidates. Maximal degree in co-relation 1280. Up to 234 conditions per place. [2021-03-25 15:01:39,656 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 16 selfloop transitions, 9 changer transitions 13/45 dead transitions. [2021-03-25 15:01:39,656 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 341 flow [2021-03-25 15:01:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:01:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:01:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 470 transitions. [2021-03-25 15:01:39,658 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2021-03-25 15:01:39,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 470 transitions. [2021-03-25 15:01:39,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 470 transitions. [2021-03-25 15:01:39,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:39,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 470 transitions. [2021-03-25 15:01:39,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 94.0) internal successors, (470), 5 states have internal predecessors, (470), 0 states have call successors, (0), 0 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 15:01:39,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 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 15:01:39,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 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 15:01:39,662 INFO L185 Difference]: Start difference. First operand has 45 places, 34 transitions, 223 flow. Second operand 5 states and 470 transitions. [2021-03-25 15:01:39,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 341 flow [2021-03-25 15:01:39,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 45 transitions, 336 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 15:01:39,668 INFO L241 Difference]: Finished difference. Result has 49 places, 28 transitions, 215 flow [2021-03-25 15:01:39,669 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2021-03-25 15:01:39,669 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 12 predicate places. [2021-03-25 15:01:39,669 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:39,669 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 28 transitions, 215 flow [2021-03-25 15:01:39,669 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 28 transitions, 215 flow [2021-03-25 15:01:39,670 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 45 places, 28 transitions, 215 flow [2021-03-25 15:01:39,683 INFO L129 PetriNetUnfolder]: 23/79 cut-off events. [2021-03-25 15:01:39,683 INFO L130 PetriNetUnfolder]: For 493/509 co-relation queries the response was YES. [2021-03-25 15:01:39,683 INFO L84 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 79 events. 23/79 cut-off events. For 493/509 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 323 event pairs, 8 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 363. Up to 40 conditions per place. [2021-03-25 15:01:39,684 INFO L142 LiptonReduction]: Number of co-enabled transitions 90 [2021-03-25 15:01:39,686 INFO L154 LiptonReduction]: Checked pairs total: 55 [2021-03-25 15:01:39,686 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:01:39,686 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 15:01:39,687 INFO L480 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 215 flow [2021-03-25 15:01:39,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 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 15:01:39,687 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:39,687 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:39,687 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 15:01:39,688 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:39,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:39,688 INFO L82 PathProgramCache]: Analyzing trace with hash 594895541, now seen corresponding path program 1 times [2021-03-25 15:01:39,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:39,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431123977] [2021-03-25 15:01:39,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:39,769 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:01:39,881 WARN L205 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2021-03-25 15:01:39,882 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,882 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 15:01:39,884 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,885 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 15:01:39,896 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,900 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 20 [2021-03-25 15:01:39,924 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:39,925 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 15:01:39,937 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 15:01:39,937 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431123977] [2021-03-25 15:01:39,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:39,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:01:39,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979940678] [2021-03-25 15:01:39,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 15:01:39,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:39,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 15:01:39,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 15:01:39,939 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 141 [2021-03-25 15:01:39,940 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:39,940 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:39,940 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 141 [2021-03-25 15:01:39,940 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:40,021 INFO L129 PetriNetUnfolder]: 31/98 cut-off events. [2021-03-25 15:01:40,021 INFO L130 PetriNetUnfolder]: For 685/699 co-relation queries the response was YES. [2021-03-25 15:01:40,021 INFO L84 FinitePrefix]: Finished finitePrefix Result has 506 conditions, 98 events. 31/98 cut-off events. For 685/699 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 388 event pairs, 12 based on Foata normal form. 6/101 useless extension candidates. Maximal degree in co-relation 482. Up to 61 conditions per place. [2021-03-25 15:01:40,022 INFO L132 encePairwiseOnDemand]: 135/141 looper letters, 12 selfloop transitions, 8 changer transitions 1/31 dead transitions. [2021-03-25 15:01:40,022 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 31 transitions, 279 flow [2021-03-25 15:01:40,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:01:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:01:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 520 transitions. [2021-03-25 15:01:40,025 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7375886524822695 [2021-03-25 15:01:40,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 520 transitions. [2021-03-25 15:01:40,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 520 transitions. [2021-03-25 15:01:40,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:40,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 520 transitions. [2021-03-25 15:01:40,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 0 states have call successors, (0), 0 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 15:01:40,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 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 15:01:40,028 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 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 15:01:40,028 INFO L185 Difference]: Start difference. First operand has 45 places, 28 transitions, 215 flow. Second operand 5 states and 520 transitions. [2021-03-25 15:01:40,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 31 transitions, 279 flow [2021-03-25 15:01:40,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 247 flow, removed 3 selfloop flow, removed 6 redundant places. [2021-03-25 15:01:40,030 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 214 flow [2021-03-25 15:01:40,031 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2021-03-25 15:01:40,031 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2021-03-25 15:01:40,031 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:40,031 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 29 transitions, 214 flow [2021-03-25 15:01:40,031 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 29 transitions, 214 flow [2021-03-25 15:01:40,032 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 29 transitions, 214 flow [2021-03-25 15:01:40,042 INFO L129 PetriNetUnfolder]: 22/83 cut-off events. [2021-03-25 15:01:40,042 INFO L130 PetriNetUnfolder]: For 335/352 co-relation queries the response was YES. [2021-03-25 15:01:40,043 INFO L84 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 83 events. 22/83 cut-off events. For 335/352 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 359 event pairs, 8 based on Foata normal form. 1/76 useless extension candidates. Maximal degree in co-relation 345. Up to 41 conditions per place. [2021-03-25 15:01:40,043 INFO L142 LiptonReduction]: Number of co-enabled transitions 94 [2021-03-25 15:01:40,046 INFO L154 LiptonReduction]: Checked pairs total: 64 [2021-03-25 15:01:40,046 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:01:40,046 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 15 [2021-03-25 15:01:40,047 INFO L480 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 214 flow [2021-03-25 15:01:40,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 102.0) internal successors, (612), 6 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:40,047 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:40,047 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:40,048 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 15:01:40,048 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:40,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:40,048 INFO L82 PathProgramCache]: Analyzing trace with hash 171625077, now seen corresponding path program 2 times [2021-03-25 15:01:40,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:40,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959564991] [2021-03-25 15:01:40,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:40,113 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:40,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 15:01:40,129 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:40,130 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 22 [2021-03-25 15:01:40,151 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:40,153 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 15:01:40,180 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:40,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 17 [2021-03-25 15:01:40,193 INFO L142 QuantifierPusher]: treesize reduction 4, result has 73.3 percent of original size [2021-03-25 15:01:40,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 15:01:40,204 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 15:01:40,204 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959564991] [2021-03-25 15:01:40,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:40,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 15:01:40,205 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592960410] [2021-03-25 15:01:40,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 15:01:40,205 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 15:01:40,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-03-25 15:01:40,207 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 141 [2021-03-25 15:01:40,207 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 214 flow. Second operand has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 0 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 15:01:40,207 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:40,207 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 141 [2021-03-25 15:01:40,208 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:40,308 INFO L129 PetriNetUnfolder]: 25/92 cut-off events. [2021-03-25 15:01:40,309 INFO L130 PetriNetUnfolder]: For 431/440 co-relation queries the response was YES. [2021-03-25 15:01:40,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 92 events. 25/92 cut-off events. For 431/440 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 394 event pairs, 1 based on Foata normal form. 11/102 useless extension candidates. Maximal degree in co-relation 388. Up to 39 conditions per place. [2021-03-25 15:01:40,309 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 8 selfloop transitions, 5 changer transitions 8/31 dead transitions. [2021-03-25 15:01:40,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 31 transitions, 272 flow [2021-03-25 15:01:40,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:01:40,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:01:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2021-03-25 15:01:40,312 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7446808510638298 [2021-03-25 15:01:40,312 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2021-03-25 15:01:40,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2021-03-25 15:01:40,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:40,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2021-03-25 15:01:40,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 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 15:01:40,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 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 15:01:40,315 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 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 15:01:40,315 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 214 flow. Second operand 5 states and 525 transitions. [2021-03-25 15:01:40,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 31 transitions, 272 flow [2021-03-25 15:01:40,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 31 transitions, 257 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 15:01:40,318 INFO L241 Difference]: Finished difference. Result has 46 places, 21 transitions, 156 flow [2021-03-25 15:01:40,318 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=46, PETRI_TRANSITIONS=21} [2021-03-25 15:01:40,319 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 9 predicate places. [2021-03-25 15:01:40,319 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:40,319 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 21 transitions, 156 flow [2021-03-25 15:01:40,319 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 21 transitions, 156 flow [2021-03-25 15:01:40,319 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 21 transitions, 156 flow [2021-03-25 15:01:40,326 INFO L129 PetriNetUnfolder]: 16/55 cut-off events. [2021-03-25 15:01:40,327 INFO L130 PetriNetUnfolder]: For 273/288 co-relation queries the response was YES. [2021-03-25 15:01:40,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 55 events. 16/55 cut-off events. For 273/288 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 183 event pairs, 7 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 243. Up to 30 conditions per place. [2021-03-25 15:01:40,327 INFO L142 LiptonReduction]: Number of co-enabled transitions 74 [2021-03-25 15:01:40,329 INFO L154 LiptonReduction]: Checked pairs total: 24 [2021-03-25 15:01:40,329 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 15:01:40,329 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 15:01:40,329 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 21 transitions, 156 flow [2021-03-25 15:01:40,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 102.85714285714286) internal successors, (720), 7 states have internal predecessors, (720), 0 states have call successors, (0), 0 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 15:01:40,330 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:40,330 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:40,330 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 15:01:40,330 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:40,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash 604338327, now seen corresponding path program 1 times [2021-03-25 15:01:40,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:40,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55984621] [2021-03-25 15:01:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:40,376 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:40,377 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:01:40,382 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 15:01:40,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:01:40,389 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:40,389 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:01:40,389 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 15:01:40,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55984621] [2021-03-25 15:01:40,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:40,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 15:01:40,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593925475] [2021-03-25 15:01:40,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 15:01:40,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:40,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 15:01:40,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 15:01:40,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 141 [2021-03-25 15:01:40,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 21 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:40,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:40,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 141 [2021-03-25 15:01:40,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:40,424 INFO L129 PetriNetUnfolder]: 23/90 cut-off events. [2021-03-25 15:01:40,425 INFO L130 PetriNetUnfolder]: For 356/369 co-relation queries the response was YES. [2021-03-25 15:01:40,425 INFO L84 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 90 events. 23/90 cut-off events. For 356/369 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 381 event pairs, 7 based on Foata normal form. 25/113 useless extension candidates. Maximal degree in co-relation 337. Up to 44 conditions per place. [2021-03-25 15:01:40,425 INFO L132 encePairwiseOnDemand]: 136/141 looper letters, 4 selfloop transitions, 5 changer transitions 5/28 dead transitions. [2021-03-25 15:01:40,425 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 28 transitions, 200 flow [2021-03-25 15:01:40,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 15:01:40,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 15:01:40,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2021-03-25 15:01:40,428 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8212765957446808 [2021-03-25 15:01:40,428 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2021-03-25 15:01:40,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2021-03-25 15:01:40,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:40,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2021-03-25 15:01:40,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 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 15:01:40,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 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 15:01:40,431 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 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 15:01:40,431 INFO L185 Difference]: Start difference. First operand has 40 places, 21 transitions, 156 flow. Second operand 5 states and 579 transitions. [2021-03-25 15:01:40,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 28 transitions, 200 flow [2021-03-25 15:01:40,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 28 transitions, 166 flow, removed 10 selfloop flow, removed 7 redundant places. [2021-03-25 15:01:40,433 INFO L241 Difference]: Finished difference. Result has 40 places, 23 transitions, 151 flow [2021-03-25 15:01:40,433 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2021-03-25 15:01:40,433 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2021-03-25 15:01:40,433 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:40,433 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 23 transitions, 151 flow [2021-03-25 15:01:40,434 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 151 flow [2021-03-25 15:01:40,434 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 23 transitions, 151 flow [2021-03-25 15:01:40,440 INFO L129 PetriNetUnfolder]: 9/42 cut-off events. [2021-03-25 15:01:40,441 INFO L130 PetriNetUnfolder]: For 140/148 co-relation queries the response was YES. [2021-03-25 15:01:40,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 42 events. 9/42 cut-off events. For 140/148 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 106 event pairs, 5 based on Foata normal form. 1/40 useless extension candidates. Maximal degree in co-relation 161. Up to 16 conditions per place. [2021-03-25 15:01:40,441 INFO L142 LiptonReduction]: Number of co-enabled transitions 54 [2021-03-25 15:01:40,696 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-03-25 15:01:40,958 WARN L205 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2021-03-25 15:01:41,006 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-25 15:01:41,006 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 15:01:41,007 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 574 [2021-03-25 15:01:41,007 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 158 flow [2021-03-25 15:01:41,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 15:01:41,008 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:41,008 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:41,008 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 15:01:41,008 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:41,008 INFO L82 PathProgramCache]: Analyzing trace with hash 647587625, now seen corresponding path program 1 times [2021-03-25 15:01:41,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:41,008 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511912478] [2021-03-25 15:01:41,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 15:01:41,043 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:41,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:01:41,046 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:41,046 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 15:01:41,050 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 15:01:41,051 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 15:01:41,057 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 15:01:41,058 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 15:01:41,058 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 15:01:41,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511912478] [2021-03-25 15:01:41,058 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 15:01:41,058 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 15:01:41,058 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717542918] [2021-03-25 15:01:41,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 15:01:41,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 15:01:41,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 15:01:41,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 15:01:41,060 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 144 [2021-03-25 15:01:41,060 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 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 15:01:41,060 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 15:01:41,060 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 144 [2021-03-25 15:01:41,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 15:01:41,100 INFO L129 PetriNetUnfolder]: 4/34 cut-off events. [2021-03-25 15:01:41,100 INFO L130 PetriNetUnfolder]: For 88/102 co-relation queries the response was YES. [2021-03-25 15:01:41,100 INFO L84 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 34 events. 4/34 cut-off events. For 88/102 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 79 event pairs, 0 based on Foata normal form. 19/52 useless extension candidates. Maximal degree in co-relation 129. Up to 14 conditions per place. [2021-03-25 15:01:41,100 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 2 selfloop transitions, 8 changer transitions 2/25 dead transitions. [2021-03-25 15:01:41,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 25 transitions, 198 flow [2021-03-25 15:01:41,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 15:01:41,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 15:01:41,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 826 transitions. [2021-03-25 15:01:41,103 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2021-03-25 15:01:41,103 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 826 transitions. [2021-03-25 15:01:41,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 826 transitions. [2021-03-25 15:01:41,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 15:01:41,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 826 transitions. [2021-03-25 15:01:41,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.0) internal successors, (826), 7 states have internal predecessors, (826), 0 states have call successors, (0), 0 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 15:01:41,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 144.0) internal successors, (1152), 8 states have internal predecessors, (1152), 0 states have call successors, (0), 0 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 15:01:41,107 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 144.0) internal successors, (1152), 8 states have internal predecessors, (1152), 0 states have call successors, (0), 0 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 15:01:41,107 INFO L185 Difference]: Start difference. First operand has 39 places, 22 transitions, 158 flow. Second operand 7 states and 826 transitions. [2021-03-25 15:01:41,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 25 transitions, 198 flow [2021-03-25 15:01:41,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 25 transitions, 139 flow, removed 17 selfloop flow, removed 8 redundant places. [2021-03-25 15:01:41,108 INFO L241 Difference]: Finished difference. Result has 40 places, 23 transitions, 134 flow [2021-03-25 15:01:41,108 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=134, PETRI_PLACES=40, PETRI_TRANSITIONS=23} [2021-03-25 15:01:41,108 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 3 predicate places. [2021-03-25 15:01:41,109 INFO L165 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-03-25 15:01:41,109 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 40 places, 23 transitions, 134 flow [2021-03-25 15:01:41,109 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 40 places, 23 transitions, 134 flow [2021-03-25 15:01:41,109 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 23 transitions, 134 flow [2021-03-25 15:01:41,112 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-03-25 15:01:41,113 INFO L130 PetriNetUnfolder]: For 36/42 co-relation queries the response was YES. [2021-03-25 15:01:41,113 INFO L84 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 27 events. 3/27 cut-off events. For 36/42 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 44 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 78. Up to 10 conditions per place. [2021-03-25 15:01:41,113 INFO L142 LiptonReduction]: Number of co-enabled transitions 40 [2021-03-25 15:01:41,784 WARN L205 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 178 [2021-03-25 15:01:42,004 WARN L205 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-25 15:01:43,814 WARN L205 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 333 DAG size of output: 258 [2021-03-25 15:01:44,305 WARN L205 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2021-03-25 15:01:44,555 WARN L205 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 15:01:44,792 WARN L205 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 15:01:45,529 WARN L205 SmtUtils]: Spent 735.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 15:01:46,155 WARN L205 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 249 [2021-03-25 15:01:46,159 INFO L154 LiptonReduction]: Checked pairs total: 15 [2021-03-25 15:01:46,159 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 15:01:46,159 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5050 [2021-03-25 15:01:46,160 INFO L480 AbstractCegarLoop]: Abstraction has has 36 places, 18 transitions, 112 flow [2021-03-25 15:01:46,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 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 15:01:46,160 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 15:01:46,160 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 15:01:46,160 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 15:01:46,160 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 15:01:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 15:01:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2091476218, now seen corresponding path program 1 times [2021-03-25 15:01:46,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 15:01:46,161 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581377871] [2021-03-25 15:01:46,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 15:01:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:01:46,192 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:01:46,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 15:01:46,225 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 15:01:46,255 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 15:01:46,255 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 15:01:46,255 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 15:01:46,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 03:01:46 BasicIcfg [2021-03-25 15:01:46,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 15:01:46,337 INFO L168 Benchmark]: Toolchain (without parser) took 23312.75 ms. Allocated memory was 329.3 MB in the beginning and 696.3 MB in the end (delta: 367.0 MB). Free memory was 292.2 MB in the beginning and 550.8 MB in the end (delta: -258.6 MB). Peak memory consumption was 109.6 MB. Max. memory is 16.0 GB. [2021-03-25 15:01:46,337 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 329.3 MB. Free memory was 310.8 MB in the beginning and 310.7 MB in the end (delta: 75.8 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 15:01:46,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 507.59 ms. Allocated memory is still 329.3 MB. Free memory was 292.0 MB in the beginning and 288.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. [2021-03-25 15:01:46,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.93 ms. Allocated memory is still 329.3 MB. Free memory was 288.1 MB in the beginning and 286.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 15:01:46,341 INFO L168 Benchmark]: Boogie Preprocessor took 24.05 ms. Allocated memory is still 329.3 MB. Free memory was 286.0 MB in the beginning and 283.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 15:01:46,341 INFO L168 Benchmark]: RCFGBuilder took 1558.75 ms. Allocated memory is still 329.3 MB. Free memory was 283.9 MB in the beginning and 266.1 MB in the end (delta: 17.8 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. [2021-03-25 15:01:46,344 INFO L168 Benchmark]: TraceAbstraction took 21167.50 ms. Allocated memory was 329.3 MB in the beginning and 696.3 MB in the end (delta: 367.0 MB). Free memory was 265.0 MB in the beginning and 550.8 MB in the end (delta: -285.8 MB). Peak memory consumption was 81.2 MB. Max. memory is 16.0 GB. [2021-03-25 15:01:46,345 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 329.3 MB. Free memory was 310.8 MB in the beginning and 310.7 MB in the end (delta: 75.8 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 507.59 ms. Allocated memory is still 329.3 MB. Free memory was 292.0 MB in the beginning and 288.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 48.93 ms. Allocated memory is still 329.3 MB. Free memory was 288.1 MB in the beginning and 286.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 24.05 ms. Allocated memory is still 329.3 MB. Free memory was 286.0 MB in the beginning and 283.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1558.75 ms. Allocated memory is still 329.3 MB. Free memory was 283.9 MB in the beginning and 266.1 MB in the end (delta: 17.8 MB). Peak memory consumption was 161.5 MB. Max. memory is 16.0 GB. * TraceAbstraction took 21167.50 ms. Allocated memory was 329.3 MB in the beginning and 696.3 MB in the end (delta: 367.0 MB). Free memory was 265.0 MB in the beginning and 550.8 MB in the end (delta: -285.8 MB). Peak memory consumption was 81.2 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7800.1ms, 82 PlacesBefore, 37 PlacesAfterwards, 77 TransitionsBefore, 31 TransitionsAfterwards, 918 CoEnabledTransitionPairs, 5 FixpointIterations, 24 TrivialSequentialCompositions, 27 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 1 ConcurrentYvCompositions, 1 ChoiceCompositions, 53 TotalNumberOfCompositions, 1657 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 809, positive: 743, positive conditional: 0, positive unconditional: 743, negative: 66, negative conditional: 0, negative unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 603, positive: 572, positive conditional: 0, positive unconditional: 572, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 603, positive: 572, positive conditional: 0, positive unconditional: 572, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 603, positive: 570, positive conditional: 0, positive unconditional: 570, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 33, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 562, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 556, negative conditional: 0, negative unconditional: 556, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 809, positive: 171, positive conditional: 0, positive unconditional: 171, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 603, unknown conditional: 0, unknown unconditional: 603] , Statistics on independence cache: Total cache size (in pairs): 89, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2501.8ms, 35 PlacesBefore, 25 PlacesAfterwards, 24 TransitionsBefore, 18 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 5 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 448 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 172, positive: 123, positive conditional: 0, positive unconditional: 123, negative: 49, negative conditional: 0, negative unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 27, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 27, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 160, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 145, negative conditional: 0, negative unconditional: 145, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 172, positive: 107, positive conditional: 0, positive unconditional: 107, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 27, unknown conditional: 0, unknown unconditional: 27] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 76, Positive conditional cache size: 0, Positive unconditional cache size: 76, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1040.5ms, 26 PlacesBefore, 24 PlacesAfterwards, 20 TransitionsBefore, 18 TransitionsAfterwards, 118 CoEnabledTransitionPairs, 3 FixpointIterations, 2 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 2 TotalNumberOfCompositions, 354 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 119, positive: 80, positive conditional: 0, positive unconditional: 80, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 119, positive: 78, positive conditional: 0, positive unconditional: 78, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 58.0ms, 26 PlacesBefore, 26 PlacesAfterwards, 20 TransitionsBefore, 20 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 76 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 27, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 50, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 50, negative conditional: 0, negative unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 27, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 100, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 92.8ms, 32 PlacesBefore, 32 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 134 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 48 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 2, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 80, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 80, negative conditional: 0, negative unconditional: 80, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 14, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 3, negative conditional: 0, negative unconditional: 3, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 102, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.6ms, 35 PlacesBefore, 35 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 142 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 18 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 4, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.0ms, 38 PlacesBefore, 38 PlacesAfterwards, 30 TransitionsBefore, 30 TransitionsAfterwards, 150 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 44 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 103, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 24, Negative conditional cache size: 0, Negative unconditional cache size: 24 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 719.6ms, 43 PlacesBefore, 43 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 158 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 170 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 63, positive: 49, positive conditional: 0, positive unconditional: 49, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 63, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.7ms, 45 PlacesBefore, 45 PlacesAfterwards, 34 TransitionsBefore, 34 TransitionsAfterwards, 154 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 42 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 10, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 17.0ms, 49 PlacesBefore, 45 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 90 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 55 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, 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: 13, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 14.6ms, 44 PlacesBefore, 44 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 94 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 64 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 13, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, 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: 13, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 5, negative conditional: 0, negative unconditional: 5, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.8ms, 46 PlacesBefore, 40 PlacesAfterwards, 21 TransitionsBefore, 21 TransitionsAfterwards, 74 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 24 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 8, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 4, negative conditional: 0, negative unconditional: 4, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 97, Positive cache size: 80, Positive conditional cache size: 0, Positive unconditional cache size: 80, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 572.9ms, 40 PlacesBefore, 39 PlacesAfterwards, 23 TransitionsBefore, 22 TransitionsAfterwards, 54 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 9 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 9, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5050.2ms, 40 PlacesBefore, 36 PlacesAfterwards, 23 TransitionsBefore, 18 TransitionsAfterwards, 40 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 TotalNumberOfCompositions, 15 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15, positive: 15, positive conditional: 0, positive unconditional: 15, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 15, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 33, Positive cache size: 32, Positive conditional cache size: 0, Positive unconditional cache size: 32, Negative cache size: 1, Negative conditional cache size: 0, Negative unconditional cache size: 1 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L713] 0 _Bool x$flush_delayed; [L714] 0 int x$mem_tmp; [L715] 0 _Bool x$r_buff0_thd0; [L716] 0 _Bool x$r_buff0_thd1; [L717] 0 _Bool x$r_buff0_thd2; [L718] 0 _Bool x$r_buff1_thd0; [L719] 0 _Bool x$r_buff1_thd1; [L720] 0 _Bool x$r_buff1_thd2; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2475; [L791] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] 0 pthread_t t2476; [L793] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 2 x$w_buff1 = x$w_buff0 [L755] 2 x$w_buff0 = 2 [L756] 2 x$w_buff1_used = x$w_buff0_used [L757] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L759] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L760] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L761] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L762] 2 x$r_buff0_thd2 = (_Bool)1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L734] 1 y = 2 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L743] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L744] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L772] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L800] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L801] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L802] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L803] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L803] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 x$flush_delayed = weak$$choice2 [L809] 0 x$mem_tmp = x [L810] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L810] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L811] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L811] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L812] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L812] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L813] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L813] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L814] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L815] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L815] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L816] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L818] 0 x = x$flush_delayed ? x$mem_tmp : x [L819] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 78 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 3.8ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20982.1ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1200.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7865.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 52 SDtfs, 34 SDslu, 29 SDs, 0 SdLazy, 294 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 387.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 529.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=242occurred in iteration=7, InterpolantAutomatonStates: 60, 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: 50.3ms SsaConstructionTime, 415.4ms SatisfiabilityAnalysisTime, 1022.8ms InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...