/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-RepeatedVariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 05:09:00,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 05:09:00,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 05:09:00,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 05:09:00,478 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 05:09:00,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 05:09:00,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 05:09:00,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 05:09:00,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 05:09:00,492 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 05:09:00,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 05:09:00,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 05:09:00,494 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 05:09:00,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 05:09:00,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 05:09:00,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 05:09:00,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 05:09:00,500 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 05:09:00,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 05:09:00,507 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 05:09:00,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 05:09:00,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 05:09:00,509 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 05:09:00,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 05:09:00,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 05:09:00,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 05:09:00,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 05:09:00,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 05:09:00,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 05:09:00,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 05:09:00,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 05:09:00,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 05:09:00,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 05:09:00,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 05:09:00,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 05:09:00,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 05:09:00,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 05:09:00,520 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 05:09:00,520 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 05:09:00,521 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 05:09:00,521 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 05:09:00,522 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-RepeatedVariableLbe.epf [2021-03-25 05:09:00,548 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 05:09:00,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 05:09:00,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 05:09:00,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 05:09:00,551 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 05:09:00,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 05:09:00,551 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 05:09:00,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 05:09:00,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 05:09:00,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 05:09:00,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 05:09:00,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 05:09:00,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 05:09:00,553 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 05:09:00,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 05:09:00,553 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 05:09:00,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 05:09:00,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 05:09:00,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 05:09:00,553 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 05:09:00,553 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 05:09:00,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 05:09:00,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 05:09:00,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 05:09:00,554 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 05:09:00,554 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 05:09:00,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 05:09:00,554 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 05:09:00,554 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 05:09:00,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 05:09:00,554 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 05:09:00,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 05:09:00,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 05:09:00,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 05:09:00,789 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 05:09:00,789 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 05:09:00,790 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2021-03-25 05:09:00,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406a8957a/04edfa8c6b254a4790c147fb58892b6b/FLAGb348a355a [2021-03-25 05:09:01,218 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 05:09:01,218 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.opt.i [2021-03-25 05:09:01,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406a8957a/04edfa8c6b254a4790c147fb58892b6b/FLAGb348a355a [2021-03-25 05:09:01,582 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/406a8957a/04edfa8c6b254a4790c147fb58892b6b [2021-03-25 05:09:01,583 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 05:09:01,584 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 05:09:01,585 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 05:09:01,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 05:09:01,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 05:09:01,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:01,589 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@337a145c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01, skipping insertion in model container [2021-03-25 05:09:01,589 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:01,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 05:09:01,620 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 05:09:01,732 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_rmo.opt.i[949,962] [2021-03-25 05:09:01,903 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:09:01,908 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 05:09:01,914 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_rmo.opt.i[949,962] [2021-03-25 05:09:01,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 05:09:01,979 INFO L208 MainTranslator]: Completed translation [2021-03-25 05:09:01,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01 WrapperNode [2021-03-25 05:09:01,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 05:09:01,980 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 05:09:01,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 05:09:01,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 05:09:01,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:01,995 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:02,013 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 05:09:02,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 05:09:02,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 05:09:02,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 05:09:02,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:02,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:02,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:02,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:02,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:02,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:02,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (1/1) ... [2021-03-25 05:09:02,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 05:09:02,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 05:09:02,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 05:09:02,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 05:09:02,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (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 05:09:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 05:09:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 05:09:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 05:09:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 05:09:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 05:09:02,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 05:09:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 05:09:02,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 05:09:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 05:09:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 05:09:02,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 05:09:02,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 05:09:02,114 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 05:09:03,277 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 05:09:03,277 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 05:09:03,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:09:03 BoogieIcfgContainer [2021-03-25 05:09:03,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 05:09:03,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 05:09:03,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 05:09:03,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 05:09:03,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 05:09:01" (1/3) ... [2021-03-25 05:09:03,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2567b0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:09:03, skipping insertion in model container [2021-03-25 05:09:03,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 05:09:01" (2/3) ... [2021-03-25 05:09:03,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2567b0cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 05:09:03, skipping insertion in model container [2021-03-25 05:09:03,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 05:09:03" (3/3) ... [2021-03-25 05:09:03,283 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.opt.i [2021-03-25 05:09:03,288 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 05:09:03,290 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 05:09:03,291 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 05:09:03,313 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,314 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,315 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,316 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,317 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,318 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,321 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,322 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,322 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,322 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,323 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,323 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,324 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 05:09:03,326 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 05:09:03,337 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-03-25 05:09:03,356 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 05:09:03,356 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 05:09:03,356 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 05:09:03,356 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 05:09:03,356 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 05:09:03,356 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 05:09:03,357 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 05:09:03,357 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 05:09:03,365 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 84 places, 79 transitions, 168 flow [2021-03-25 05:09:03,394 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-25 05:09:03,395 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:09:03,399 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 05:09:03,400 INFO L82 GeneralOperation]: Start removeDead. Operand has 84 places, 79 transitions, 168 flow [2021-03-25 05:09:03,403 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 82 places, 77 transitions, 160 flow [2021-03-25 05:09:03,404 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:03,410 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-25 05:09:03,412 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 82 places, 77 transitions, 160 flow [2021-03-25 05:09:03,415 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 82 places, 77 transitions, 160 flow [2021-03-25 05:09:03,433 INFO L129 PetriNetUnfolder]: 2/77 cut-off events. [2021-03-25 05:09:03,434 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:09:03,434 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 05:09:03,440 INFO L142 LiptonReduction]: Number of co-enabled transitions 918 [2021-03-25 05:09:04,249 WARN L205 SmtUtils]: Spent 583.00 ms on a formula simplification. DAG size of input: 224 DAG size of output: 183 [2021-03-25 05:09:04,509 WARN L205 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 181 [2021-03-25 05:09:05,704 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 308 DAG size of output: 264 [2021-03-25 05:09:06,230 WARN L205 SmtUtils]: Spent 524.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2021-03-25 05:09:06,695 WARN L205 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 05:09:07,047 WARN L205 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 05:09:07,173 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 05:09:07,853 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 05:09:08,103 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-03-25 05:09:08,619 WARN L205 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 05:09:09,173 WARN L205 SmtUtils]: Spent 552.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 05:09:09,404 INFO L154 LiptonReduction]: Checked pairs total: 1657 [2021-03-25 05:09:09,405 INFO L156 LiptonReduction]: Total number of compositions: 53 [2021-03-25 05:09:09,406 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 6003 [2021-03-25 05:09:09,412 INFO L129 PetriNetUnfolder]: 0/14 cut-off events. [2021-03-25 05:09:09,412 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:09:09,412 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:09,412 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:09,413 INFO L428 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:09,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:09,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1463710772, now seen corresponding path program 1 times [2021-03-25 05:09:09,424 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:09,424 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376522160] [2021-03-25 05:09:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:09,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:09,581 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:09,582 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:09:09,583 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:09,583 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:09:09,587 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 05:09:09,588 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376522160] [2021-03-25 05:09:09,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:09,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:09:09,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378585294] [2021-03-25 05:09:09,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:09:09,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:09,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:09:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:09:09,603 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 132 [2021-03-25 05:09:09,606 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 05:09:09,606 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:09,606 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 132 [2021-03-25 05:09:09,606 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:09,666 INFO L129 PetriNetUnfolder]: 23/91 cut-off events. [2021-03-25 05:09:09,666 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:09:09,667 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 05:09:09,668 INFO L132 encePairwiseOnDemand]: 128/132 looper letters, 7 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2021-03-25 05:09:09,668 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 32 transitions, 92 flow [2021-03-25 05:09:09,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:09:09,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:09:09,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2021-03-25 05:09:09,681 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8762626262626263 [2021-03-25 05:09:09,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2021-03-25 05:09:09,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2021-03-25 05:09:09,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:09,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2021-03-25 05:09:09,689 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 05:09:09,694 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 05:09:09,694 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 05:09:09,696 INFO L185 Difference]: Start difference. First operand has 37 places, 31 transitions, 68 flow. Second operand 3 states and 347 transitions. [2021-03-25 05:09:09,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 32 transitions, 92 flow [2021-03-25 05:09:09,697 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 05:09:09,698 INFO L241 Difference]: Finished difference. Result has 35 places, 24 transitions, 56 flow [2021-03-25 05:09:09,700 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 05:09:09,700 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-25 05:09:09,700 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:09,700 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-25 05:09:09,701 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 24 transitions, 56 flow [2021-03-25 05:09:09,701 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 56 flow [2021-03-25 05:09:09,707 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 05:09:09,707 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:09:09,707 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 05:09:09,707 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-25 05:09:10,028 WARN L205 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 05:09:10,337 WARN L205 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 05:09:10,914 WARN L205 SmtUtils]: Spent 575.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 05:09:11,438 WARN L205 SmtUtils]: Spent 522.00 ms on a formula simplification that was a NOOP. DAG size: 264 [2021-03-25 05:09:11,723 INFO L154 LiptonReduction]: Checked pairs total: 448 [2021-03-25 05:09:11,723 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 05:09:11,724 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2024 [2021-03-25 05:09:11,724 INFO L480 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 44 flow [2021-03-25 05:09:11,724 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 05:09:11,724 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:11,725 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:11,725 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 05:09:11,725 INFO L428 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:11,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:11,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1396965882, now seen corresponding path program 1 times [2021-03-25 05:09:11,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:11,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460400178] [2021-03-25 05:09:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:11,820 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:11,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:09:11,821 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:11,821 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:09:11,823 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:11,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:09:11,826 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 05:09:11,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460400178] [2021-03-25 05:09:11,826 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:11,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:09:11,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564604582] [2021-03-25 05:09:11,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:09:11,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:11,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:09:11,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:09:11,829 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 138 [2021-03-25 05:09:11,829 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 05:09:11,829 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:11,829 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 138 [2021-03-25 05:09:11,829 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:11,840 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2021-03-25 05:09:11,841 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 05:09:11,841 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 05:09:11,841 INFO L132 encePairwiseOnDemand]: 134/138 looper letters, 3 selfloop transitions, 3 changer transitions 0/20 dead transitions. [2021-03-25 05:09:11,841 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 20 transitions, 60 flow [2021-03-25 05:09:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:09:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:09:11,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions. [2021-03-25 05:09:11,842 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8502415458937198 [2021-03-25 05:09:11,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 352 transitions. [2021-03-25 05:09:11,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions. [2021-03-25 05:09:11,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:11,843 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions. [2021-03-25 05:09:11,843 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 05:09:11,844 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 05:09:11,845 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 05:09:11,845 INFO L185 Difference]: Start difference. First operand has 25 places, 18 transitions, 44 flow. Second operand 3 states and 352 transitions. [2021-03-25 05:09:11,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 20 transitions, 60 flow [2021-03-25 05:09:11,845 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 05:09:11,845 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 59 flow [2021-03-25 05:09:11,845 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 05:09:11,846 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -11 predicate places. [2021-03-25 05:09:11,846 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:11,846 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 59 flow [2021-03-25 05:09:11,846 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 59 flow [2021-03-25 05:09:11,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 59 flow [2021-03-25 05:09:11,849 INFO L129 PetriNetUnfolder]: 3/27 cut-off events. [2021-03-25 05:09:11,849 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2021-03-25 05:09:11,849 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 05:09:11,849 INFO L142 LiptonReduction]: Number of co-enabled transitions 118 [2021-03-25 05:09:12,333 WARN L205 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-25 05:09:12,655 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 104 [2021-03-25 05:09:12,754 INFO L154 LiptonReduction]: Checked pairs total: 354 [2021-03-25 05:09:12,754 INFO L156 LiptonReduction]: Total number of compositions: 2 [2021-03-25 05:09:12,754 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 908 [2021-03-25 05:09:12,755 INFO L480 AbstractCegarLoop]: Abstraction has has 24 places, 18 transitions, 55 flow [2021-03-25 05:09:12,755 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 05:09:12,755 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:12,755 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:12,755 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 05:09:12,755 INFO L428 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:12,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1388591254, now seen corresponding path program 1 times [2021-03-25 05:09:12,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:12,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462063621] [2021-03-25 05:09:12,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:12,869 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:12,870 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:09:12,876 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:12,877 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:12,883 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:12,884 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:09:12,890 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:12,890 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:12,898 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 05:09:12,898 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462063621] [2021-03-25 05:09:12,898 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:12,898 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:09:12,898 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843957794] [2021-03-25 05:09:12,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:09:12,899 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:12,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:09:12,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:09:12,903 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 140 [2021-03-25 05:09:12,904 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 18 transitions, 55 flow. Second operand has 5 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 05:09:12,904 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:12,904 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 140 [2021-03-25 05:09:12,904 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:12,947 INFO L129 PetriNetUnfolder]: 35/89 cut-off events. [2021-03-25 05:09:12,947 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2021-03-25 05:09:12,948 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 05:09:12,949 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 3 changer transitions 0/21 dead transitions. [2021-03-25 05:09:12,949 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 81 flow [2021-03-25 05:09:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:09:12,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:09:12,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2021-03-25 05:09:12,950 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7476190476190476 [2021-03-25 05:09:12,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2021-03-25 05:09:12,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2021-03-25 05:09:12,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:12,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2021-03-25 05:09:12,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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 05:09:12,952 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 05:09:12,952 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 05:09:12,952 INFO L185 Difference]: Start difference. First operand has 24 places, 18 transitions, 55 flow. Second operand 3 states and 314 transitions. [2021-03-25 05:09:12,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 81 flow [2021-03-25 05:09:12,953 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 05:09:12,953 INFO L241 Difference]: Finished difference. Result has 26 places, 20 transitions, 71 flow [2021-03-25 05:09:12,953 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 05:09:12,953 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -11 predicate places. [2021-03-25 05:09:12,953 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:12,953 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 26 places, 20 transitions, 71 flow [2021-03-25 05:09:12,954 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 26 places, 20 transitions, 71 flow [2021-03-25 05:09:12,954 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 26 places, 20 transitions, 71 flow [2021-03-25 05:09:12,959 INFO L129 PetriNetUnfolder]: 7/37 cut-off events. [2021-03-25 05:09:12,959 INFO L130 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2021-03-25 05:09:12,959 INFO L84 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 37 events. 7/37 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 113 event pairs, 3 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 65. Up to 15 conditions per place. [2021-03-25 05:09:12,960 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-25 05:09:12,960 INFO L154 LiptonReduction]: Checked pairs total: 76 [2021-03-25 05:09:12,960 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:12,960 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 05:09:12,961 INFO L480 AbstractCegarLoop]: Abstraction has has 26 places, 20 transitions, 71 flow [2021-03-25 05:09:12,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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 05:09:12,961 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:12,964 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:12,966 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 05:09:12,966 INFO L428 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:12,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1850481260, now seen corresponding path program 1 times [2021-03-25 05:09:12,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:12,967 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753401201] [2021-03-25 05:09:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:13,037 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,037 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:13,042 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,043 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:09:13,049 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,049 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:13,055 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 05:09:13,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753401201] [2021-03-25 05:09:13,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:13,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:09:13,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301000268] [2021-03-25 05:09:13,056 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:09:13,056 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:13,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:09:13,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:09:13,058 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 140 [2021-03-25 05:09:13,058 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 71 flow. Second operand has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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 05:09:13,058 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:13,058 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 140 [2021-03-25 05:09:13,059 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:13,111 INFO L129 PetriNetUnfolder]: 38/97 cut-off events. [2021-03-25 05:09:13,111 INFO L130 PetriNetUnfolder]: For 42/42 co-relation queries the response was YES. [2021-03-25 05:09:13,111 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 97 events. 38/97 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 366 event pairs, 9 based on Foata normal form. 3/97 useless extension candidates. Maximal degree in co-relation 219. Up to 54 conditions per place. [2021-03-25 05:09:13,112 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 9 selfloop transitions, 8 changer transitions 0/28 dead transitions. [2021-03-25 05:09:13,112 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 28 transitions, 127 flow [2021-03-25 05:09:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:09:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:09:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 528 transitions. [2021-03-25 05:09:13,113 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7542857142857143 [2021-03-25 05:09:13,114 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 528 transitions. [2021-03-25 05:09:13,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 528 transitions. [2021-03-25 05:09:13,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:13,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 528 transitions. [2021-03-25 05:09:13,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.6) internal successors, (528), 5 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 05:09:13,116 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 05:09:13,116 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 05:09:13,116 INFO L185 Difference]: Start difference. First operand has 26 places, 20 transitions, 71 flow. Second operand 5 states and 528 transitions. [2021-03-25 05:09:13,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 28 transitions, 127 flow [2021-03-25 05:09:13,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 28 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 05:09:13,117 INFO L241 Difference]: Finished difference. Result has 31 places, 24 transitions, 108 flow [2021-03-25 05:09:13,117 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=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2021-03-25 05:09:13,117 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -6 predicate places. [2021-03-25 05:09:13,118 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:13,118 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 31 places, 24 transitions, 108 flow [2021-03-25 05:09:13,118 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 31 places, 24 transitions, 108 flow [2021-03-25 05:09:13,118 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 31 places, 24 transitions, 108 flow [2021-03-25 05:09:13,123 INFO L129 PetriNetUnfolder]: 14/57 cut-off events. [2021-03-25 05:09:13,123 INFO L130 PetriNetUnfolder]: For 66/69 co-relation queries the response was YES. [2021-03-25 05:09:13,124 INFO L84 FinitePrefix]: Finished finitePrefix Result has 153 conditions, 57 events. 14/57 cut-off events. For 66/69 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 200 event pairs, 7 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 140. Up to 21 conditions per place. [2021-03-25 05:09:13,124 INFO L142 LiptonReduction]: Number of co-enabled transitions 146 [2021-03-25 05:09:13,125 INFO L154 LiptonReduction]: Checked pairs total: 70 [2021-03-25 05:09:13,125 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:13,125 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7 [2021-03-25 05:09:13,126 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 108 flow [2021-03-25 05:09:13,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 102.8) internal successors, (514), 5 states have internal predecessors, (514), 0 states have call successors, (0), 0 states 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 05:09:13,126 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:13,126 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:13,126 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 05:09:13,126 INFO L428 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:13,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:13,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1125626090, now seen corresponding path program 1 times [2021-03-25 05:09:13,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:13,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224809678] [2021-03-25 05:09:13,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:13,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:13,184 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 05:09:13,192 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,192 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:13,202 INFO L142 QuantifierPusher]: treesize reduction 10, result has 81.5 percent of original size [2021-03-25 05:09:13,204 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-03-25 05:09:13,222 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 05:09:13,222 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224809678] [2021-03-25 05:09:13,223 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:13,223 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:09:13,224 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078937631] [2021-03-25 05:09:13,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:09:13,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:09:13,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:09:13,228 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 140 [2021-03-25 05:09:13,229 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 108 flow. Second operand has 5 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 05:09:13,229 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:13,229 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 140 [2021-03-25 05:09:13,229 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:13,274 INFO L129 PetriNetUnfolder]: 31/84 cut-off events. [2021-03-25 05:09:13,274 INFO L130 PetriNetUnfolder]: For 128/128 co-relation queries the response was YES. [2021-03-25 05:09:13,275 INFO L84 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 84 events. 31/84 cut-off events. For 128/128 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 296 event pairs, 9 based on Foata normal form. 3/85 useless extension candidates. Maximal degree in co-relation 243. Up to 53 conditions per place. [2021-03-25 05:09:13,276 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 12 selfloop transitions, 5 changer transitions 0/28 dead transitions. [2021-03-25 05:09:13,276 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 154 flow [2021-03-25 05:09:13,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 05:09:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 05:09:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2021-03-25 05:09:13,278 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7464285714285714 [2021-03-25 05:09:13,278 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2021-03-25 05:09:13,279 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2021-03-25 05:09:13,279 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:13,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2021-03-25 05:09:13,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states 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 05:09:13,280 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 05:09:13,281 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 05:09:13,281 INFO L185 Difference]: Start difference. First operand has 31 places, 24 transitions, 108 flow. Second operand 4 states and 418 transitions. [2021-03-25 05:09:13,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 154 flow [2021-03-25 05:09:13,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 152 flow, removed 1 selfloop flow, removed 0 redundant places. [2021-03-25 05:09:13,283 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 133 flow [2021-03-25 05:09:13,283 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2021-03-25 05:09:13,284 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, -2 predicate places. [2021-03-25 05:09:13,284 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:13,284 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 26 transitions, 133 flow [2021-03-25 05:09:13,284 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 26 transitions, 133 flow [2021-03-25 05:09:13,284 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 26 transitions, 133 flow [2021-03-25 05:09:13,289 INFO L129 PetriNetUnfolder]: 12/48 cut-off events. [2021-03-25 05:09:13,290 INFO L130 PetriNetUnfolder]: For 70/73 co-relation queries the response was YES. [2021-03-25 05:09:13,290 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 48 events. 12/48 cut-off events. For 70/73 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 151 event pairs, 3 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 133. Up to 17 conditions per place. [2021-03-25 05:09:13,290 INFO L142 LiptonReduction]: Number of co-enabled transitions 156 [2021-03-25 05:09:13,291 INFO L154 LiptonReduction]: Checked pairs total: 90 [2021-03-25 05:09:13,291 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:13,292 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8 [2021-03-25 05:09:13,294 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 133 flow [2021-03-25 05:09:13,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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 05:09:13,294 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:13,294 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:13,295 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 05:09:13,295 INFO L428 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:13,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1530342917, now seen corresponding path program 1 times [2021-03-25 05:09:13,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:13,296 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727497498] [2021-03-25 05:09:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:13,355 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,355 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:09:13,363 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,363 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 05:09:13,373 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,374 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:09:13,383 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,383 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:13,390 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 05:09:13,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727497498] [2021-03-25 05:09:13,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:13,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:09:13,390 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366360789] [2021-03-25 05:09:13,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:09:13,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:13,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:09:13,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:09:13,392 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2021-03-25 05:09:13,393 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 133 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 05:09:13,393 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:13,393 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2021-03-25 05:09:13,393 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:13,448 INFO L129 PetriNetUnfolder]: 30/83 cut-off events. [2021-03-25 05:09:13,449 INFO L130 PetriNetUnfolder]: For 196/198 co-relation queries the response was YES. [2021-03-25 05:09:13,449 INFO L84 FinitePrefix]: Finished finitePrefix Result has 287 conditions, 83 events. 30/83 cut-off events. For 196/198 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 304 event pairs, 7 based on Foata normal form. 3/82 useless extension candidates. Maximal degree in co-relation 269. Up to 45 conditions per place. [2021-03-25 05:09:13,449 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 11 selfloop transitions, 8 changer transitions 0/30 dead transitions. [2021-03-25 05:09:13,449 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 30 transitions, 183 flow [2021-03-25 05:09:13,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:09:13,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:09:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 497 transitions. [2021-03-25 05:09:13,451 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.71 [2021-03-25 05:09:13,451 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 497 transitions. [2021-03-25 05:09:13,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 497 transitions. [2021-03-25 05:09:13,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:13,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 497 transitions. [2021-03-25 05:09:13,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.4) internal successors, (497), 5 states have internal predecessors, (497), 0 states have call successors, (0), 0 states 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 05:09:13,453 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 05:09:13,453 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 05:09:13,454 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 133 flow. Second operand 5 states and 497 transitions. [2021-03-25 05:09:13,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 30 transitions, 183 flow [2021-03-25 05:09:13,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 30 transitions, 172 flow, removed 2 selfloop flow, removed 2 redundant places. [2021-03-25 05:09:13,457 INFO L241 Difference]: Finished difference. Result has 39 places, 27 transitions, 158 flow [2021-03-25 05:09:13,457 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2021-03-25 05:09:13,457 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 2 predicate places. [2021-03-25 05:09:13,457 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:13,457 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 39 places, 27 transitions, 158 flow [2021-03-25 05:09:13,457 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 39 places, 27 transitions, 158 flow [2021-03-25 05:09:13,458 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 39 places, 27 transitions, 158 flow [2021-03-25 05:09:13,464 INFO L129 PetriNetUnfolder]: 8/44 cut-off events. [2021-03-25 05:09:13,464 INFO L130 PetriNetUnfolder]: For 137/140 co-relation queries the response was YES. [2021-03-25 05:09:13,464 INFO L84 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 44 events. 8/44 cut-off events. For 137/140 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 155 event pairs, 2 based on Foata normal form. 1/43 useless extension candidates. Maximal degree in co-relation 138. Up to 15 conditions per place. [2021-03-25 05:09:13,465 INFO L142 LiptonReduction]: Number of co-enabled transitions 164 [2021-03-25 05:09:13,466 INFO L154 LiptonReduction]: Checked pairs total: 105 [2021-03-25 05:09:13,466 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:13,466 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 05:09:13,467 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 158 flow [2021-03-25 05:09:13,467 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 05:09:13,468 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:13,468 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:13,468 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 05:09:13,468 INFO L428 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash -573907530, now seen corresponding path program 1 times [2021-03-25 05:09:13,468 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:13,468 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737138251] [2021-03-25 05:09:13,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:13,522 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,522 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:09:13,528 INFO L142 QuantifierPusher]: treesize reduction 10, result has 82.5 percent of original size [2021-03-25 05:09:13,529 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 47 [2021-03-25 05:09:13,560 INFO L142 QuantifierPusher]: treesize reduction 10, result has 83.6 percent of original size [2021-03-25 05:09:13,561 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 51 [2021-03-25 05:09:13,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:09:13,587 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 05:09:13,587 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737138251] [2021-03-25 05:09:13,588 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:13,588 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:09:13,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204277520] [2021-03-25 05:09:13,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:09:13,588 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:13,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:09:13,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:09:13,589 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 140 [2021-03-25 05:09:13,590 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 158 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:09:13,590 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:13,590 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 140 [2021-03-25 05:09:13,590 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:13,650 INFO L129 PetriNetUnfolder]: 29/89 cut-off events. [2021-03-25 05:09:13,650 INFO L130 PetriNetUnfolder]: For 245/245 co-relation queries the response was YES. [2021-03-25 05:09:13,650 INFO L84 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 89 events. 29/89 cut-off events. For 245/245 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 363 event pairs, 4 based on Foata normal form. 2/88 useless extension candidates. Maximal degree in co-relation 294. Up to 43 conditions per place. [2021-03-25 05:09:13,651 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 12 selfloop transitions, 8 changer transitions 0/31 dead transitions. [2021-03-25 05:09:13,651 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 214 flow [2021-03-25 05:09:13,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:09:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:09:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 504 transitions. [2021-03-25 05:09:13,652 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.72 [2021-03-25 05:09:13,652 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 504 transitions. [2021-03-25 05:09:13,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 504 transitions. [2021-03-25 05:09:13,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:13,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 504 transitions. [2021-03-25 05:09:13,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.8) internal successors, (504), 5 states have internal predecessors, (504), 0 states have call successors, (0), 0 states 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 05:09:13,656 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 05:09:13,657 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 05:09:13,657 INFO L185 Difference]: Start difference. First operand has 39 places, 27 transitions, 158 flow. Second operand 5 states and 504 transitions. [2021-03-25 05:09:13,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 214 flow [2021-03-25 05:09:13,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 31 transitions, 191 flow, removed 6 selfloop flow, removed 3 redundant places. [2021-03-25 05:09:13,659 INFO L241 Difference]: Finished difference. Result has 41 places, 29 transitions, 173 flow [2021-03-25 05:09:13,659 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=173, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2021-03-25 05:09:13,659 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 4 predicate places. [2021-03-25 05:09:13,659 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:13,659 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 41 places, 29 transitions, 173 flow [2021-03-25 05:09:13,659 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 41 places, 29 transitions, 173 flow [2021-03-25 05:09:13,660 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 29 transitions, 173 flow [2021-03-25 05:09:13,666 INFO L129 PetriNetUnfolder]: 11/50 cut-off events. [2021-03-25 05:09:13,666 INFO L130 PetriNetUnfolder]: For 125/127 co-relation queries the response was YES. [2021-03-25 05:09:13,666 INFO L84 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 50 events. 11/50 cut-off events. For 125/127 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 165 event pairs, 2 based on Foata normal form. 1/49 useless extension candidates. Maximal degree in co-relation 155. Up to 16 conditions per place. [2021-03-25 05:09:13,666 INFO L142 LiptonReduction]: Number of co-enabled transitions 174 [2021-03-25 05:09:13,667 INFO L154 LiptonReduction]: Checked pairs total: 119 [2021-03-25 05:09:13,668 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:13,668 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 05:09:13,668 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 173 flow [2021-03-25 05:09:13,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:09:13,668 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:13,668 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:13,668 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 05:09:13,668 INFO L428 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:13,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash -534694533, now seen corresponding path program 1 times [2021-03-25 05:09:13,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:13,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195146171] [2021-03-25 05:09:13,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:13,716 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:09:13,717 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,717 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:09:13,719 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 05:09:13,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195146171] [2021-03-25 05:09:13,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:13,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 05:09:13,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021485172] [2021-03-25 05:09:13,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 05:09:13,720 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:13,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 05:09:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 05:09:13,721 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 140 [2021-03-25 05:09:13,721 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 05:09:13,721 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:13,721 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 140 [2021-03-25 05:09:13,722 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:13,734 INFO L129 PetriNetUnfolder]: 10/59 cut-off events. [2021-03-25 05:09:13,734 INFO L130 PetriNetUnfolder]: For 267/281 co-relation queries the response was YES. [2021-03-25 05:09:13,734 INFO L84 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 59 events. 10/59 cut-off events. For 267/281 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 211 event pairs, 1 based on Foata normal form. 9/67 useless extension candidates. Maximal degree in co-relation 188. Up to 20 conditions per place. [2021-03-25 05:09:13,734 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 3 selfloop transitions, 3 changer transitions 4/29 dead transitions. [2021-03-25 05:09:13,734 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 29 transitions, 185 flow [2021-03-25 05:09:13,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 05:09:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 05:09:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2021-03-25 05:09:13,735 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8714285714285714 [2021-03-25 05:09:13,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2021-03-25 05:09:13,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2021-03-25 05:09:13,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:13,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2021-03-25 05:09:13,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 05:09:13,737 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 05:09:13,737 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 05:09:13,737 INFO L185 Difference]: Start difference. First operand has 41 places, 29 transitions, 173 flow. Second operand 3 states and 366 transitions. [2021-03-25 05:09:13,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 29 transitions, 185 flow [2021-03-25 05:09:13,738 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 29 transitions, 174 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 05:09:13,739 INFO L241 Difference]: Finished difference. Result has 42 places, 25 transitions, 147 flow [2021-03-25 05:09:13,739 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2021-03-25 05:09:13,739 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2021-03-25 05:09:13,739 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:13,739 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 25 transitions, 147 flow [2021-03-25 05:09:13,739 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 25 transitions, 147 flow [2021-03-25 05:09:13,740 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 25 transitions, 147 flow [2021-03-25 05:09:13,746 INFO L129 PetriNetUnfolder]: 8/53 cut-off events. [2021-03-25 05:09:13,746 INFO L130 PetriNetUnfolder]: For 164/168 co-relation queries the response was YES. [2021-03-25 05:09:13,746 INFO L84 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 53 events. 8/53 cut-off events. For 164/168 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 189 event pairs, 1 based on Foata normal form. 1/53 useless extension candidates. Maximal degree in co-relation 161. Up to 20 conditions per place. [2021-03-25 05:09:13,747 INFO L142 LiptonReduction]: Number of co-enabled transitions 138 [2021-03-25 05:09:13,748 INFO L154 LiptonReduction]: Checked pairs total: 85 [2021-03-25 05:09:13,748 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:13,748 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 05:09:13,748 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 147 flow [2021-03-25 05:09:13,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states 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 05:09:13,748 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:13,748 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:13,748 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 05:09:13,749 INFO L428 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1710612747, now seen corresponding path program 1 times [2021-03-25 05:09:13,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:13,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153006282] [2021-03-25 05:09:13,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:13,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-03-25 05:09:13,811 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,811 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:13,818 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,820 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:09:13,827 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,828 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:13,833 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,834 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:13,835 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 05:09:13,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153006282] [2021-03-25 05:09:13,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:13,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:09:13,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906582031] [2021-03-25 05:09:13,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:09:13,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:13,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:09:13,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:09:13,836 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 140 [2021-03-25 05:09:13,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 25 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:09:13,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:13,837 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 140 [2021-03-25 05:09:13,837 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:13,891 INFO L129 PetriNetUnfolder]: 31/113 cut-off events. [2021-03-25 05:09:13,891 INFO L130 PetriNetUnfolder]: For 262/273 co-relation queries the response was YES. [2021-03-25 05:09:13,891 INFO L84 FinitePrefix]: Finished finitePrefix Result has 402 conditions, 113 events. 31/113 cut-off events. For 262/273 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 539 event pairs, 9 based on Foata normal form. 9/120 useless extension candidates. Maximal degree in co-relation 382. Up to 61 conditions per place. [2021-03-25 05:09:13,891 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 10 selfloop transitions, 7 changer transitions 4/32 dead transitions. [2021-03-25 05:09:13,892 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 228 flow [2021-03-25 05:09:13,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:09:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:09:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 540 transitions. [2021-03-25 05:09:13,895 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7714285714285715 [2021-03-25 05:09:13,895 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 540 transitions. [2021-03-25 05:09:13,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 540 transitions. [2021-03-25 05:09:13,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:13,895 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 540 transitions. [2021-03-25 05:09:13,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.0) internal successors, (540), 5 states have internal predecessors, (540), 0 states have call successors, (0), 0 states 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 05:09:13,897 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 05:09:13,897 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 05:09:13,898 INFO L185 Difference]: Start difference. First operand has 42 places, 25 transitions, 147 flow. Second operand 5 states and 540 transitions. [2021-03-25 05:09:13,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 228 flow [2021-03-25 05:09:13,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 32 transitions, 209 flow, removed 1 selfloop flow, removed 5 redundant places. [2021-03-25 05:09:13,899 INFO L241 Difference]: Finished difference. Result has 43 places, 28 transitions, 177 flow [2021-03-25 05:09:13,899 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=43, PETRI_TRANSITIONS=28} [2021-03-25 05:09:13,900 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2021-03-25 05:09:13,900 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:13,900 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 28 transitions, 177 flow [2021-03-25 05:09:13,900 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 28 transitions, 177 flow [2021-03-25 05:09:13,900 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 28 transitions, 177 flow [2021-03-25 05:09:13,907 INFO L129 PetriNetUnfolder]: 22/89 cut-off events. [2021-03-25 05:09:13,908 INFO L130 PetriNetUnfolder]: For 287/289 co-relation queries the response was YES. [2021-03-25 05:09:13,908 INFO L84 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 89 events. 22/89 cut-off events. For 287/289 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 384 event pairs, 1 based on Foata normal form. 2/87 useless extension candidates. Maximal degree in co-relation 308. Up to 36 conditions per place. [2021-03-25 05:09:13,908 INFO L142 LiptonReduction]: Number of co-enabled transitions 124 [2021-03-25 05:09:13,910 INFO L154 LiptonReduction]: Checked pairs total: 51 [2021-03-25 05:09:13,910 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:13,910 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 10 [2021-03-25 05:09:13,910 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 177 flow [2021-03-25 05:09:13,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:09:13,910 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:13,910 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:13,911 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 05:09:13,911 INFO L428 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:13,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:13,911 INFO L82 PathProgramCache]: Analyzing trace with hash 103833779, now seen corresponding path program 2 times [2021-03-25 05:09:13,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:13,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983100396] [2021-03-25 05:09:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:13,954 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,955 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:09:13,968 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,969 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-03-25 05:09:13,978 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:13,978 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 05:09:13,987 INFO L142 QuantifierPusher]: treesize reduction 10, result has 84.4 percent of original size [2021-03-25 05:09:13,989 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 54 [2021-03-25 05:09:14,008 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,009 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 05:09:14,017 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 05:09:14,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983100396] [2021-03-25 05:09:14,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:14,017 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 05:09:14,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364235920] [2021-03-25 05:09:14,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 05:09:14,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:14,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 05:09:14,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 05:09:14,018 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2021-03-25 05:09:14,019 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 177 flow. Second operand has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:09:14,019 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:14,019 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2021-03-25 05:09:14,019 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:14,089 INFO L129 PetriNetUnfolder]: 27/103 cut-off events. [2021-03-25 05:09:14,089 INFO L130 PetriNetUnfolder]: For 370/374 co-relation queries the response was YES. [2021-03-25 05:09:14,090 INFO L84 FinitePrefix]: Finished finitePrefix Result has 433 conditions, 103 events. 27/103 cut-off events. For 370/374 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 471 event pairs, 1 based on Foata normal form. 3/105 useless extension candidates. Maximal degree in co-relation 412. Up to 65 conditions per place. [2021-03-25 05:09:14,090 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 13 selfloop transitions, 2 changer transitions 5/31 dead transitions. [2021-03-25 05:09:14,090 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 31 transitions, 236 flow [2021-03-25 05:09:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:09:14,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:09:14,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2021-03-25 05:09:14,091 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7057142857142857 [2021-03-25 05:09:14,091 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 494 transitions. [2021-03-25 05:09:14,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 494 transitions. [2021-03-25 05:09:14,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:14,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 494 transitions. [2021-03-25 05:09:14,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states 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 05:09:14,094 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 05:09:14,094 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 05:09:14,094 INFO L185 Difference]: Start difference. First operand has 42 places, 28 transitions, 177 flow. Second operand 5 states and 494 transitions. [2021-03-25 05:09:14,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 31 transitions, 236 flow [2021-03-25 05:09:14,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 221 flow, removed 3 selfloop flow, removed 3 redundant places. [2021-03-25 05:09:14,097 INFO L241 Difference]: Finished difference. Result has 44 places, 25 transitions, 151 flow [2021-03-25 05:09:14,098 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=5, PETRI_FLOW=151, PETRI_PLACES=44, PETRI_TRANSITIONS=25} [2021-03-25 05:09:14,098 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 7 predicate places. [2021-03-25 05:09:14,098 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:14,098 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 44 places, 25 transitions, 151 flow [2021-03-25 05:09:14,098 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 44 places, 25 transitions, 151 flow [2021-03-25 05:09:14,099 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 25 transitions, 151 flow [2021-03-25 05:09:14,107 INFO L129 PetriNetUnfolder]: 20/80 cut-off events. [2021-03-25 05:09:14,107 INFO L130 PetriNetUnfolder]: For 278/281 co-relation queries the response was YES. [2021-03-25 05:09:14,107 INFO L84 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 80 events. 20/80 cut-off events. For 278/281 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 332 event pairs, 5 based on Foata normal form. 2/77 useless extension candidates. Maximal degree in co-relation 269. Up to 35 conditions per place. [2021-03-25 05:09:14,108 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-25 05:09:14,111 INFO L154 LiptonReduction]: Checked pairs total: 58 [2021-03-25 05:09:14,111 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:14,111 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 13 [2021-03-25 05:09:14,111 INFO L480 AbstractCegarLoop]: Abstraction has has 40 places, 25 transitions, 151 flow [2021-03-25 05:09:14,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 05:09:14,112 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:14,112 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:14,112 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 05:09:14,112 INFO L428 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:14,112 INFO L82 PathProgramCache]: Analyzing trace with hash 605043701, now seen corresponding path program 3 times [2021-03-25 05:09:14,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:14,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642763032] [2021-03-25 05:09:14,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:14,157 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,158 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 05:09:14,162 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,163 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 05:09:14,165 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 25 [2021-03-25 05:09:14,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 29 [2021-03-25 05:09:14,206 INFO L142 QuantifierPusher]: treesize reduction 28, result has 66.7 percent of original size [2021-03-25 05:09:14,207 INFO L147 QuantifierPusher]: treesize reduction 9, result has 83.9 percent of original size 47 [2021-03-25 05:09:14,232 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 05:09:14,232 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642763032] [2021-03-25 05:09:14,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:14,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:09:14,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693496064] [2021-03-25 05:09:14,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 05:09:14,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:14,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 05:09:14,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-03-25 05:09:14,233 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2021-03-25 05:09:14,234 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 25 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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 05:09:14,234 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:14,234 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2021-03-25 05:09:14,234 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:14,283 INFO L129 PetriNetUnfolder]: 22/96 cut-off events. [2021-03-25 05:09:14,283 INFO L130 PetriNetUnfolder]: For 300/301 co-relation queries the response was YES. [2021-03-25 05:09:14,283 INFO L84 FinitePrefix]: Finished finitePrefix Result has 359 conditions, 96 events. 22/96 cut-off events. For 300/301 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 450 event pairs, 1 based on Foata normal form. 3/98 useless extension candidates. Maximal degree in co-relation 338. Up to 36 conditions per place. [2021-03-25 05:09:14,283 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 9 selfloop transitions, 7 changer transitions 0/27 dead transitions. [2021-03-25 05:09:14,283 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 27 transitions, 191 flow [2021-03-25 05:09:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:09:14,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:09:14,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2021-03-25 05:09:14,285 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7028571428571428 [2021-03-25 05:09:14,285 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2021-03-25 05:09:14,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2021-03-25 05:09:14,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:14,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2021-03-25 05:09:14,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states 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 05:09:14,287 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 05:09:14,287 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 05:09:14,288 INFO L185 Difference]: Start difference. First operand has 40 places, 25 transitions, 151 flow. Second operand 5 states and 492 transitions. [2021-03-25 05:09:14,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 27 transitions, 191 flow [2021-03-25 05:09:14,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 27 transitions, 171 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-03-25 05:09:14,290 INFO L241 Difference]: Finished difference. Result has 38 places, 25 transitions, 152 flow [2021-03-25 05:09:14,290 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=38, PETRI_TRANSITIONS=25} [2021-03-25 05:09:14,290 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2021-03-25 05:09:14,290 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:14,290 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 38 places, 25 transitions, 152 flow [2021-03-25 05:09:14,290 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 38 places, 25 transitions, 152 flow [2021-03-25 05:09:14,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 38 places, 25 transitions, 152 flow [2021-03-25 05:09:14,297 INFO L129 PetriNetUnfolder]: 17/80 cut-off events. [2021-03-25 05:09:14,297 INFO L130 PetriNetUnfolder]: For 217/221 co-relation queries the response was YES. [2021-03-25 05:09:14,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 80 events. 17/80 cut-off events. For 217/221 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 361 event pairs, 6 based on Foata normal form. 2/78 useless extension candidates. Maximal degree in co-relation 254. Up to 32 conditions per place. [2021-03-25 05:09:14,298 INFO L142 LiptonReduction]: Number of co-enabled transitions 114 [2021-03-25 05:09:14,299 INFO L154 LiptonReduction]: Checked pairs total: 54 [2021-03-25 05:09:14,299 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 05:09:14,299 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 9 [2021-03-25 05:09:14,300 INFO L480 AbstractCegarLoop]: Abstraction has has 38 places, 25 transitions, 152 flow [2021-03-25 05:09:14,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 97.0) internal successors, (582), 6 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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 05:09:14,300 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:14,300 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:14,300 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 05:09:14,300 INFO L428 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash 604338327, now seen corresponding path program 1 times [2021-03-25 05:09:14,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:14,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615321118] [2021-03-25 05:09:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:14,334 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,334 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:09:14,337 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:09:14,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:09:14,342 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,342 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:09:14,342 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 05:09:14,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615321118] [2021-03-25 05:09:14,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:14,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 05:09:14,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731284368] [2021-03-25 05:09:14,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 05:09:14,342 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:14,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 05:09:14,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 05:09:14,344 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140 [2021-03-25 05:09:14,344 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 25 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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 05:09:14,344 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:14,344 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140 [2021-03-25 05:09:14,344 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:14,373 INFO L129 PetriNetUnfolder]: 49/157 cut-off events. [2021-03-25 05:09:14,373 INFO L130 PetriNetUnfolder]: For 224/263 co-relation queries the response was YES. [2021-03-25 05:09:14,374 INFO L84 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 157 events. 49/157 cut-off events. For 224/263 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 845 event pairs, 10 based on Foata normal form. 44/171 useless extension candidates. Maximal degree in co-relation 411. Up to 100 conditions per place. [2021-03-25 05:09:14,374 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 6 selfloop transitions, 5 changer transitions 7/32 dead transitions. [2021-03-25 05:09:14,374 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 32 transitions, 188 flow [2021-03-25 05:09:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 05:09:14,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 05:09:14,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 576 transitions. [2021-03-25 05:09:14,376 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8228571428571428 [2021-03-25 05:09:14,376 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 576 transitions. [2021-03-25 05:09:14,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 576 transitions. [2021-03-25 05:09:14,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:14,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 576 transitions. [2021-03-25 05:09:14,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states 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 05:09:14,378 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 05:09:14,378 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 05:09:14,378 INFO L185 Difference]: Start difference. First operand has 38 places, 25 transitions, 152 flow. Second operand 5 states and 576 transitions. [2021-03-25 05:09:14,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 32 transitions, 188 flow [2021-03-25 05:09:14,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 177 flow, removed 1 selfloop flow, removed 3 redundant places. [2021-03-25 05:09:14,379 INFO L241 Difference]: Finished difference. Result has 42 places, 24 transitions, 148 flow [2021-03-25 05:09:14,379 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2021-03-25 05:09:14,379 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2021-03-25 05:09:14,379 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:14,379 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 24 transitions, 148 flow [2021-03-25 05:09:14,380 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 24 transitions, 148 flow [2021-03-25 05:09:14,380 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 24 transitions, 148 flow [2021-03-25 05:09:14,385 INFO L129 PetriNetUnfolder]: 8/59 cut-off events. [2021-03-25 05:09:14,385 INFO L130 PetriNetUnfolder]: For 159/169 co-relation queries the response was YES. [2021-03-25 05:09:14,385 INFO L84 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 59 events. 8/59 cut-off events. For 159/169 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 228 event pairs, 5 based on Foata normal form. 4/60 useless extension candidates. Maximal degree in co-relation 199. Up to 22 conditions per place. [2021-03-25 05:09:14,385 INFO L142 LiptonReduction]: Number of co-enabled transitions 92 [2021-03-25 05:09:14,613 WARN L205 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2021-03-25 05:09:14,847 WARN L205 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 82 [2021-03-25 05:09:14,893 INFO L154 LiptonReduction]: Checked pairs total: 12 [2021-03-25 05:09:14,894 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 05:09:14,894 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 515 [2021-03-25 05:09:14,894 INFO L480 AbstractCegarLoop]: Abstraction has has 41 places, 23 transitions, 154 flow [2021-03-25 05:09:14,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states 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 05:09:14,894 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:14,894 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:14,894 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 05:09:14,895 INFO L428 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:14,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:14,895 INFO L82 PathProgramCache]: Analyzing trace with hash 673634135, now seen corresponding path program 1 times [2021-03-25 05:09:14,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:14,895 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804530579] [2021-03-25 05:09:14,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:14,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 05:09:14,915 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,915 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:09:14,917 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,917 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 05:09:14,922 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 05:09:14,923 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 05:09:14,929 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 05:09:14,930 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 05:09:14,930 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 05:09:14,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804530579] [2021-03-25 05:09:14,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 05:09:14,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 05:09:14,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541054566] [2021-03-25 05:09:14,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 05:09:14,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 05:09:14,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 05:09:14,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 05:09:14,932 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 143 [2021-03-25 05:09:14,932 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 23 transitions, 154 flow. Second operand has 5 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 05:09:14,932 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 05:09:14,932 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 143 [2021-03-25 05:09:14,932 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 05:09:14,970 INFO L129 PetriNetUnfolder]: 14/61 cut-off events. [2021-03-25 05:09:14,970 INFO L130 PetriNetUnfolder]: For 122/196 co-relation queries the response was YES. [2021-03-25 05:09:14,970 INFO L84 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 61 events. 14/61 cut-off events. For 122/196 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 213 event pairs, 0 based on Foata normal form. 33/86 useless extension candidates. Maximal degree in co-relation 209. Up to 27 conditions per place. [2021-03-25 05:09:14,971 INFO L132 encePairwiseOnDemand]: 138/143 looper letters, 4 selfloop transitions, 8 changer transitions 6/28 dead transitions. [2021-03-25 05:09:14,971 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 28 transitions, 202 flow [2021-03-25 05:09:14,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 05:09:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 05:09:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2021-03-25 05:09:14,972 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8211788211788211 [2021-03-25 05:09:14,972 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2021-03-25 05:09:14,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2021-03-25 05:09:14,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 05:09:14,973 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2021-03-25 05:09:14,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states 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 05:09:14,975 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states 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 05:09:14,975 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 143.0) internal successors, (1144), 8 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states 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 05:09:14,975 INFO L185 Difference]: Start difference. First operand has 41 places, 23 transitions, 154 flow. Second operand 7 states and 822 transitions. [2021-03-25 05:09:14,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 28 transitions, 202 flow [2021-03-25 05:09:14,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 28 transitions, 162 flow, removed 7 selfloop flow, removed 7 redundant places. [2021-03-25 05:09:14,976 INFO L241 Difference]: Finished difference. Result has 43 places, 21 transitions, 133 flow [2021-03-25 05:09:14,977 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=21} [2021-03-25 05:09:14,977 INFO L343 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2021-03-25 05:09:14,977 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 05:09:14,977 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 43 places, 21 transitions, 133 flow [2021-03-25 05:09:14,977 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 43 places, 21 transitions, 133 flow [2021-03-25 05:09:14,977 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 41 places, 21 transitions, 133 flow [2021-03-25 05:09:14,980 INFO L129 PetriNetUnfolder]: 2/25 cut-off events. [2021-03-25 05:09:14,980 INFO L130 PetriNetUnfolder]: For 52/54 co-relation queries the response was YES. [2021-03-25 05:09:14,980 INFO L84 FinitePrefix]: Finished finitePrefix Result has 98 conditions, 25 events. 2/25 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 46 event pairs, 0 based on Foata normal form. 2/27 useless extension candidates. Maximal degree in co-relation 80. Up to 10 conditions per place. [2021-03-25 05:09:14,980 INFO L142 LiptonReduction]: Number of co-enabled transitions 42 [2021-03-25 05:09:15,525 WARN L205 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 231 DAG size of output: 178 [2021-03-25 05:09:15,728 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification that was a NOOP. DAG size: 162 [2021-03-25 05:09:17,527 WARN L205 SmtUtils]: Spent 1.80 s on a formula simplification. DAG size of input: 332 DAG size of output: 260 [2021-03-25 05:09:18,015 WARN L205 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2021-03-25 05:09:18,194 WARN L205 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 66 [2021-03-25 05:09:18,560 WARN L205 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 92 [2021-03-25 05:09:18,686 WARN L205 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2021-03-25 05:09:18,912 WARN L205 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 05:09:19,139 WARN L205 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2021-03-25 05:09:19,651 WARN L205 SmtUtils]: Spent 510.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-25 05:09:20,149 WARN L205 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 251 [2021-03-25 05:09:20,152 INFO L154 LiptonReduction]: Checked pairs total: 9 [2021-03-25 05:09:20,152 INFO L156 LiptonReduction]: Total number of compositions: 5 [2021-03-25 05:09:20,152 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5175 [2021-03-25 05:09:20,152 INFO L480 AbstractCegarLoop]: Abstraction has has 39 places, 17 transitions, 118 flow [2021-03-25 05:09:20,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 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 05:09:20,152 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 05:09:20,153 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 05:09:20,153 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 05:09:20,153 INFO L428 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 05:09:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 05:09:20,153 INFO L82 PathProgramCache]: Analyzing trace with hash -2026832090, now seen corresponding path program 1 times [2021-03-25 05:09:20,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 05:09:20,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932564950] [2021-03-25 05:09:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 05:09:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:09:20,170 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:09:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 05:09:20,188 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 05:09:20,212 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 05:09:20,213 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 05:09:20,213 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 05:09:20,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 05:09:20 BasicIcfg [2021-03-25 05:09:20,269 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 05:09:20,270 INFO L168 Benchmark]: Toolchain (without parser) took 18685.55 ms. Allocated memory was 255.9 MB in the beginning and 612.4 MB in the end (delta: 356.5 MB). Free memory was 236.8 MB in the beginning and 364.2 MB in the end (delta: -127.4 MB). Peak memory consumption was 228.3 MB. Max. memory is 16.0 GB. [2021-03-25 05:09:20,270 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 05:09:20,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 394.96 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 236.8 MB in the beginning and 314.1 MB in the end (delta: -77.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-03-25 05:09:20,270 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.89 ms. Allocated memory is still 352.3 MB. Free memory was 314.1 MB in the beginning and 311.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2021-03-25 05:09:20,270 INFO L168 Benchmark]: Boogie Preprocessor took 17.60 ms. Allocated memory is still 352.3 MB. Free memory was 311.0 MB in the beginning and 308.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 05:09:20,271 INFO L168 Benchmark]: RCFGBuilder took 1247.23 ms. Allocated memory is still 352.3 MB. Free memory was 308.9 MB in the beginning and 267.8 MB in the end (delta: 41.1 MB). Peak memory consumption was 48.3 MB. Max. memory is 16.0 GB. [2021-03-25 05:09:20,271 INFO L168 Benchmark]: TraceAbstraction took 16989.58 ms. Allocated memory was 352.3 MB in the beginning and 612.4 MB in the end (delta: 260.0 MB). Free memory was 267.8 MB in the beginning and 364.2 MB in the end (delta: -96.4 MB). Peak memory consumption was 162.6 MB. Max. memory is 16.0 GB. [2021-03-25 05:09:20,272 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.10 ms. Allocated memory is still 255.9 MB. Free memory is still 237.8 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 394.96 ms. Allocated memory was 255.9 MB in the beginning and 352.3 MB in the end (delta: 96.5 MB). Free memory was 236.8 MB in the beginning and 314.1 MB in the end (delta: -77.3 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 32.89 ms. Allocated memory is still 352.3 MB. Free memory was 314.1 MB in the beginning and 311.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 17.60 ms. Allocated memory is still 352.3 MB. Free memory was 311.0 MB in the beginning and 308.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1247.23 ms. Allocated memory is still 352.3 MB. Free memory was 308.9 MB in the beginning and 267.8 MB in the end (delta: 41.1 MB). Peak memory consumption was 48.3 MB. Max. memory is 16.0 GB. * TraceAbstraction took 16989.58 ms. Allocated memory was 352.3 MB in the beginning and 612.4 MB in the end (delta: 260.0 MB). Free memory was 267.8 MB in the beginning and 364.2 MB in the end (delta: -96.4 MB). Peak memory consumption was 162.6 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5992.5ms, 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: 799, positive: 733, positive conditional: 0, positive unconditional: 733, 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: 449, positive: 428, positive conditional: 0, positive unconditional: 428, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 449, positive: 428, positive conditional: 0, positive unconditional: 428, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 799, positive: 305, positive conditional: 0, positive unconditional: 305, negative: 45, negative conditional: 0, negative unconditional: 45, unknown: 449, unknown conditional: 0, unknown unconditional: 449] , Statistics on independence cache: Total cache size (in pairs): 52, Positive cache size: 40, Positive conditional cache size: 0, Positive unconditional cache size: 40, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2022.5ms, 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: 170, positive: 121, positive conditional: 0, positive unconditional: 121, 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: 22, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 22, positive: 16, positive conditional: 0, positive unconditional: 16, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 170, positive: 105, positive conditional: 0, positive unconditional: 105, negative: 43, negative conditional: 0, negative unconditional: 43, unknown: 22, unknown conditional: 0, unknown unconditional: 22] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 908.1ms, 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: 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] , 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): 62, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8ms, 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: 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: 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] , Cache 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] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.3ms, 31 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 24 TransitionsAfterwards, 146 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 70 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 25, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 48, Positive conditional cache size: 0, Positive unconditional cache size: 48, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.5ms, 35 PlacesBefore, 35 PlacesAfterwards, 26 TransitionsBefore, 26 TransitionsAfterwards, 156 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 90 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 32, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 32, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 8, negative conditional: 0, negative unconditional: 8, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8ms, 39 PlacesBefore, 39 PlacesAfterwards, 27 TransitionsBefore, 27 TransitionsAfterwards, 164 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 105 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 42, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 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] , Cache Queries: [ total: 42, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.2ms, 41 PlacesBefore, 41 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 174 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 119 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 11, negative conditional: 0, negative unconditional: 11, 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: 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] , Cache Queries: [ total: 37, positive: 26, positive conditional: 0, positive unconditional: 26, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.3ms, 42 PlacesBefore, 42 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 138 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 85 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 16, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: 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] , Cache Queries: [ total: 16, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 7, negative conditional: 0, negative unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.9ms, 43 PlacesBefore, 42 PlacesAfterwards, 28 TransitionsBefore, 28 TransitionsAfterwards, 124 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 51 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8, positive: 3, positive conditional: 0, positive unconditional: 3, 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: 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] , Cache Queries: [ total: 8, positive: 3, positive conditional: 0, positive unconditional: 3, 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): 66, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.5ms, 44 PlacesBefore, 40 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 58 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, 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: 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] , Cache Queries: [ total: 18, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.7ms, 38 PlacesBefore, 38 PlacesAfterwards, 25 TransitionsBefore, 25 TransitionsAfterwards, 114 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 54 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 20, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 6, negative conditional: 0, negative unconditional: 6, 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: 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] , Cache Queries: [ total: 20, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 6, negative conditional: 0, negative unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 66, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 514.0ms, 42 PlacesBefore, 41 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 92 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 3 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 12 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , 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: 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] , Cache Queries: [ total: 12, positive: 10, positive conditional: 0, positive unconditional: 10, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 44, Positive cache size: 39, Positive conditional cache size: 0, Positive unconditional cache size: 39, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5174.8ms, 43 PlacesBefore, 39 PlacesAfterwards, 21 TransitionsBefore, 17 TransitionsAfterwards, 42 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 5 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: 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: 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] , Cache Queries: [ total: 9, positive: 6, positive conditional: 0, positive unconditional: 6, 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): 27, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, 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 t2483; [L791] FCALL, FORK 0 pthread_create(&t2483, ((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 t2484; [L793] FCALL, FORK 0 pthread_create(&t2484, ((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] 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] 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] 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] 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] 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] 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=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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: 2.6ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 16860.4ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 728.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6052.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 50 SDtfs, 18 SDslu, 15 SDs, 0 SdLazy, 304 SolverSat, 66 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 296.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 319.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=177occurred in iteration=9, InterpolantAutomatonStates: 58, 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: 30.1ms SsaConstructionTime, 349.6ms SatisfiabilityAnalysisTime, 769.5ms InterpolantComputationTime, 154 NumberOfCodeBlocks, 154 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 1053 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...