/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/mix056_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-d5b4239aa45c8d22a30959944f2ef622f7386a6d-d5b4239 [2021-03-25 04:50:29,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-03-25 04:50:29,410 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-03-25 04:50:29,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-03-25 04:50:29,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-03-25 04:50:29,447 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-03-25 04:50:29,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-03-25 04:50:29,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-03-25 04:50:29,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-03-25 04:50:29,461 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-03-25 04:50:29,462 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-03-25 04:50:29,463 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-03-25 04:50:29,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-03-25 04:50:29,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-03-25 04:50:29,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-03-25 04:50:29,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-03-25 04:50:29,470 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-03-25 04:50:29,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-03-25 04:50:29,473 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-03-25 04:50:29,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-03-25 04:50:29,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-03-25 04:50:29,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-03-25 04:50:29,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-03-25 04:50:29,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-03-25 04:50:29,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-03-25 04:50:29,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-03-25 04:50:29,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-03-25 04:50:29,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-03-25 04:50:29,495 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-03-25 04:50:29,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-03-25 04:50:29,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-03-25 04:50:29,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-03-25 04:50:29,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-03-25 04:50:29,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-03-25 04:50:29,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-03-25 04:50:29,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-03-25 04:50:29,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-03-25 04:50:29,501 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-03-25 04:50:29,501 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-03-25 04:50:29,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-03-25 04:50:29,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-03-25 04:50:29,503 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 04:50:29,543 INFO L113 SettingsManager]: Loading preferences was successful [2021-03-25 04:50:29,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-03-25 04:50:29,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-03-25 04:50:29,547 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-03-25 04:50:29,547 INFO L138 SettingsManager]: * Use SBE=true [2021-03-25 04:50:29,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-03-25 04:50:29,547 INFO L138 SettingsManager]: * sizeof long=4 [2021-03-25 04:50:29,548 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-03-25 04:50:29,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-03-25 04:50:29,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-03-25 04:50:29,549 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-03-25 04:50:29,549 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-03-25 04:50:29,549 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-03-25 04:50:29,549 INFO L138 SettingsManager]: * sizeof long double=12 [2021-03-25 04:50:29,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-03-25 04:50:29,550 INFO L138 SettingsManager]: * Use constant arrays=true [2021-03-25 04:50:29,550 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-03-25 04:50:29,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-03-25 04:50:29,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-03-25 04:50:29,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-03-25 04:50:29,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-03-25 04:50:29,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-03-25 04:50:29,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-03-25 04:50:29,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-03-25 04:50:29,551 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-03-25 04:50:29,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-03-25 04:50:29,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-03-25 04:50:29,552 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2021-03-25 04:50:29,552 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-03-25 04:50:29,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-03-25 04:50:29,552 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 04:50:29,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-03-25 04:50:29,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-03-25 04:50:29,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-03-25 04:50:29,894 INFO L271 PluginConnector]: Initializing CDTParser... [2021-03-25 04:50:29,894 INFO L275 PluginConnector]: CDTParser initialized [2021-03-25 04:50:29,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2021-03-25 04:50:29,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07f705d6/8fd6bf86044e4429a2baeb85fa06eba5/FLAG5fc95134f [2021-03-25 04:50:30,474 INFO L306 CDTParser]: Found 1 translation units. [2021-03-25 04:50:30,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_rmo.opt.i [2021-03-25 04:50:30,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07f705d6/8fd6bf86044e4429a2baeb85fa06eba5/FLAG5fc95134f [2021-03-25 04:50:30,936 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e07f705d6/8fd6bf86044e4429a2baeb85fa06eba5 [2021-03-25 04:50:30,938 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-03-25 04:50:30,939 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-03-25 04:50:30,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-03-25 04:50:30,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-03-25 04:50:30,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-03-25 04:50:30,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:50:30" (1/1) ... [2021-03-25 04:50:30,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cb01432 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:30, skipping insertion in model container [2021-03-25 04:50:30,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.03 04:50:30" (1/1) ... [2021-03-25 04:50:30,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-03-25 04:50:31,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-03-25 04:50:31,173 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/mix056_rmo.opt.i[948,961] [2021-03-25 04:50:31,394 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:50:31,404 INFO L203 MainTranslator]: Completed pre-run [2021-03-25 04:50:31,415 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/mix056_rmo.opt.i[948,961] [2021-03-25 04:50:31,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-03-25 04:50:31,535 INFO L208 MainTranslator]: Completed translation [2021-03-25 04:50:31,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31 WrapperNode [2021-03-25 04:50:31,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-03-25 04:50:31,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-03-25 04:50:31,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-03-25 04:50:31,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-03-25 04:50:31,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,557 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-03-25 04:50:31,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-03-25 04:50:31,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-03-25 04:50:31,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-03-25 04:50:31,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,605 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,628 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (1/1) ... [2021-03-25 04:50:31,636 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-03-25 04:50:31,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-03-25 04:50:31,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-03-25 04:50:31,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-03-25 04:50:31,638 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (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 04:50:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-03-25 04:50:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-03-25 04:50:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-03-25 04:50:31,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-03-25 04:50:31,724 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-03-25 04:50:31,724 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-03-25 04:50:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-03-25 04:50:31,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-03-25 04:50:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-03-25 04:50:31,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-03-25 04:50:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-03-25 04:50:31,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-03-25 04:50:31,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-03-25 04:50:31,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-03-25 04:50:31,727 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 04:50:33,413 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-03-25 04:50:33,414 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-03-25 04:50:33,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:50:33 BoogieIcfgContainer [2021-03-25 04:50:33,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-03-25 04:50:33,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-03-25 04:50:33,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-03-25 04:50:33,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-03-25 04:50:33,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.03 04:50:30" (1/3) ... [2021-03-25 04:50:33,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7132f523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:50:33, skipping insertion in model container [2021-03-25 04:50:33,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.03 04:50:31" (2/3) ... [2021-03-25 04:50:33,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7132f523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.03 04:50:33, skipping insertion in model container [2021-03-25 04:50:33,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.03 04:50:33" (3/3) ... [2021-03-25 04:50:33,422 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt.i [2021-03-25 04:50:33,427 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-03-25 04:50:33,431 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-03-25 04:50:33,432 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-03-25 04:50:33,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,463 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,467 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,467 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,468 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,469 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,474 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,475 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,476 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,477 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,479 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,480 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,480 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-03-25 04:50:33,482 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-03-25 04:50:33,498 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-03-25 04:50:33,516 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-03-25 04:50:33,516 INFO L377 AbstractCegarLoop]: Hoare is false [2021-03-25 04:50:33,516 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-03-25 04:50:33,516 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-03-25 04:50:33,517 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-03-25 04:50:33,517 INFO L381 AbstractCegarLoop]: Difference is false [2021-03-25 04:50:33,517 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-03-25 04:50:33,517 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-03-25 04:50:33,527 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 104 places, 96 transitions, 207 flow [2021-03-25 04:50:33,590 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 04:50:33,590 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:33,593 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 04:50:33,593 INFO L82 GeneralOperation]: Start removeDead. Operand has 104 places, 96 transitions, 207 flow [2021-03-25 04:50:33,597 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 93 transitions, 195 flow [2021-03-25 04:50:33,598 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:33,605 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-25 04:50:33,607 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 195 flow [2021-03-25 04:50:33,609 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 195 flow [2021-03-25 04:50:33,624 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2021-03-25 04:50:33,625 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:33,625 INFO L84 FinitePrefix]: Finished finitePrefix Result has 103 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/89 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2021-03-25 04:50:33,627 INFO L142 LiptonReduction]: Number of co-enabled transitions 1578 [2021-03-25 04:50:34,898 WARN L205 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2021-03-25 04:50:35,219 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2021-03-25 04:50:36,685 WARN L205 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-03-25 04:50:37,343 WARN L205 SmtUtils]: Spent 654.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-03-25 04:50:37,787 WARN L205 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:50:38,194 WARN L205 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2021-03-25 04:50:38,317 WARN L205 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2021-03-25 04:50:39,117 WARN L205 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:50:39,460 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2021-03-25 04:50:40,054 WARN L205 SmtUtils]: Spent 589.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:50:40,701 WARN L205 SmtUtils]: Spent 645.00 ms on a formula simplification that was a NOOP. DAG size: 265 [2021-03-25 04:50:40,947 INFO L154 LiptonReduction]: Checked pairs total: 2725 [2021-03-25 04:50:40,948 INFO L156 LiptonReduction]: Total number of compositions: 68 [2021-03-25 04:50:40,950 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 7352 [2021-03-25 04:50:40,958 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2021-03-25 04:50:40,958 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:40,959 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:40,959 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:40,959 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:40,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:40,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1719955494, now seen corresponding path program 1 times [2021-03-25 04:50:40,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:40,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49384945] [2021-03-25 04:50:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:41,206 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:41,207 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:41,208 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:41,208 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:41,214 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 04:50:41,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49384945] [2021-03-25 04:50:41,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:41,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:50:41,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517139902] [2021-03-25 04:50:41,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:50:41,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:50:41,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:50:41,235 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 164 [2021-03-25 04:50:41,237 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,237 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:41,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 164 [2021-03-25 04:50:41,239 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:41,299 INFO L129 PetriNetUnfolder]: 23/90 cut-off events. [2021-03-25 04:50:41,299 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:41,300 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 90 events. 23/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 305 event pairs, 3 based on Foata normal form. 5/87 useless extension candidates. Maximal degree in co-relation 129. Up to 37 conditions per place. [2021-03-25 04:50:41,301 INFO L132 encePairwiseOnDemand]: 160/164 looper letters, 7 selfloop transitions, 2 changer transitions 3/37 dead transitions. [2021-03-25 04:50:41,301 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 105 flow [2021-03-25 04:50:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2021-03-25 04:50:41,313 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8882113821138211 [2021-03-25 04:50:41,314 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2021-03-25 04:50:41,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2021-03-25 04:50:41,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:41,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2021-03-25 04:50:41,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,327 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:41,329 INFO L185 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 3 states and 437 transitions. [2021-03-25 04:50:41,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 105 flow [2021-03-25 04:50:41,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-03-25 04:50:41,333 INFO L241 Difference]: Finished difference. Result has 42 places, 31 transitions, 72 flow [2021-03-25 04:50:41,335 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2021-03-25 04:50:41,336 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2021-03-25 04:50:41,336 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:41,336 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 31 transitions, 72 flow [2021-03-25 04:50:41,336 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 31 transitions, 72 flow [2021-03-25 04:50:41,337 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 40 places, 31 transitions, 72 flow [2021-03-25 04:50:41,341 INFO L129 PetriNetUnfolder]: 0/31 cut-off events. [2021-03-25 04:50:41,341 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:41,341 INFO L84 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 31 events. 0/31 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 30 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2021-03-25 04:50:41,342 INFO L142 LiptonReduction]: Number of co-enabled transitions 230 [2021-03-25 04:50:41,805 WARN L205 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:50:42,135 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 187 [2021-03-25 04:50:42,797 WARN L205 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:50:43,401 WARN L205 SmtUtils]: Spent 603.00 ms on a formula simplification that was a NOOP. DAG size: 266 [2021-03-25 04:50:44,019 WARN L205 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-25 04:50:44,181 WARN L205 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2021-03-25 04:50:44,237 INFO L154 LiptonReduction]: Checked pairs total: 1024 [2021-03-25 04:50:44,238 INFO L156 LiptonReduction]: Total number of compositions: 9 [2021-03-25 04:50:44,238 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 2902 [2021-03-25 04:50:44,239 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 54 flow [2021-03-25 04:50:44,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,239 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:44,239 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:44,240 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-03-25 04:50:44,240 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:44,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:44,240 INFO L82 PathProgramCache]: Analyzing trace with hash 236066665, now seen corresponding path program 1 times [2021-03-25 04:50:44,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:44,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240561762] [2021-03-25 04:50:44,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:44,369 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:44,370 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:44,370 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:44,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:44,382 INFO L142 QuantifierPusher]: treesize reduction 9, result has 30.8 percent of original size [2021-03-25 04:50:44,382 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 4 [2021-03-25 04:50:44,386 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 04:50:44,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240561762] [2021-03-25 04:50:44,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:44,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:44,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226590167] [2021-03-25 04:50:44,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:44,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:44,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:44,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:44,397 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 173 [2021-03-25 04:50:44,398 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,398 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:44,398 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 173 [2021-03-25 04:50:44,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:44,425 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-25 04:50:44,425 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:44,426 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 45. Up to 10 conditions per place. [2021-03-25 04:50:44,426 INFO L132 encePairwiseOnDemand]: 169/173 looper letters, 3 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2021-03-25 04:50:44,426 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 24 transitions, 70 flow [2021-03-25 04:50:44,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2021-03-25 04:50:44,429 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8631984585741811 [2021-03-25 04:50:44,429 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2021-03-25 04:50:44,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2021-03-25 04:50:44,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:44,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2021-03-25 04:50:44,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,433 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:44,433 INFO L185 Difference]: Start difference. First operand has 31 places, 22 transitions, 54 flow. Second operand 3 states and 448 transitions. [2021-03-25 04:50:44,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 24 transitions, 70 flow [2021-03-25 04:50:44,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 24 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:44,434 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 69 flow [2021-03-25 04:50:44,434 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2021-03-25 04:50:44,435 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -13 predicate places. [2021-03-25 04:50:44,435 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:44,435 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 32 places, 24 transitions, 69 flow [2021-03-25 04:50:44,435 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 32 places, 24 transitions, 69 flow [2021-03-25 04:50:44,436 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 32 places, 24 transitions, 69 flow [2021-03-25 04:50:44,440 INFO L129 PetriNetUnfolder]: 3/34 cut-off events. [2021-03-25 04:50:44,441 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-03-25 04:50:44,441 INFO L84 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 34 events. 3/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 1 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 46. Up to 10 conditions per place. [2021-03-25 04:50:44,441 INFO L142 LiptonReduction]: Number of co-enabled transitions 238 [2021-03-25 04:50:44,760 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 04:50:44,894 WARN L205 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 04:50:45,171 WARN L205 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-03-25 04:50:45,298 WARN L205 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-03-25 04:50:45,301 INFO L154 LiptonReduction]: Checked pairs total: 440 [2021-03-25 04:50:45,301 INFO L156 LiptonReduction]: Total number of compositions: 1 [2021-03-25 04:50:45,301 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 866 [2021-03-25 04:50:45,302 INFO L480 AbstractCegarLoop]: Abstraction has has 31 places, 23 transitions, 67 flow [2021-03-25 04:50:45,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,303 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:45,303 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:45,303 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-03-25 04:50:45,303 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:45,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:45,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2078982232, now seen corresponding path program 1 times [2021-03-25 04:50:45,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:45,304 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737457193] [2021-03-25 04:50:45,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:45,424 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.1 percent of original size [2021-03-25 04:50:45,425 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 33 [2021-03-25 04:50:45,452 INFO L142 QuantifierPusher]: treesize reduction 1, result has 97.5 percent of original size [2021-03-25 04:50:45,454 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 39 [2021-03-25 04:50:45,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:45,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:45,487 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 04:50:45,488 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737457193] [2021-03-25 04:50:45,488 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:45,488 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:45,488 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420021755] [2021-03-25 04:50:45,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:45,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:45,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:45,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:45,492 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 174 [2021-03-25 04:50:45,493 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 23 transitions, 67 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,493 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:45,493 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 174 [2021-03-25 04:50:45,493 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:45,557 INFO L129 PetriNetUnfolder]: 66/150 cut-off events. [2021-03-25 04:50:45,557 INFO L130 PetriNetUnfolder]: For 13/13 co-relation queries the response was YES. [2021-03-25 04:50:45,558 INFO L84 FinitePrefix]: Finished finitePrefix Result has 302 conditions, 150 events. 66/150 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 615 event pairs, 34 based on Foata normal form. 1/137 useless extension candidates. Maximal degree in co-relation 292. Up to 101 conditions per place. [2021-03-25 04:50:45,559 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 7 selfloop transitions, 7 changer transitions 0/30 dead transitions. [2021-03-25 04:50:45,559 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 111 flow [2021-03-25 04:50:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 539 transitions. [2021-03-25 04:50:45,561 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7744252873563219 [2021-03-25 04:50:45,562 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 539 transitions. [2021-03-25 04:50:45,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 539 transitions. [2021-03-25 04:50:45,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:45,562 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 539 transitions. [2021-03-25 04:50:45,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.75) internal successors, (539), 4 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,565 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,565 INFO L185 Difference]: Start difference. First operand has 31 places, 23 transitions, 67 flow. Second operand 4 states and 539 transitions. [2021-03-25 04:50:45,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 111 flow [2021-03-25 04:50:45,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 30 transitions, 108 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:45,567 INFO L241 Difference]: Finished difference. Result has 35 places, 29 transitions, 112 flow [2021-03-25 04:50:45,567 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2021-03-25 04:50:45,567 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -10 predicate places. [2021-03-25 04:50:45,568 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:45,568 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 35 places, 29 transitions, 112 flow [2021-03-25 04:50:45,568 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 35 places, 29 transitions, 112 flow [2021-03-25 04:50:45,568 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 35 places, 29 transitions, 112 flow [2021-03-25 04:50:45,580 INFO L129 PetriNetUnfolder]: 32/95 cut-off events. [2021-03-25 04:50:45,580 INFO L130 PetriNetUnfolder]: For 29/33 co-relation queries the response was YES. [2021-03-25 04:50:45,581 INFO L84 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 95 events. 32/95 cut-off events. For 29/33 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 354 event pairs, 9 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 201. Up to 38 conditions per place. [2021-03-25 04:50:45,582 INFO L142 LiptonReduction]: Number of co-enabled transitions 300 [2021-03-25 04:50:45,585 INFO L154 LiptonReduction]: Checked pairs total: 176 [2021-03-25 04:50:45,585 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:45,585 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 17 [2021-03-25 04:50:45,586 INFO L480 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 112 flow [2021-03-25 04:50:45,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,586 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:45,586 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:45,586 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-03-25 04:50:45,587 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:45,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:45,587 INFO L82 PathProgramCache]: Analyzing trace with hash 197787498, now seen corresponding path program 1 times [2021-03-25 04:50:45,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:45,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688402441] [2021-03-25 04:50:45,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:45,684 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:45,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:45,698 INFO L142 QuantifierPusher]: treesize reduction 18, result has 37.9 percent of original size [2021-03-25 04:50:45,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:50:45,710 INFO L142 QuantifierPusher]: treesize reduction 13, result has 53.6 percent of original size [2021-03-25 04:50:45,710 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:50:45,721 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 04:50:45,721 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688402441] [2021-03-25 04:50:45,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:45,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:45,722 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038968980] [2021-03-25 04:50:45,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:45,722 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:45,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:45,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:45,724 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 174 [2021-03-25 04:50:45,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,725 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:45,725 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 174 [2021-03-25 04:50:45,725 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:45,784 INFO L129 PetriNetUnfolder]: 63/147 cut-off events. [2021-03-25 04:50:45,784 INFO L130 PetriNetUnfolder]: For 87/89 co-relation queries the response was YES. [2021-03-25 04:50:45,785 INFO L84 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 147 events. 63/147 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 616 event pairs, 34 based on Foata normal form. 3/138 useless extension candidates. Maximal degree in co-relation 394. Up to 98 conditions per place. [2021-03-25 04:50:45,793 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 9 selfloop transitions, 11 changer transitions 0/36 dead transitions. [2021-03-25 04:50:45,794 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 36 transitions, 185 flow [2021-03-25 04:50:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:50:45,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:50:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2021-03-25 04:50:45,800 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7724137931034483 [2021-03-25 04:50:45,801 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2021-03-25 04:50:45,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2021-03-25 04:50:45,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:45,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2021-03-25 04:50:45,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,805 INFO L185 Difference]: Start difference. First operand has 35 places, 29 transitions, 112 flow. Second operand 5 states and 672 transitions. [2021-03-25 04:50:45,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 36 transitions, 185 flow [2021-03-25 04:50:45,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 36 transitions, 185 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-03-25 04:50:45,807 INFO L241 Difference]: Finished difference. Result has 42 places, 36 transitions, 193 flow [2021-03-25 04:50:45,807 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2021-03-25 04:50:45,808 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2021-03-25 04:50:45,808 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:45,808 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 42 places, 36 transitions, 193 flow [2021-03-25 04:50:45,808 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 42 places, 36 transitions, 193 flow [2021-03-25 04:50:45,809 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 42 places, 36 transitions, 193 flow [2021-03-25 04:50:45,824 INFO L129 PetriNetUnfolder]: 32/101 cut-off events. [2021-03-25 04:50:45,825 INFO L130 PetriNetUnfolder]: For 80/81 co-relation queries the response was YES. [2021-03-25 04:50:45,825 INFO L84 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 101 events. 32/101 cut-off events. For 80/81 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 416 event pairs, 3 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 267. Up to 35 conditions per place. [2021-03-25 04:50:45,826 INFO L142 LiptonReduction]: Number of co-enabled transitions 360 [2021-03-25 04:50:45,830 INFO L154 LiptonReduction]: Checked pairs total: 313 [2021-03-25 04:50:45,830 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:45,830 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 04:50:45,831 INFO L480 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 193 flow [2021-03-25 04:50:45,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,834 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:45,834 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:45,834 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-03-25 04:50:45,835 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:45,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:45,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1030029917, now seen corresponding path program 1 times [2021-03-25 04:50:45,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:45,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547364731] [2021-03-25 04:50:45,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:45,926 INFO L142 QuantifierPusher]: treesize reduction 10, result has 52.4 percent of original size [2021-03-25 04:50:45,927 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:50:45,934 INFO L142 QuantifierPusher]: treesize reduction 14, result has 50.0 percent of original size [2021-03-25 04:50:45,934 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 14 [2021-03-25 04:50:45,944 INFO L142 QuantifierPusher]: treesize reduction 13, result has 58.1 percent of original size [2021-03-25 04:50:45,945 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-03-25 04:50:45,986 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 04:50:45,986 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547364731] [2021-03-25 04:50:45,988 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:45,988 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:45,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227865156] [2021-03-25 04:50:45,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:45,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:45,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:45,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:45,990 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 174 [2021-03-25 04:50:45,991 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:45,991 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:45,991 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 174 [2021-03-25 04:50:45,991 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:46,042 INFO L129 PetriNetUnfolder]: 55/136 cut-off events. [2021-03-25 04:50:46,042 INFO L130 PetriNetUnfolder]: For 186/191 co-relation queries the response was YES. [2021-03-25 04:50:46,044 INFO L84 FinitePrefix]: Finished finitePrefix Result has 450 conditions, 136 events. 55/136 cut-off events. For 186/191 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 571 event pairs, 6 based on Foata normal form. 7/132 useless extension candidates. Maximal degree in co-relation 432. Up to 78 conditions per place. [2021-03-25 04:50:46,045 INFO L132 encePairwiseOnDemand]: 169/174 looper letters, 16 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2021-03-25 04:50:46,045 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 259 flow [2021-03-25 04:50:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:46,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2021-03-25 04:50:46,048 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7729885057471264 [2021-03-25 04:50:46,048 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions. [2021-03-25 04:50:46,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions. [2021-03-25 04:50:46,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:46,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions. [2021-03-25 04:50:46,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,052 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,052 INFO L185 Difference]: Start difference. First operand has 42 places, 36 transitions, 193 flow. Second operand 4 states and 538 transitions. [2021-03-25 04:50:46,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 259 flow [2021-03-25 04:50:46,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 40 transitions, 247 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:46,058 INFO L241 Difference]: Finished difference. Result has 46 places, 38 transitions, 220 flow [2021-03-25 04:50:46,059 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2021-03-25 04:50:46,059 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2021-03-25 04:50:46,059 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:46,059 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 46 places, 38 transitions, 220 flow [2021-03-25 04:50:46,059 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 46 places, 38 transitions, 220 flow [2021-03-25 04:50:46,060 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 46 places, 38 transitions, 220 flow [2021-03-25 04:50:46,074 INFO L129 PetriNetUnfolder]: 38/115 cut-off events. [2021-03-25 04:50:46,074 INFO L130 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2021-03-25 04:50:46,075 INFO L84 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 115 events. 38/115 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 468 event pairs, 8 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 345. Up to 35 conditions per place. [2021-03-25 04:50:46,076 INFO L142 LiptonReduction]: Number of co-enabled transitions 380 [2021-03-25 04:50:46,080 INFO L154 LiptonReduction]: Checked pairs total: 261 [2021-03-25 04:50:46,080 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:46,080 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 21 [2021-03-25 04:50:46,082 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 220 flow [2021-03-25 04:50:46,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,082 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:46,082 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:46,083 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-03-25 04:50:46,083 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:46,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:46,083 INFO L82 PathProgramCache]: Analyzing trace with hash 197902818, now seen corresponding path program 2 times [2021-03-25 04:50:46,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:46,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921445029] [2021-03-25 04:50:46,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:46,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:46,156 INFO L142 QuantifierPusher]: treesize reduction 18, result has 41.9 percent of original size [2021-03-25 04:50:46,156 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:50:46,164 INFO L142 QuantifierPusher]: treesize reduction 18, result has 35.7 percent of original size [2021-03-25 04:50:46,165 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-03-25 04:50:46,172 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:46,173 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:50:46,180 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 04:50:46,181 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921445029] [2021-03-25 04:50:46,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:46,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:46,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953963978] [2021-03-25 04:50:46,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:46,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:46,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:46,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:46,183 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 174 [2021-03-25 04:50:46,183 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 220 flow. Second operand has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,184 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:46,184 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 174 [2021-03-25 04:50:46,184 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:46,254 INFO L129 PetriNetUnfolder]: 44/111 cut-off events. [2021-03-25 04:50:46,255 INFO L130 PetriNetUnfolder]: For 262/269 co-relation queries the response was YES. [2021-03-25 04:50:46,255 INFO L84 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 111 events. 44/111 cut-off events. For 262/269 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 413 event pairs, 9 based on Foata normal form. 10/112 useless extension candidates. Maximal degree in co-relation 413. Up to 56 conditions per place. [2021-03-25 04:50:46,256 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 13 selfloop transitions, 11 changer transitions 0/40 dead transitions. [2021-03-25 04:50:46,256 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 40 transitions, 277 flow [2021-03-25 04:50:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:46,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:46,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 540 transitions. [2021-03-25 04:50:46,258 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7758620689655172 [2021-03-25 04:50:46,259 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 540 transitions. [2021-03-25 04:50:46,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 540 transitions. [2021-03-25 04:50:46,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:46,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 540 transitions. [2021-03-25 04:50:46,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.0) internal successors, (540), 4 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 04:50:46,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,262 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 174.0) internal successors, (870), 5 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,262 INFO L185 Difference]: Start difference. First operand has 46 places, 38 transitions, 220 flow. Second operand 4 states and 540 transitions. [2021-03-25 04:50:46,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 40 transitions, 277 flow [2021-03-25 04:50:46,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 40 transitions, 270 flow, removed 1 selfloop flow, removed 1 redundant places. [2021-03-25 04:50:46,266 INFO L241 Difference]: Finished difference. Result has 49 places, 39 transitions, 254 flow [2021-03-25 04:50:46,266 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2021-03-25 04:50:46,267 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2021-03-25 04:50:46,267 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:46,267 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 49 places, 39 transitions, 254 flow [2021-03-25 04:50:46,267 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 49 places, 39 transitions, 254 flow [2021-03-25 04:50:46,267 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 39 transitions, 254 flow [2021-03-25 04:50:46,285 INFO L129 PetriNetUnfolder]: 36/111 cut-off events. [2021-03-25 04:50:46,285 INFO L130 PetriNetUnfolder]: For 257/257 co-relation queries the response was YES. [2021-03-25 04:50:46,286 INFO L84 FinitePrefix]: Finished finitePrefix Result has 384 conditions, 111 events. 36/111 cut-off events. For 257/257 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 467 event pairs, 3 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 363. Up to 37 conditions per place. [2021-03-25 04:50:46,287 INFO L142 LiptonReduction]: Number of co-enabled transitions 390 [2021-03-25 04:50:46,294 INFO L154 LiptonReduction]: Checked pairs total: 318 [2021-03-25 04:50:46,294 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:46,294 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 27 [2021-03-25 04:50:46,296 INFO L480 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 254 flow [2021-03-25 04:50:46,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 131.8) internal successors, (659), 5 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,297 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:46,297 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:46,297 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-03-25 04:50:46,297 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:46,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:46,298 INFO L82 PathProgramCache]: Analyzing trace with hash -517841361, now seen corresponding path program 1 times [2021-03-25 04:50:46,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:46,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273436064] [2021-03-25 04:50:46,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:46,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:46,386 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:46,388 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-03-25 04:50:46,398 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:46,398 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-03-25 04:50:46,410 INFO L142 QuantifierPusher]: treesize reduction 12, result has 47.8 percent of original size [2021-03-25 04:50:46,411 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 11 [2021-03-25 04:50:46,424 INFO L142 QuantifierPusher]: treesize reduction 22, result has 40.5 percent of original size [2021-03-25 04:50:46,426 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 15 [2021-03-25 04:50:46,437 INFO L142 QuantifierPusher]: treesize reduction 10, result has 54.5 percent of original size [2021-03-25 04:50:46,438 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 04:50:46,447 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 04:50:46,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273436064] [2021-03-25 04:50:46,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:46,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:50:46,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182300190] [2021-03-25 04:50:46,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:50:46,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:46,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:50:46,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:50:46,450 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 174 [2021-03-25 04:50:46,451 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,451 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:46,451 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 174 [2021-03-25 04:50:46,451 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:46,562 INFO L129 PetriNetUnfolder]: 46/130 cut-off events. [2021-03-25 04:50:46,562 INFO L130 PetriNetUnfolder]: For 399/406 co-relation queries the response was YES. [2021-03-25 04:50:46,563 INFO L84 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 130 events. 46/130 cut-off events. For 399/406 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 570 event pairs, 3 based on Foata normal form. 8/128 useless extension candidates. Maximal degree in co-relation 497. Up to 50 conditions per place. [2021-03-25 04:50:46,564 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 13 selfloop transitions, 13 changer transitions 0/42 dead transitions. [2021-03-25 04:50:46,564 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 42 transitions, 326 flow [2021-03-25 04:50:46,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:50:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:50:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2021-03-25 04:50:46,566 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7264367816091954 [2021-03-25 04:50:46,566 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 632 transitions. [2021-03-25 04:50:46,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 632 transitions. [2021-03-25 04:50:46,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:46,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 632 transitions. [2021-03-25 04:50:46,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,570 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,570 INFO L185 Difference]: Start difference. First operand has 49 places, 39 transitions, 254 flow. Second operand 5 states and 632 transitions. [2021-03-25 04:50:46,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 42 transitions, 326 flow [2021-03-25 04:50:46,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 308 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:46,573 INFO L241 Difference]: Finished difference. Result has 52 places, 40 transitions, 284 flow [2021-03-25 04:50:46,573 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=284, PETRI_PLACES=52, PETRI_TRANSITIONS=40} [2021-03-25 04:50:46,574 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2021-03-25 04:50:46,574 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:46,574 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 40 transitions, 284 flow [2021-03-25 04:50:46,574 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 40 transitions, 284 flow [2021-03-25 04:50:46,574 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 52 places, 40 transitions, 284 flow [2021-03-25 04:50:46,589 INFO L129 PetriNetUnfolder]: 36/118 cut-off events. [2021-03-25 04:50:46,589 INFO L130 PetriNetUnfolder]: For 307/307 co-relation queries the response was YES. [2021-03-25 04:50:46,590 INFO L84 FinitePrefix]: Finished finitePrefix Result has 424 conditions, 118 events. 36/118 cut-off events. For 307/307 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 536 event pairs, 3 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 402. Up to 41 conditions per place. [2021-03-25 04:50:46,591 INFO L142 LiptonReduction]: Number of co-enabled transitions 402 [2021-03-25 04:50:46,596 INFO L154 LiptonReduction]: Checked pairs total: 329 [2021-03-25 04:50:46,596 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:46,596 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 22 [2021-03-25 04:50:46,602 INFO L480 AbstractCegarLoop]: Abstraction has has 52 places, 40 transitions, 284 flow [2021-03-25 04:50:46,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 123.85714285714286) internal successors, (867), 7 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,603 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:46,603 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:46,603 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-03-25 04:50:46,603 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:46,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1698621501, now seen corresponding path program 2 times [2021-03-25 04:50:46,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:46,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477109995] [2021-03-25 04:50:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:46,680 INFO L142 QuantifierPusher]: treesize reduction 10, result has 73.0 percent of original size [2021-03-25 04:50:46,681 INFO L147 QuantifierPusher]: treesize reduction 5, result has 81.5 percent of original size 22 [2021-03-25 04:50:46,700 INFO L142 QuantifierPusher]: treesize reduction 15, result has 63.4 percent of original size [2021-03-25 04:50:46,705 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-03-25 04:50:46,723 INFO L142 QuantifierPusher]: treesize reduction 15, result has 65.1 percent of original size [2021-03-25 04:50:46,725 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 28 [2021-03-25 04:50:46,754 INFO L142 QuantifierPusher]: treesize reduction 12, result has 66.7 percent of original size [2021-03-25 04:50:46,757 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 24 [2021-03-25 04:50:46,782 INFO L142 QuantifierPusher]: treesize reduction 7, result has 63.2 percent of original size [2021-03-25 04:50:46,783 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 12 [2021-03-25 04:50:46,794 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 04:50:46,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477109995] [2021-03-25 04:50:46,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:46,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:50:46,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72149564] [2021-03-25 04:50:46,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-03-25 04:50:46,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:46,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-03-25 04:50:46,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-03-25 04:50:46,796 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 174 [2021-03-25 04:50:46,797 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 284 flow. Second operand has 7 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,797 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:46,797 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 174 [2021-03-25 04:50:46,797 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:46,900 INFO L129 PetriNetUnfolder]: 45/125 cut-off events. [2021-03-25 04:50:46,900 INFO L130 PetriNetUnfolder]: For 414/421 co-relation queries the response was YES. [2021-03-25 04:50:46,901 INFO L84 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 125 events. 45/125 cut-off events. For 414/421 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 532 event pairs, 3 based on Foata normal form. 7/123 useless extension candidates. Maximal degree in co-relation 501. Up to 42 conditions per place. [2021-03-25 04:50:46,902 INFO L132 encePairwiseOnDemand]: 167/174 looper letters, 13 selfloop transitions, 16 changer transitions 0/45 dead transitions. [2021-03-25 04:50:46,902 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 375 flow [2021-03-25 04:50:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:50:46,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:50:46,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2021-03-25 04:50:46,905 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.7609195402298851 [2021-03-25 04:50:46,905 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2021-03-25 04:50:46,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2021-03-25 04:50:46,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:46,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2021-03-25 04:50:46,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,909 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,909 INFO L185 Difference]: Start difference. First operand has 52 places, 40 transitions, 284 flow. Second operand 5 states and 662 transitions. [2021-03-25 04:50:46,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 375 flow [2021-03-25 04:50:46,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 45 transitions, 348 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-03-25 04:50:46,914 INFO L241 Difference]: Finished difference. Result has 54 places, 43 transitions, 332 flow [2021-03-25 04:50:46,914 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2021-03-25 04:50:46,914 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2021-03-25 04:50:46,914 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:46,914 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 54 places, 43 transitions, 332 flow [2021-03-25 04:50:46,915 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 54 places, 43 transitions, 332 flow [2021-03-25 04:50:46,915 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 54 places, 43 transitions, 332 flow [2021-03-25 04:50:46,930 INFO L129 PetriNetUnfolder]: 39/118 cut-off events. [2021-03-25 04:50:46,930 INFO L130 PetriNetUnfolder]: For 536/544 co-relation queries the response was YES. [2021-03-25 04:50:46,931 INFO L84 FinitePrefix]: Finished finitePrefix Result has 476 conditions, 118 events. 39/118 cut-off events. For 536/544 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 519 event pairs, 3 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 454. Up to 43 conditions per place. [2021-03-25 04:50:46,932 INFO L142 LiptonReduction]: Number of co-enabled transitions 414 [2021-03-25 04:50:46,939 INFO L154 LiptonReduction]: Checked pairs total: 415 [2021-03-25 04:50:46,939 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:46,939 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 25 [2021-03-25 04:50:46,939 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 332 flow [2021-03-25 04:50:46,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 129.85714285714286) internal successors, (909), 7 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:46,940 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:46,940 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:46,940 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-03-25 04:50:46,941 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:46,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:46,941 INFO L82 PathProgramCache]: Analyzing trace with hash 238648205, now seen corresponding path program 1 times [2021-03-25 04:50:46,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:46,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348200279] [2021-03-25 04:50:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:46,995 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:46,995 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:46,998 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:50:46,999 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:50:47,005 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:47,006 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:47,007 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 04:50:47,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348200279] [2021-03-25 04:50:47,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:47,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:47,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928538945] [2021-03-25 04:50:47,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:47,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:47,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:47,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:47,009 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-25 04:50:47,009 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,009 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:47,009 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-25 04:50:47,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:47,078 INFO L129 PetriNetUnfolder]: 122/279 cut-off events. [2021-03-25 04:50:47,078 INFO L130 PetriNetUnfolder]: For 1120/1250 co-relation queries the response was YES. [2021-03-25 04:50:47,080 INFO L84 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 279 events. 122/279 cut-off events. For 1120/1250 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1488 event pairs, 38 based on Foata normal form. 63/290 useless extension candidates. Maximal degree in co-relation 915. Up to 154 conditions per place. [2021-03-25 04:50:47,082 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 13 selfloop transitions, 8 changer transitions 0/54 dead transitions. [2021-03-25 04:50:47,082 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 396 flow [2021-03-25 04:50:47,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-03-25 04:50:47,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2021-03-25 04:50:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 720 transitions. [2021-03-25 04:50:47,085 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2021-03-25 04:50:47,085 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 720 transitions. [2021-03-25 04:50:47,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 720 transitions. [2021-03-25 04:50:47,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:47,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 720 transitions. [2021-03-25 04:50:47,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.0) internal successors, (720), 5 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,089 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 174.0) internal successors, (1044), 6 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,089 INFO L185 Difference]: Start difference. First operand has 54 places, 43 transitions, 332 flow. Second operand 5 states and 720 transitions. [2021-03-25 04:50:47,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 396 flow [2021-03-25 04:50:47,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 372 flow, removed 3 selfloop flow, removed 2 redundant places. [2021-03-25 04:50:47,093 INFO L241 Difference]: Finished difference. Result has 59 places, 50 transitions, 380 flow [2021-03-25 04:50:47,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=380, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2021-03-25 04:50:47,093 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 14 predicate places. [2021-03-25 04:50:47,094 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:47,094 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 59 places, 50 transitions, 380 flow [2021-03-25 04:50:47,094 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 59 places, 50 transitions, 380 flow [2021-03-25 04:50:47,094 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 59 places, 50 transitions, 380 flow [2021-03-25 04:50:47,124 INFO L129 PetriNetUnfolder]: 92/216 cut-off events. [2021-03-25 04:50:47,124 INFO L130 PetriNetUnfolder]: For 831/911 co-relation queries the response was YES. [2021-03-25 04:50:47,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 216 events. 92/216 cut-off events. For 831/911 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1106 event pairs, 33 based on Foata normal form. 16/206 useless extension candidates. Maximal degree in co-relation 828. Up to 98 conditions per place. [2021-03-25 04:50:47,127 INFO L142 LiptonReduction]: Number of co-enabled transitions 454 [2021-03-25 04:50:47,133 INFO L154 LiptonReduction]: Checked pairs total: 260 [2021-03-25 04:50:47,133 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:47,134 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 40 [2021-03-25 04:50:47,134 INFO L480 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 380 flow [2021-03-25 04:50:47,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,134 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:47,135 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:47,135 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-03-25 04:50:47,135 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:47,135 INFO L82 PathProgramCache]: Analyzing trace with hash 818630797, now seen corresponding path program 1 times [2021-03-25 04:50:47,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:47,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195512395] [2021-03-25 04:50:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:47,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:47,181 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:47,182 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:47,185 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:47,185 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:47,190 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:50:47,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:50:47,197 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:47,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:47,198 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 04:50:47,198 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195512395] [2021-03-25 04:50:47,198 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:47,198 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-03-25 04:50:47,198 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728780436] [2021-03-25 04:50:47,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-03-25 04:50:47,199 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:47,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-03-25 04:50:47,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-03-25 04:50:47,200 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 174 [2021-03-25 04:50:47,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 380 flow. Second operand has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:47,201 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 174 [2021-03-25 04:50:47,201 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:47,303 INFO L129 PetriNetUnfolder]: 75/205 cut-off events. [2021-03-25 04:50:47,304 INFO L130 PetriNetUnfolder]: For 1198/1869 co-relation queries the response was YES. [2021-03-25 04:50:47,305 INFO L84 FinitePrefix]: Finished finitePrefix Result has 814 conditions, 205 events. 75/205 cut-off events. For 1198/1869 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1048 event pairs, 4 based on Foata normal form. 113/292 useless extension candidates. Maximal degree in co-relation 786. Up to 114 conditions per place. [2021-03-25 04:50:47,306 INFO L132 encePairwiseOnDemand]: 168/174 looper letters, 8 selfloop transitions, 15 changer transitions 3/51 dead transitions. [2021-03-25 04:50:47,306 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 51 transitions, 381 flow [2021-03-25 04:50:47,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:50:47,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:50:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1008 transitions. [2021-03-25 04:50:47,309 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8275862068965517 [2021-03-25 04:50:47,309 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1008 transitions. [2021-03-25 04:50:47,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1008 transitions. [2021-03-25 04:50:47,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:47,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1008 transitions. [2021-03-25 04:50:47,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,316 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 174.0) internal successors, (1392), 8 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:47,316 INFO L185 Difference]: Start difference. First operand has 59 places, 50 transitions, 380 flow. Second operand 7 states and 1008 transitions. [2021-03-25 04:50:47,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 51 transitions, 381 flow [2021-03-25 04:50:47,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 51 transitions, 354 flow, removed 3 selfloop flow, removed 6 redundant places. [2021-03-25 04:50:47,319 INFO L241 Difference]: Finished difference. Result has 61 places, 46 transitions, 339 flow [2021-03-25 04:50:47,320 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=174, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=339, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2021-03-25 04:50:47,320 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2021-03-25 04:50:47,320 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:47,320 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 61 places, 46 transitions, 339 flow [2021-03-25 04:50:47,320 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 61 places, 46 transitions, 339 flow [2021-03-25 04:50:47,321 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 61 places, 46 transitions, 339 flow [2021-03-25 04:50:47,341 INFO L129 PetriNetUnfolder]: 45/152 cut-off events. [2021-03-25 04:50:47,341 INFO L130 PetriNetUnfolder]: For 718/767 co-relation queries the response was YES. [2021-03-25 04:50:47,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 152 events. 45/152 cut-off events. For 718/767 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 771 event pairs, 4 based on Foata normal form. 10/155 useless extension candidates. Maximal degree in co-relation 646. Up to 82 conditions per place. [2021-03-25 04:50:47,344 INFO L142 LiptonReduction]: Number of co-enabled transitions 492 [2021-03-25 04:50:47,532 WARN L205 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2021-03-25 04:50:47,959 WARN L205 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 80 [2021-03-25 04:50:48,066 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2021-03-25 04:50:48,072 INFO L154 LiptonReduction]: Checked pairs total: 363 [2021-03-25 04:50:48,072 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:50:48,072 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 752 [2021-03-25 04:50:48,072 INFO L480 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 327 flow [2021-03-25 04:50:48,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,073 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:48,073 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:48,073 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-03-25 04:50:48,073 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:48,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:48,074 INFO L82 PathProgramCache]: Analyzing trace with hash -121288443, now seen corresponding path program 1 times [2021-03-25 04:50:48,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:48,074 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519238924] [2021-03-25 04:50:48,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:48,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:48,103 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:48,104 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:48,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:48,107 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 04:50:48,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519238924] [2021-03-25 04:50:48,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:48,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-03-25 04:50:48,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788330515] [2021-03-25 04:50:48,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-03-25 04:50:48,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:48,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-03-25 04:50:48,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-03-25 04:50:48,109 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 175 [2021-03-25 04:50:48,109 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 44 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,109 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:48,109 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 175 [2021-03-25 04:50:48,110 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:48,137 INFO L129 PetriNetUnfolder]: 42/139 cut-off events. [2021-03-25 04:50:48,137 INFO L130 PetriNetUnfolder]: For 781/824 co-relation queries the response was YES. [2021-03-25 04:50:48,138 INFO L84 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 139 events. 42/139 cut-off events. For 781/824 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 604 event pairs, 6 based on Foata normal form. 13/142 useless extension candidates. Maximal degree in co-relation 614. Up to 69 conditions per place. [2021-03-25 04:50:48,138 INFO L132 encePairwiseOnDemand]: 172/175 looper letters, 3 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2021-03-25 04:50:48,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 38 transitions, 282 flow [2021-03-25 04:50:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-03-25 04:50:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-03-25 04:50:48,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2021-03-25 04:50:48,141 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.88 [2021-03-25 04:50:48,141 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2021-03-25 04:50:48,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2021-03-25 04:50:48,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:48,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2021-03-25 04:50:48,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 175.0) internal successors, (700), 4 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,143 INFO L185 Difference]: Start difference. First operand has 61 places, 44 transitions, 327 flow. Second operand 3 states and 462 transitions. [2021-03-25 04:50:48,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 38 transitions, 282 flow [2021-03-25 04:50:48,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 38 transitions, 244 flow, removed 14 selfloop flow, removed 6 redundant places. [2021-03-25 04:50:48,146 INFO L241 Difference]: Finished difference. Result has 53 places, 38 transitions, 243 flow [2021-03-25 04:50:48,146 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=243, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2021-03-25 04:50:48,147 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2021-03-25 04:50:48,147 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:48,147 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 53 places, 38 transitions, 243 flow [2021-03-25 04:50:48,147 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 53 places, 38 transitions, 243 flow [2021-03-25 04:50:48,147 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 53 places, 38 transitions, 243 flow [2021-03-25 04:50:48,162 INFO L129 PetriNetUnfolder]: 42/137 cut-off events. [2021-03-25 04:50:48,162 INFO L130 PetriNetUnfolder]: For 299/310 co-relation queries the response was YES. [2021-03-25 04:50:48,163 INFO L84 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 137 events. 42/137 cut-off events. For 299/310 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 611 event pairs, 6 based on Foata normal form. 5/134 useless extension candidates. Maximal degree in co-relation 471. Up to 45 conditions per place. [2021-03-25 04:50:48,164 INFO L142 LiptonReduction]: Number of co-enabled transitions 324 [2021-03-25 04:50:48,167 INFO L154 LiptonReduction]: Checked pairs total: 124 [2021-03-25 04:50:48,167 INFO L156 LiptonReduction]: Total number of compositions: 0 [2021-03-25 04:50:48,167 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 20 [2021-03-25 04:50:48,167 INFO L480 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 243 flow [2021-03-25 04:50:48,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,168 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:48,168 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:48,168 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-03-25 04:50:48,168 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1625993619, now seen corresponding path program 1 times [2021-03-25 04:50:48,168 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:48,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251238687] [2021-03-25 04:50:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:48,217 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:48,218 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:48,221 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:48,221 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:48,225 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:48,225 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:48,230 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-03-25 04:50:48,231 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-03-25 04:50:48,238 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:48,239 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:48,240 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 04:50:48,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251238687] [2021-03-25 04:50:48,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:48,240 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-03-25 04:50:48,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069740617] [2021-03-25 04:50:48,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-03-25 04:50:48,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:48,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-03-25 04:50:48,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-03-25 04:50:48,242 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 175 [2021-03-25 04:50:48,243 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 243 flow. Second operand has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,243 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:48,243 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 175 [2021-03-25 04:50:48,243 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:48,311 INFO L129 PetriNetUnfolder]: 69/171 cut-off events. [2021-03-25 04:50:48,311 INFO L130 PetriNetUnfolder]: For 295/405 co-relation queries the response was YES. [2021-03-25 04:50:48,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 171 events. 69/171 cut-off events. For 295/405 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 781 event pairs, 0 based on Foata normal form. 46/192 useless extension candidates. Maximal degree in co-relation 611. Up to 67 conditions per place. [2021-03-25 04:50:48,313 INFO L132 encePairwiseOnDemand]: 169/175 looper letters, 5 selfloop transitions, 11 changer transitions 4/45 dead transitions. [2021-03-25 04:50:48,313 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 45 transitions, 319 flow [2021-03-25 04:50:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-03-25 04:50:48,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-03-25 04:50:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1009 transitions. [2021-03-25 04:50:48,316 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.8236734693877551 [2021-03-25 04:50:48,316 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1009 transitions. [2021-03-25 04:50:48,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1009 transitions. [2021-03-25 04:50:48,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:48,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1009 transitions. [2021-03-25 04:50:48,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.14285714285714) internal successors, (1009), 7 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,321 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 175.0) internal successors, (1400), 8 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:48,321 INFO L185 Difference]: Start difference. First operand has 53 places, 38 transitions, 243 flow. Second operand 7 states and 1009 transitions. [2021-03-25 04:50:48,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 45 transitions, 319 flow [2021-03-25 04:50:48,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 277 flow, removed 14 selfloop flow, removed 4 redundant places. [2021-03-25 04:50:48,325 INFO L241 Difference]: Finished difference. Result has 58 places, 39 transitions, 249 flow [2021-03-25 04:50:48,326 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2021-03-25 04:50:48,326 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2021-03-25 04:50:48,326 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:48,326 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 58 places, 39 transitions, 249 flow [2021-03-25 04:50:48,326 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 58 places, 39 transitions, 249 flow [2021-03-25 04:50:48,326 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 39 transitions, 249 flow [2021-03-25 04:50:48,336 INFO L129 PetriNetUnfolder]: 24/97 cut-off events. [2021-03-25 04:50:48,336 INFO L130 PetriNetUnfolder]: For 185/196 co-relation queries the response was YES. [2021-03-25 04:50:48,337 INFO L84 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 97 events. 24/97 cut-off events. For 185/196 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 412 event pairs, 0 based on Foata normal form. 1/92 useless extension candidates. Maximal degree in co-relation 350. Up to 39 conditions per place. [2021-03-25 04:50:48,338 INFO L142 LiptonReduction]: Number of co-enabled transitions 302 [2021-03-25 04:50:48,986 WARN L205 SmtUtils]: Spent 647.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 180 [2021-03-25 04:50:49,186 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2021-03-25 04:50:50,538 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 334 DAG size of output: 262 [2021-03-25 04:50:51,089 WARN L205 SmtUtils]: Spent 548.00 ms on a formula simplification that was a NOOP. DAG size: 242 [2021-03-25 04:50:51,320 WARN L205 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 04:50:51,540 WARN L205 SmtUtils]: Spent 219.00 ms on a formula simplification that was a NOOP. DAG size: 176 [2021-03-25 04:50:52,140 WARN L205 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:50:52,729 WARN L205 SmtUtils]: Spent 587.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2021-03-25 04:50:52,735 INFO L154 LiptonReduction]: Checked pairs total: 347 [2021-03-25 04:50:52,736 INFO L156 LiptonReduction]: Total number of compositions: 3 [2021-03-25 04:50:52,736 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4410 [2021-03-25 04:50:52,736 INFO L480 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 235 flow [2021-03-25 04:50:52,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 141.83333333333334) internal successors, (851), 6 states have internal predecessors, (851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:52,737 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:52,737 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:52,737 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-03-25 04:50:52,737 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:52,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:52,737 INFO L82 PathProgramCache]: Analyzing trace with hash -122520590, now seen corresponding path program 1 times [2021-03-25 04:50:52,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:52,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645427440] [2021-03-25 04:50:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-03-25 04:50:52,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:52,771 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-03-25 04:50:52,771 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:52,772 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:52,774 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-03-25 04:50:52,776 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-03-25 04:50:52,779 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 04:50:52,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645427440] [2021-03-25 04:50:52,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-03-25 04:50:52,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-03-25 04:50:52,779 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262434493] [2021-03-25 04:50:52,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-03-25 04:50:52,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-03-25 04:50:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-03-25 04:50:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-03-25 04:50:52,781 INFO L508 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 177 [2021-03-25 04:50:52,782 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 235 flow. Second operand has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:52,782 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-03-25 04:50:52,782 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 177 [2021-03-25 04:50:52,782 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-03-25 04:50:52,813 INFO L129 PetriNetUnfolder]: 44/144 cut-off events. [2021-03-25 04:50:52,813 INFO L130 PetriNetUnfolder]: For 806/856 co-relation queries the response was YES. [2021-03-25 04:50:52,814 INFO L84 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 144 events. 44/144 cut-off events. For 806/856 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 708 event pairs, 0 based on Foata normal form. 22/159 useless extension candidates. Maximal degree in co-relation 511. Up to 59 conditions per place. [2021-03-25 04:50:52,814 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 3 selfloop transitions, 1 changer transitions 8/37 dead transitions. [2021-03-25 04:50:52,814 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 37 transitions, 247 flow [2021-03-25 04:50:52,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-03-25 04:50:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2021-03-25 04:50:52,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2021-03-25 04:50:52,817 INFO L553 CegarLoopForPetriNet]: DFA transition density 0.827683615819209 [2021-03-25 04:50:52,817 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2021-03-25 04:50:52,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2021-03-25 04:50:52,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-03-25 04:50:52,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2021-03-25 04:50:52,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:52,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:52,820 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 177.0) internal successors, (885), 5 states have internal predecessors, (885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:52,820 INFO L185 Difference]: Start difference. First operand has 54 places, 36 transitions, 235 flow. Second operand 4 states and 586 transitions. [2021-03-25 04:50:52,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 37 transitions, 247 flow [2021-03-25 04:50:52,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 37 transitions, 211 flow, removed 9 selfloop flow, removed 7 redundant places. [2021-03-25 04:50:52,822 INFO L241 Difference]: Finished difference. Result has 52 places, 29 transitions, 162 flow [2021-03-25 04:50:52,822 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=52, PETRI_TRANSITIONS=29} [2021-03-25 04:50:52,823 INFO L343 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2021-03-25 04:50:52,823 INFO L174 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2021-03-25 04:50:52,823 INFO L137 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 52 places, 29 transitions, 162 flow [2021-03-25 04:50:52,823 INFO L129 LiptonReduction]: Starting Lipton reduction on Petri net that has 52 places, 29 transitions, 162 flow [2021-03-25 04:50:52,823 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 49 places, 29 transitions, 162 flow [2021-03-25 04:50:52,828 INFO L129 PetriNetUnfolder]: 10/47 cut-off events. [2021-03-25 04:50:52,828 INFO L130 PetriNetUnfolder]: For 79/85 co-relation queries the response was YES. [2021-03-25 04:50:52,828 INFO L84 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 47 events. 10/47 cut-off events. For 79/85 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 106 event pairs, 0 based on Foata normal form. 6/53 useless extension candidates. Maximal degree in co-relation 129. Up to 14 conditions per place. [2021-03-25 04:50:52,829 INFO L142 LiptonReduction]: Number of co-enabled transitions 128 [2021-03-25 04:50:53,074 WARN L205 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-03-25 04:50:53,443 WARN L205 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2021-03-25 04:50:53,560 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2021-03-25 04:50:53,683 WARN L205 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2021-03-25 04:50:53,917 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 86 [2021-03-25 04:50:54,075 INFO L154 LiptonReduction]: Checked pairs total: 41 [2021-03-25 04:50:54,075 INFO L156 LiptonReduction]: Total number of compositions: 6 [2021-03-25 04:50:54,076 INFO L199 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 1253 [2021-03-25 04:50:54,076 INFO L480 AbstractCegarLoop]: Abstraction has has 46 places, 26 transitions, 162 flow [2021-03-25 04:50:54,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 146.0) internal successors, (584), 4 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-03-25 04:50:54,076 INFO L255 CegarLoopForPetriNet]: Found error trace [2021-03-25 04:50:54,076 INFO L263 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-03-25 04:50:54,076 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-03-25 04:50:54,077 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-03-25 04:50:54,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-03-25 04:50:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1546589327, now seen corresponding path program 1 times [2021-03-25 04:50:54,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-03-25 04:50:54,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087242023] [2021-03-25 04:50:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-03-25 04:50:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:50:54,102 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:50:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-03-25 04:50:54,128 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-03-25 04:50:54,171 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-03-25 04:50:54,171 INFO L634 BasicCegarLoop]: Counterexample might be feasible [2021-03-25 04:50:54,171 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-03-25 04:50:54,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.03 04:50:54 BasicIcfg [2021-03-25 04:50:54,264 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-03-25 04:50:54,265 INFO L168 Benchmark]: Toolchain (without parser) took 23325.64 ms. Allocated memory was 255.9 MB in the beginning and 675.3 MB in the end (delta: 419.4 MB). Free memory was 235.0 MB in the beginning and 579.5 MB in the end (delta: -344.6 MB). Peak memory consumption was 73.7 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:54,265 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-03-25 04:50:54,266 INFO L168 Benchmark]: CACSL2BoogieTranslator took 595.95 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 234.5 MB in the beginning and 316.2 MB in the end (delta: -81.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:54,266 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.86 ms. Allocated memory is still 356.5 MB. Free memory was 316.2 MB in the beginning and 313.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:54,266 INFO L168 Benchmark]: Boogie Preprocessor took 50.45 ms. Allocated memory is still 356.5 MB. Free memory was 313.3 MB in the beginning and 311.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:54,269 INFO L168 Benchmark]: RCFGBuilder took 1778.49 ms. Allocated memory is still 356.5 MB. Free memory was 311.2 MB in the beginning and 268.2 MB in the end (delta: 43.0 MB). Peak memory consumption was 46.2 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:54,272 INFO L168 Benchmark]: TraceAbstraction took 20847.29 ms. Allocated memory was 356.5 MB in the beginning and 675.3 MB in the end (delta: 318.8 MB). Free memory was 267.3 MB in the beginning and 579.5 MB in the end (delta: -312.3 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.0 GB. [2021-03-25 04:50:54,273 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.18 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 595.95 ms. Allocated memory was 255.9 MB in the beginning and 356.5 MB in the end (delta: 100.7 MB). Free memory was 234.5 MB in the beginning and 316.2 MB in the end (delta: -81.7 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 48.86 ms. Allocated memory is still 356.5 MB. Free memory was 316.2 MB in the beginning and 313.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 50.45 ms. Allocated memory is still 356.5 MB. Free memory was 313.3 MB in the beginning and 311.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1778.49 ms. Allocated memory is still 356.5 MB. Free memory was 311.2 MB in the beginning and 268.2 MB in the end (delta: 43.0 MB). Peak memory consumption was 46.2 MB. Max. memory is 16.0 GB. * TraceAbstraction took 20847.29 ms. Allocated memory was 356.5 MB in the beginning and 675.3 MB in the end (delta: 318.8 MB). Free memory was 267.3 MB in the beginning and 579.5 MB in the end (delta: -312.3 MB). Peak memory consumption was 6.5 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7340.2ms, 101 PlacesBefore, 45 PlacesAfterwards, 93 TransitionsBefore, 36 TransitionsAfterwards, 1578 CoEnabledTransitionPairs, 6 FixpointIterations, 26 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 68 TotalNumberOfCompositions, 2725 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1254, positive: 1173, positive conditional: 0, positive unconditional: 1173, negative: 81, negative conditional: 0, negative unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 791, positive: 769, positive conditional: 0, positive unconditional: 769, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 791, positive: 769, positive conditional: 0, positive unconditional: 769, negative: 22, negative conditional: 0, negative unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1254, positive: 404, positive conditional: 0, positive unconditional: 404, negative: 59, negative conditional: 0, negative unconditional: 59, unknown: 791, unknown conditional: 0, unknown unconditional: 791] , Statistics on independence cache: Total cache size (in pairs): 58, Positive cache size: 45, Positive conditional cache size: 0, Positive unconditional cache size: 45, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2901.5ms, 42 PlacesBefore, 31 PlacesAfterwards, 31 TransitionsBefore, 22 TransitionsAfterwards, 230 CoEnabledTransitionPairs, 4 FixpointIterations, 8 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 9 TotalNumberOfCompositions, 1024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 226, positive: 147, positive conditional: 0, positive unconditional: 147, negative: 79, negative conditional: 0, negative unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 31, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 31, positive: 22, positive conditional: 0, positive unconditional: 22, negative: 9, negative conditional: 0, negative unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 226, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 31, unknown conditional: 0, unknown unconditional: 31] , Statistics on independence cache: Total cache size (in pairs): 71, Positive cache size: 54, Positive conditional cache size: 0, Positive unconditional cache size: 54, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 865.8ms, 32 PlacesBefore, 31 PlacesAfterwards, 24 TransitionsBefore, 23 TransitionsAfterwards, 238 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 1 TotalNumberOfCompositions, 440 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 97, positive: 65, positive conditional: 0, positive unconditional: 65, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 1, negative conditional: 0, negative unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 97, positive: 61, positive conditional: 0, positive unconditional: 61, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 16.8ms, 35 PlacesBefore, 35 PlacesAfterwards, 29 TransitionsBefore, 29 TransitionsAfterwards, 300 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 176 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 50, positive: 40, positive conditional: 0, positive unconditional: 40, 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: 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: 50, positive: 40, positive conditional: 0, positive unconditional: 40, negative: 10, negative conditional: 0, negative unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 58, Positive conditional cache size: 0, Positive unconditional cache size: 58, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 21.8ms, 42 PlacesBefore, 42 PlacesAfterwards, 36 TransitionsBefore, 36 TransitionsAfterwards, 360 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 313 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 64, positive: 47, positive conditional: 0, positive unconditional: 47, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 64, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 77, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 20.8ms, 46 PlacesBefore, 46 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 380 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 261 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 66, positive: 53, positive conditional: 0, positive unconditional: 53, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 66, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 79, Positive cache size: 61, Positive conditional cache size: 0, Positive unconditional cache size: 61, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 27.1ms, 49 PlacesBefore, 49 PlacesAfterwards, 39 TransitionsBefore, 39 TransitionsAfterwards, 390 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 318 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 68, positive: 52, positive conditional: 0, positive unconditional: 52, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 68, positive: 51, positive conditional: 0, positive unconditional: 51, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 22.3ms, 52 PlacesBefore, 52 PlacesAfterwards, 40 TransitionsBefore, 40 TransitionsAfterwards, 402 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 329 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 62, positive: 45, positive conditional: 0, positive unconditional: 45, negative: 17, negative conditional: 0, negative unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 62, positive: 44, positive conditional: 0, positive unconditional: 44, negative: 16, negative conditional: 0, negative unconditional: 16, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 82, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 24.2ms, 54 PlacesBefore, 54 PlacesAfterwards, 43 TransitionsBefore, 43 TransitionsAfterwards, 414 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 415 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 116, positive: 93, positive conditional: 0, positive unconditional: 93, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 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: 116, positive: 91, positive conditional: 0, positive unconditional: 91, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 2, unknown conditional: 0, unknown unconditional: 2] , Statistics on independence cache: Total cache size (in pairs): 84, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 39.5ms, 59 PlacesBefore, 59 PlacesAfterwards, 50 TransitionsBefore, 50 TransitionsAfterwards, 454 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 260 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 48, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 48, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 1, unknown conditional: 0, unknown unconditional: 1] , Statistics on independence cache: Total cache size (in pairs): 85, Positive cache size: 66, Positive conditional cache size: 0, Positive unconditional cache size: 66, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 751.5ms, 61 PlacesBefore, 61 PlacesAfterwards, 46 TransitionsBefore, 44 TransitionsAfterwards, 492 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 1 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 363 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 139, positive: 125, positive conditional: 0, positive unconditional: 125, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 5, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 139, positive: 120, positive conditional: 0, positive unconditional: 120, negative: 14, negative conditional: 0, negative unconditional: 14, unknown: 5, unknown conditional: 0, unknown unconditional: 5] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 19.7ms, 53 PlacesBefore, 53 PlacesAfterwards, 38 TransitionsBefore, 38 TransitionsAfterwards, 324 CoEnabledTransitionPairs, 1 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 0 TotalNumberOfCompositions, 124 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 37, positive: 30, positive conditional: 0, positive unconditional: 30, 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: 37, positive: 30, positive conditional: 0, positive unconditional: 30, 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): 76, Positive cache size: 63, Positive conditional cache size: 0, Positive unconditional cache size: 63, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4409.5ms, 58 PlacesBefore, 54 PlacesAfterwards, 39 TransitionsBefore, 36 TransitionsAfterwards, 302 CoEnabledTransitionPairs, 3 FixpointIterations, 1 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 1 ConcurrentYvCompositions, 0 ChoiceCompositions, 3 TotalNumberOfCompositions, 347 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 166, positive: 145, positive conditional: 0, positive unconditional: 145, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 8, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 166, positive: 137, positive conditional: 0, positive unconditional: 137, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 8, unknown conditional: 0, unknown unconditional: 8] , Statistics on independence cache: Total cache size (in pairs): 60, Positive cache size: 53, Positive conditional cache size: 0, Positive unconditional cache size: 53, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1252.5ms, 52 PlacesBefore, 46 PlacesAfterwards, 29 TransitionsBefore, 26 TransitionsAfterwards, 128 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 6 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 6 TotalNumberOfCompositions, 41 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 41, positive: 41, positive conditional: 0, positive unconditional: 41, 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: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 6, positive: 6, positive conditional: 0, positive unconditional: 6, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 41, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 6, unknown conditional: 0, unknown unconditional: 6] , Statistics on independence cache: Total cache size (in pairs): 28, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L813] 0 pthread_t t1504; [L814] FCALL, FORK 0 pthread_create(&t1504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1505; [L816] FCALL, FORK 0 pthread_create(&t1505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1506; [L818] FCALL, FORK 0 pthread_create(&t1506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 95 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 4.9ms, RemoveRedundantFlowTime: 0.0ms, RemoveRedundantFlowUnfoldingTime: 0.0ms, BackfoldingTime: 0.0ms, BackfoldingUnfoldingTime: 0.0ms, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 20659.2ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 0.0ms, AutomataDifference: 1078.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7436.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 49 SDtfs, 21 SDslu, 17 SDs, 0 SdLazy, 253 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 296.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 416.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=380occurred in iteration=9, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 40.7ms SsaConstructionTime, 400.9ms SatisfiabilityAnalysisTime, 1041.9ms InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 1145 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...