/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:38:01,500 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:38:01,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:38:01,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:38:01,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:38:01,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:38:01,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:38:01,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:38:01,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:38:01,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:38:01,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:38:01,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:38:01,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:38:01,539 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:38:01,540 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:38:01,541 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:38:01,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:38:01,544 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:38:01,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:38:01,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:38:01,552 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:38:01,553 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:38:01,554 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:38:01,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:38:01,558 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:38:01,558 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:38:01,558 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:38:01,559 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:38:01,562 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:38:01,563 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:38:01,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:38:01,563 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:38:01,564 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:38:01,565 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:38:01,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:38:01,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:38:01,575 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:38:01,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:38:01,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:38:01,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:38:01,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:38:01,580 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-SemanticLbe.epf [2020-10-16 01:38:01,624 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:38:01,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:38:01,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:38:01,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:38:01,627 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:38:01,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:38:01,628 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:38:01,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:38:01,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:38:01,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:38:01,628 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:38:01,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:38:01,629 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:38:01,629 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:38:01,629 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:38:01,629 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:38:01,629 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:38:01,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:38:01,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:38:01,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:38:01,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:38:01,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:38:01,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:38:01,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:38:01,632 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:38:01,632 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:38:01,632 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:38:01,633 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:38:01,633 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:38:01,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:38:01,947 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:38:01,950 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:38:01,952 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:38:01,952 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:38:01,953 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2020-10-16 01:38:02,009 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4053afc6/526f334984fb4ba2973d850b4cf786d5/FLAGe503b3c7c [2020-10-16 01:38:02,499 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:38:02,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe008_power.oepc.i [2020-10-16 01:38:02,540 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4053afc6/526f334984fb4ba2973d850b4cf786d5/FLAGe503b3c7c [2020-10-16 01:38:02,819 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4053afc6/526f334984fb4ba2973d850b4cf786d5 [2020-10-16 01:38:02,828 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:38:02,830 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:38:02,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:38:02,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:38:02,834 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:38:02,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:02" (1/1) ... [2020-10-16 01:38:02,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1735efe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:02, skipping insertion in model container [2020-10-16 01:38:02,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:38:02" (1/1) ... [2020-10-16 01:38:02,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:38:02,886 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:38:03,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:38:03,403 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:38:03,469 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:38:03,541 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:38:03,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03 WrapperNode [2020-10-16 01:38:03,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:38:03,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:38:03,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:38:03,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:38:03,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,571 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:38:03,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:38:03,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:38:03,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:38:03,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,623 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (1/1) ... [2020-10-16 01:38:03,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:38:03,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:38:03,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:38:03,647 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:38:03,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (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 [2020-10-16 01:38:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:38:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:38:03,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:38:03,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:38:03,727 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:38:03,727 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:38:03,728 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:38:03,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:38:03,729 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 01:38:03,729 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 01:38:03,731 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:38:03,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:38:03,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:38:03,733 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:38:05,671 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:38:05,671 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:38:05,673 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:05 BoogieIcfgContainer [2020-10-16 01:38:05,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:38:05,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:38:05,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:38:05,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:38:05,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:38:02" (1/3) ... [2020-10-16 01:38:05,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0e8604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:05, skipping insertion in model container [2020-10-16 01:38:05,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:38:03" (2/3) ... [2020-10-16 01:38:05,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a0e8604 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:38:05, skipping insertion in model container [2020-10-16 01:38:05,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:38:05" (3/3) ... [2020-10-16 01:38:05,682 INFO L111 eAbstractionObserver]: Analyzing ICFG safe008_power.oepc.i [2020-10-16 01:38:05,693 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:38:05,700 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:38:05,701 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:38:05,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,730 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,731 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,731 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,732 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,732 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,733 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,734 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,735 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,736 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,738 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,746 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,747 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,750 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,751 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,752 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,752 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,752 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,752 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,754 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,754 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,755 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,756 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:38:05,772 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 01:38:05,793 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:38:05,793 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:38:05,793 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:38:05,793 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:38:05,794 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:38:05,794 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:38:05,794 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:38:05,794 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:38:05,807 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 01:38:05,854 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 01:38:05,854 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:05,859 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:38:05,859 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 01:38:05,866 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 90 transitions, 189 flow [2020-10-16 01:38:05,869 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:38:05,871 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 90 transitions, 189 flow [2020-10-16 01:38:05,874 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 90 transitions, 189 flow [2020-10-16 01:38:05,875 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 90 transitions, 189 flow [2020-10-16 01:38:05,944 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 01:38:05,944 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:05,945 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 01:38:05,947 INFO L117 LiptonReduction]: Number of co-enabled transitions 1650 [2020-10-16 01:38:06,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:38:06,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,292 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:06,680 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:06,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:06,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:06,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:06,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:06,783 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:38:06,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:06,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:38:06,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:06,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:38:06,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:08,326 WARN L193 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 01:38:08,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 01:38:08,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:08,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 01:38:08,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:09,431 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 142 DAG size of output: 122 [2020-10-16 01:38:09,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:38:09,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:09,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:09,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:09,624 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:09,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:09,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:09,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:09,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:09,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:09,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:09,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:09,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:09,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:09,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:09,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:09,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:09,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,060 WARN L193 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 01:38:10,165 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:38:10,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:38:10,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,510 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:10,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:10,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,700 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:38:10,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,842 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,952 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:38:10,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:38:10,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:38:10,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:10,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:38:10,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:38:11,693 WARN L193 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 01:38:11,796 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 01:38:11,805 INFO L132 LiptonReduction]: Checked pairs total: 4509 [2020-10-16 01:38:11,805 INFO L134 LiptonReduction]: Total number of compositions: 75 [2020-10-16 01:38:11,819 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 5953 [2020-10-16 01:38:11,827 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 01:38:11,828 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:11,828 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:11,829 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 01:38:11,829 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:11,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:11,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1042199, now seen corresponding path program 1 times [2020-10-16 01:38:11,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:11,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445363025] [2020-10-16 01:38:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:12,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445363025] [2020-10-16 01:38:12,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:12,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:38:12,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117401462] [2020-10-16 01:38:12,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:38:12,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:12,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:38:12,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:38:12,081 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 168 [2020-10-16 01:38:12,083 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 01:38:12,084 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:12,084 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 168 [2020-10-16 01:38:12,085 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:12,167 INFO L129 PetriNetUnfolder]: 49/134 cut-off events. [2020-10-16 01:38:12,168 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:38:12,169 INFO L80 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 134 events. 49/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 596 event pairs, 38 based on Foata normal form. 11/127 useless extension candidates. Maximal degree in co-relation 220. Up to 65 conditions per place. [2020-10-16 01:38:12,171 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 9 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2020-10-16 01:38:12,171 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 27 transitions, 85 flow [2020-10-16 01:38:12,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:38:12,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:38:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2020-10-16 01:38:12,188 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8670634920634921 [2020-10-16 01:38:12,189 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2020-10-16 01:38:12,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2020-10-16 01:38:12,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:12,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2020-10-16 01:38:12,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:38:12,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:38:12,206 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:38:12,208 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 437 transitions. [2020-10-16 01:38:12,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 27 transitions, 85 flow [2020-10-16 01:38:12,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 27 transitions, 82 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 01:38:12,213 INFO L241 Difference]: Finished difference. Result has 32 places, 23 transitions, 56 flow [2020-10-16 01:38:12,216 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, 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=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=32, PETRI_TRANSITIONS=23} [2020-10-16 01:38:12,217 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 01:38:12,217 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 23 transitions, 56 flow [2020-10-16 01:38:12,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:38:12,217 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:12,218 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:12,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:38:12,218 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1791790612, now seen corresponding path program 1 times [2020-10-16 01:38:12,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:12,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278139001] [2020-10-16 01:38:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:12,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:12,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278139001] [2020-10-16 01:38:12,410 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:12,410 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:38:12,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963033005] [2020-10-16 01:38:12,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:38:12,412 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:12,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:38:12,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:38:12,414 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 168 [2020-10-16 01:38:12,415 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 23 transitions, 56 flow. Second operand 4 states. [2020-10-16 01:38:12,415 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:12,415 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 168 [2020-10-16 01:38:12,415 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:12,568 INFO L129 PetriNetUnfolder]: 183/372 cut-off events. [2020-10-16 01:38:12,568 INFO L130 PetriNetUnfolder]: For 36/36 co-relation queries the response was YES. [2020-10-16 01:38:12,570 INFO L80 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 372 events. 183/372 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2020 event pairs, 115 based on Foata normal form. 0/353 useless extension candidates. Maximal degree in co-relation 712. Up to 213 conditions per place. [2020-10-16 01:38:12,572 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 10 selfloop transitions, 3 changer transitions 12/38 dead transitions. [2020-10-16 01:38:12,572 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 142 flow [2020-10-16 01:38:12,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:12,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2020-10-16 01:38:12,576 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7880952380952381 [2020-10-16 01:38:12,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2020-10-16 01:38:12,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2020-10-16 01:38:12,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:12,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2020-10-16 01:38:12,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:12,581 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:12,581 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:12,581 INFO L185 Difference]: Start difference. First operand has 32 places, 23 transitions, 56 flow. Second operand 5 states and 662 transitions. [2020-10-16 01:38:12,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 142 flow [2020-10-16 01:38:12,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:12,583 INFO L241 Difference]: Finished difference. Result has 37 places, 24 transitions, 77 flow [2020-10-16 01:38:12,583 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2020-10-16 01:38:12,584 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 01:38:12,584 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 77 flow [2020-10-16 01:38:12,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:38:12,584 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:12,585 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:12,585 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:38:12,585 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -289853304, now seen corresponding path program 1 times [2020-10-16 01:38:12,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:12,586 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574311259] [2020-10-16 01:38:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:12,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574311259] [2020-10-16 01:38:12,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:12,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:38:12,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849220384] [2020-10-16 01:38:12,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:38:12,698 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:12,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:38:12,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:38:12,700 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 168 [2020-10-16 01:38:12,700 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states. [2020-10-16 01:38:12,700 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:12,700 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 168 [2020-10-16 01:38:12,701 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:12,755 INFO L129 PetriNetUnfolder]: 7/52 cut-off events. [2020-10-16 01:38:12,755 INFO L130 PetriNetUnfolder]: For 17/19 co-relation queries the response was YES. [2020-10-16 01:38:12,756 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 52 events. 7/52 cut-off events. For 17/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 157 event pairs, 1 based on Foata normal form. 2/53 useless extension candidates. Maximal degree in co-relation 103. Up to 15 conditions per place. [2020-10-16 01:38:12,756 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 6 selfloop transitions, 3 changer transitions 2/27 dead transitions. [2020-10-16 01:38:12,756 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 27 transitions, 111 flow [2020-10-16 01:38:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 657 transitions. [2020-10-16 01:38:12,759 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7821428571428571 [2020-10-16 01:38:12,759 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 657 transitions. [2020-10-16 01:38:12,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 657 transitions. [2020-10-16 01:38:12,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:12,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 657 transitions. [2020-10-16 01:38:12,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:12,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:12,763 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:12,763 INFO L185 Difference]: Start difference. First operand has 37 places, 24 transitions, 77 flow. Second operand 5 states and 657 transitions. [2020-10-16 01:38:12,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 27 transitions, 111 flow [2020-10-16 01:38:12,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 102 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:12,765 INFO L241 Difference]: Finished difference. Result has 39 places, 24 transitions, 85 flow [2020-10-16 01:38:12,765 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=85, PETRI_PLACES=39, PETRI_TRANSITIONS=24} [2020-10-16 01:38:12,766 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2020-10-16 01:38:12,766 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 24 transitions, 85 flow [2020-10-16 01:38:12,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:38:12,766 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:12,766 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:12,766 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:38:12,767 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:12,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:12,767 INFO L82 PathProgramCache]: Analyzing trace with hash -289086426, now seen corresponding path program 1 times [2020-10-16 01:38:12,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:12,767 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134450304] [2020-10-16 01:38:12,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:12,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134450304] [2020-10-16 01:38:12,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:12,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:38:12,865 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636521299] [2020-10-16 01:38:12,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:38:12,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:38:12,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:38:12,867 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 168 [2020-10-16 01:38:12,867 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 24 transitions, 85 flow. Second operand 5 states. [2020-10-16 01:38:12,867 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:12,867 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 168 [2020-10-16 01:38:12,868 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:13,018 INFO L129 PetriNetUnfolder]: 149/304 cut-off events. [2020-10-16 01:38:13,019 INFO L130 PetriNetUnfolder]: For 244/250 co-relation queries the response was YES. [2020-10-16 01:38:13,020 INFO L80 FinitePrefix]: Finished finitePrefix Result has 725 conditions, 304 events. 149/304 cut-off events. For 244/250 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1534 event pairs, 93 based on Foata normal form. 18/313 useless extension candidates. Maximal degree in co-relation 710. Up to 206 conditions per place. [2020-10-16 01:38:13,023 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 11 selfloop transitions, 4 changer transitions 9/38 dead transitions. [2020-10-16 01:38:13,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 38 transitions, 179 flow [2020-10-16 01:38:13,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2020-10-16 01:38:13,027 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7547619047619047 [2020-10-16 01:38:13,027 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2020-10-16 01:38:13,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2020-10-16 01:38:13,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:13,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2020-10-16 01:38:13,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:13,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:13,031 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:13,032 INFO L185 Difference]: Start difference. First operand has 39 places, 24 transitions, 85 flow. Second operand 5 states and 634 transitions. [2020-10-16 01:38:13,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 38 transitions, 179 flow [2020-10-16 01:38:13,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 169 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:38:13,035 INFO L241 Difference]: Finished difference. Result has 40 places, 27 transitions, 115 flow [2020-10-16 01:38:13,035 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=40, PETRI_TRANSITIONS=27} [2020-10-16 01:38:13,036 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 6 predicate places. [2020-10-16 01:38:13,036 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 27 transitions, 115 flow [2020-10-16 01:38:13,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:38:13,036 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:13,036 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:13,037 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:38:13,037 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:13,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2017615678, now seen corresponding path program 1 times [2020-10-16 01:38:13,038 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:13,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856392925] [2020-10-16 01:38:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:13,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856392925] [2020-10-16 01:38:13,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:13,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:38:13,188 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331608467] [2020-10-16 01:38:13,189 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:38:13,189 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:38:13,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:38:13,191 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 01:38:13,192 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 27 transitions, 115 flow. Second operand 6 states. [2020-10-16 01:38:13,192 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:13,192 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 01:38:13,192 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:13,514 INFO L129 PetriNetUnfolder]: 225/458 cut-off events. [2020-10-16 01:38:13,514 INFO L130 PetriNetUnfolder]: For 556/559 co-relation queries the response was YES. [2020-10-16 01:38:13,516 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1230 conditions, 458 events. 225/458 cut-off events. For 556/559 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2535 event pairs, 31 based on Foata normal form. 32/482 useless extension candidates. Maximal degree in co-relation 1214. Up to 161 conditions per place. [2020-10-16 01:38:13,519 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 17 selfloop transitions, 9 changer transitions 20/59 dead transitions. [2020-10-16 01:38:13,519 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 59 transitions, 334 flow [2020-10-16 01:38:13,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:38:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:38:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1080 transitions. [2020-10-16 01:38:13,524 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7142857142857143 [2020-10-16 01:38:13,524 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1080 transitions. [2020-10-16 01:38:13,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1080 transitions. [2020-10-16 01:38:13,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:13,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1080 transitions. [2020-10-16 01:38:13,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:38:13,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:38:13,531 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:38:13,531 INFO L185 Difference]: Start difference. First operand has 40 places, 27 transitions, 115 flow. Second operand 9 states and 1080 transitions. [2020-10-16 01:38:13,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 59 transitions, 334 flow [2020-10-16 01:38:13,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 324 flow, removed 3 selfloop flow, removed 2 redundant places. [2020-10-16 01:38:13,535 INFO L241 Difference]: Finished difference. Result has 51 places, 31 transitions, 184 flow [2020-10-16 01:38:13,536 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=184, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2020-10-16 01:38:13,536 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2020-10-16 01:38:13,536 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 184 flow [2020-10-16 01:38:13,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:38:13,536 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:13,536 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:13,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:38:13,537 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:13,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash 617888698, now seen corresponding path program 1 times [2020-10-16 01:38:13,537 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:13,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782427099] [2020-10-16 01:38:13,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:13,690 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782427099] [2020-10-16 01:38:13,690 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:13,691 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:38:13,691 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967624752] [2020-10-16 01:38:13,691 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:38:13,691 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:13,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:38:13,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:38:13,693 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 168 [2020-10-16 01:38:13,694 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 31 transitions, 184 flow. Second operand 6 states. [2020-10-16 01:38:13,694 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:13,694 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 168 [2020-10-16 01:38:13,694 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:13,929 INFO L129 PetriNetUnfolder]: 189/406 cut-off events. [2020-10-16 01:38:13,929 INFO L130 PetriNetUnfolder]: For 1280/1288 co-relation queries the response was YES. [2020-10-16 01:38:13,932 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1193 conditions, 406 events. 189/406 cut-off events. For 1280/1288 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2288 event pairs, 136 based on Foata normal form. 23/393 useless extension candidates. Maximal degree in co-relation 1170. Up to 254 conditions per place. [2020-10-16 01:38:13,935 INFO L132 encePairwiseOnDemand]: 164/168 looper letters, 12 selfloop transitions, 6 changer transitions 8/42 dead transitions. [2020-10-16 01:38:13,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 286 flow [2020-10-16 01:38:13,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:13,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:13,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2020-10-16 01:38:13,938 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7130952380952381 [2020-10-16 01:38:13,938 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2020-10-16 01:38:13,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2020-10-16 01:38:13,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:13,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2020-10-16 01:38:13,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:13,942 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:13,942 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:13,942 INFO L185 Difference]: Start difference. First operand has 51 places, 31 transitions, 184 flow. Second operand 5 states and 599 transitions. [2020-10-16 01:38:13,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 286 flow [2020-10-16 01:38:13,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 42 transitions, 247 flow, removed 17 selfloop flow, removed 6 redundant places. [2020-10-16 01:38:13,952 INFO L241 Difference]: Finished difference. Result has 48 places, 31 transitions, 177 flow [2020-10-16 01:38:13,952 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2020-10-16 01:38:13,952 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2020-10-16 01:38:13,952 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 177 flow [2020-10-16 01:38:13,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:38:13,953 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:13,953 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:13,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:38:13,953 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:13,954 INFO L82 PathProgramCache]: Analyzing trace with hash -2014846908, now seen corresponding path program 1 times [2020-10-16 01:38:13,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:13,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333814063] [2020-10-16 01:38:13,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:14,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:14,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333814063] [2020-10-16 01:38:14,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:14,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:38:14,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663422314] [2020-10-16 01:38:14,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:38:14,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:14,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:38:14,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:38:14,105 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 168 [2020-10-16 01:38:14,105 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 177 flow. Second operand 7 states. [2020-10-16 01:38:14,106 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:14,106 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 168 [2020-10-16 01:38:14,106 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:14,459 INFO L129 PetriNetUnfolder]: 228/495 cut-off events. [2020-10-16 01:38:14,459 INFO L130 PetriNetUnfolder]: For 866/875 co-relation queries the response was YES. [2020-10-16 01:38:14,461 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 495 events. 228/495 cut-off events. For 866/875 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2898 event pairs, 102 based on Foata normal form. 20/494 useless extension candidates. Maximal degree in co-relation 1289. Up to 202 conditions per place. [2020-10-16 01:38:14,464 INFO L132 encePairwiseOnDemand]: 158/168 looper letters, 17 selfloop transitions, 18 changer transitions 15/66 dead transitions. [2020-10-16 01:38:14,464 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 419 flow [2020-10-16 01:38:14,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:38:14,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:38:14,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2020-10-16 01:38:14,470 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.731547619047619 [2020-10-16 01:38:14,470 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1229 transitions. [2020-10-16 01:38:14,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1229 transitions. [2020-10-16 01:38:14,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:14,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1229 transitions. [2020-10-16 01:38:14,474 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:38:14,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:38:14,477 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:38:14,477 INFO L185 Difference]: Start difference. First operand has 48 places, 31 transitions, 177 flow. Second operand 10 states and 1229 transitions. [2020-10-16 01:38:14,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 419 flow [2020-10-16 01:38:14,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 66 transitions, 379 flow, removed 14 selfloop flow, removed 5 redundant places. [2020-10-16 01:38:14,482 INFO L241 Difference]: Finished difference. Result has 57 places, 44 transitions, 267 flow [2020-10-16 01:38:14,482 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=267, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2020-10-16 01:38:14,482 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2020-10-16 01:38:14,482 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 267 flow [2020-10-16 01:38:14,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:38:14,482 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:14,483 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:14,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:38:14,483 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:14,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:14,483 INFO L82 PathProgramCache]: Analyzing trace with hash -384768720, now seen corresponding path program 2 times [2020-10-16 01:38:14,483 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:14,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090352950] [2020-10-16 01:38:14,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:14,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:14,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090352950] [2020-10-16 01:38:14,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:14,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:38:14,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310659479] [2020-10-16 01:38:14,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:38:14,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:38:14,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:38:14,553 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 168 [2020-10-16 01:38:14,554 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 267 flow. Second operand 5 states. [2020-10-16 01:38:14,554 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:14,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 168 [2020-10-16 01:38:14,555 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:14,717 INFO L129 PetriNetUnfolder]: 147/428 cut-off events. [2020-10-16 01:38:14,717 INFO L130 PetriNetUnfolder]: For 1028/1050 co-relation queries the response was YES. [2020-10-16 01:38:14,720 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 428 events. 147/428 cut-off events. For 1028/1050 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2984 event pairs, 42 based on Foata normal form. 14/415 useless extension candidates. Maximal degree in co-relation 1340. Up to 121 conditions per place. [2020-10-16 01:38:14,722 INFO L132 encePairwiseOnDemand]: 163/168 looper letters, 13 selfloop transitions, 6 changer transitions 3/50 dead transitions. [2020-10-16 01:38:14,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 354 flow [2020-10-16 01:38:14,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2020-10-16 01:38:14,725 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7785714285714286 [2020-10-16 01:38:14,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2020-10-16 01:38:14,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2020-10-16 01:38:14,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:14,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2020-10-16 01:38:14,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:14,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:14,729 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:14,729 INFO L185 Difference]: Start difference. First operand has 57 places, 44 transitions, 267 flow. Second operand 5 states and 654 transitions. [2020-10-16 01:38:14,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 354 flow [2020-10-16 01:38:14,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 50 transitions, 348 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:38:14,734 INFO L241 Difference]: Finished difference. Result has 56 places, 43 transitions, 274 flow [2020-10-16 01:38:14,735 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=56, PETRI_TRANSITIONS=43} [2020-10-16 01:38:14,735 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2020-10-16 01:38:14,735 INFO L481 AbstractCegarLoop]: Abstraction has has 56 places, 43 transitions, 274 flow [2020-10-16 01:38:14,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:38:14,735 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:14,735 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:14,735 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:38:14,736 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:14,736 INFO L82 PathProgramCache]: Analyzing trace with hash 2105493556, now seen corresponding path program 3 times [2020-10-16 01:38:14,736 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:14,736 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812319794] [2020-10-16 01:38:14,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:14,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:14,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812319794] [2020-10-16 01:38:14,850 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:14,850 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:38:14,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667218260] [2020-10-16 01:38:14,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:38:14,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:14,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:38:14,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:38:14,852 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 168 [2020-10-16 01:38:14,853 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 43 transitions, 274 flow. Second operand 6 states. [2020-10-16 01:38:14,853 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:14,853 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 168 [2020-10-16 01:38:14,853 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:15,165 INFO L129 PetriNetUnfolder]: 231/501 cut-off events. [2020-10-16 01:38:15,165 INFO L130 PetriNetUnfolder]: For 1749/1962 co-relation queries the response was YES. [2020-10-16 01:38:15,168 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1837 conditions, 501 events. 231/501 cut-off events. For 1749/1962 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 2993 event pairs, 78 based on Foata normal form. 83/561 useless extension candidates. Maximal degree in co-relation 1810. Up to 160 conditions per place. [2020-10-16 01:38:15,169 INFO L132 encePairwiseOnDemand]: 159/168 looper letters, 10 selfloop transitions, 6 changer transitions 42/71 dead transitions. [2020-10-16 01:38:15,169 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 71 transitions, 575 flow [2020-10-16 01:38:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:38:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:38:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1188 transitions. [2020-10-16 01:38:15,174 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2020-10-16 01:38:15,174 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1188 transitions. [2020-10-16 01:38:15,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1188 transitions. [2020-10-16 01:38:15,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:15,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1188 transitions. [2020-10-16 01:38:15,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:38:15,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:38:15,181 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:38:15,181 INFO L185 Difference]: Start difference. First operand has 56 places, 43 transitions, 274 flow. Second operand 10 states and 1188 transitions. [2020-10-16 01:38:15,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 71 transitions, 575 flow [2020-10-16 01:38:15,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 71 transitions, 560 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:38:15,188 INFO L241 Difference]: Finished difference. Result has 68 places, 25 transitions, 190 flow [2020-10-16 01:38:15,188 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=190, PETRI_PLACES=68, PETRI_TRANSITIONS=25} [2020-10-16 01:38:15,188 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2020-10-16 01:38:15,189 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 25 transitions, 190 flow [2020-10-16 01:38:15,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:38:15,189 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:15,189 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:15,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:38:15,189 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1491978633, now seen corresponding path program 1 times [2020-10-16 01:38:15,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:15,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608722878] [2020-10-16 01:38:15,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:15,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:15,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608722878] [2020-10-16 01:38:15,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:15,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:38:15,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099666806] [2020-10-16 01:38:15,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:38:15,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:15,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:38:15,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:38:15,271 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 168 [2020-10-16 01:38:15,272 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 25 transitions, 190 flow. Second operand 5 states. [2020-10-16 01:38:15,272 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:15,272 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 168 [2020-10-16 01:38:15,272 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:15,429 INFO L129 PetriNetUnfolder]: 113/249 cut-off events. [2020-10-16 01:38:15,429 INFO L130 PetriNetUnfolder]: For 2543/2608 co-relation queries the response was YES. [2020-10-16 01:38:15,431 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1176 conditions, 249 events. 113/249 cut-off events. For 2543/2608 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1114 event pairs, 47 based on Foata normal form. 21/261 useless extension candidates. Maximal degree in co-relation 1143. Up to 173 conditions per place. [2020-10-16 01:38:15,432 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 9 selfloop transitions, 6 changer transitions 9/39 dead transitions. [2020-10-16 01:38:15,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 39 transitions, 352 flow [2020-10-16 01:38:15,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:38:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:38:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2020-10-16 01:38:15,436 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7440476190476191 [2020-10-16 01:38:15,436 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2020-10-16 01:38:15,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2020-10-16 01:38:15,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:15,437 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2020-10-16 01:38:15,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:38:15,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:38:15,441 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:38:15,441 INFO L185 Difference]: Start difference. First operand has 68 places, 25 transitions, 190 flow. Second operand 6 states and 750 transitions. [2020-10-16 01:38:15,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 39 transitions, 352 flow [2020-10-16 01:38:15,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 39 transitions, 268 flow, removed 25 selfloop flow, removed 20 redundant places. [2020-10-16 01:38:15,445 INFO L241 Difference]: Finished difference. Result has 50 places, 28 transitions, 178 flow [2020-10-16 01:38:15,446 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2020-10-16 01:38:15,446 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2020-10-16 01:38:15,446 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 178 flow [2020-10-16 01:38:15,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:38:15,446 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:15,446 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:15,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:38:15,447 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1792737123, now seen corresponding path program 1 times [2020-10-16 01:38:15,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:15,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111331202] [2020-10-16 01:38:15,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:15,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111331202] [2020-10-16 01:38:15,511 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:15,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:38:15,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741119170] [2020-10-16 01:38:15,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:38:15,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:15,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:38:15,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:38:15,513 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 168 [2020-10-16 01:38:15,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 28 transitions, 178 flow. Second operand 4 states. [2020-10-16 01:38:15,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:15,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 168 [2020-10-16 01:38:15,514 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:15,592 INFO L129 PetriNetUnfolder]: 172/384 cut-off events. [2020-10-16 01:38:15,592 INFO L130 PetriNetUnfolder]: For 1284/1322 co-relation queries the response was YES. [2020-10-16 01:38:15,594 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 384 events. 172/384 cut-off events. For 1284/1322 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 2151 event pairs, 76 based on Foata normal form. 40/393 useless extension candidates. Maximal degree in co-relation 1345. Up to 177 conditions per place. [2020-10-16 01:38:15,597 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 8 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2020-10-16 01:38:15,597 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 38 transitions, 230 flow [2020-10-16 01:38:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:38:15,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:38:15,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2020-10-16 01:38:15,599 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8130952380952381 [2020-10-16 01:38:15,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2020-10-16 01:38:15,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2020-10-16 01:38:15,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:15,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2020-10-16 01:38:15,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:38:15,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:38:15,604 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:38:15,604 INFO L185 Difference]: Start difference. First operand has 50 places, 28 transitions, 178 flow. Second operand 5 states and 683 transitions. [2020-10-16 01:38:15,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 38 transitions, 230 flow [2020-10-16 01:38:15,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 203 flow, removed 9 selfloop flow, removed 5 redundant places. [2020-10-16 01:38:15,608 INFO L241 Difference]: Finished difference. Result has 50 places, 35 transitions, 211 flow [2020-10-16 01:38:15,608 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=211, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2020-10-16 01:38:15,608 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2020-10-16 01:38:15,608 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 211 flow [2020-10-16 01:38:15,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:38:15,609 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:15,609 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:15,609 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:38:15,609 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:15,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:15,609 INFO L82 PathProgramCache]: Analyzing trace with hash -442731757, now seen corresponding path program 1 times [2020-10-16 01:38:15,610 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:15,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021190070] [2020-10-16 01:38:15,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:15,677 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021190070] [2020-10-16 01:38:15,677 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:15,677 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:38:15,677 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725956936] [2020-10-16 01:38:15,678 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:38:15,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:15,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:38:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:38:15,679 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 168 [2020-10-16 01:38:15,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 211 flow. Second operand 5 states. [2020-10-16 01:38:15,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:15,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 168 [2020-10-16 01:38:15,680 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:15,772 INFO L129 PetriNetUnfolder]: 90/264 cut-off events. [2020-10-16 01:38:15,772 INFO L130 PetriNetUnfolder]: For 721/1035 co-relation queries the response was YES. [2020-10-16 01:38:15,774 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 264 events. 90/264 cut-off events. For 721/1035 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1477 event pairs, 15 based on Foata normal form. 132/380 useless extension candidates. Maximal degree in co-relation 1068. Up to 151 conditions per place. [2020-10-16 01:38:15,775 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 5 selfloop transitions, 15 changer transitions 3/45 dead transitions. [2020-10-16 01:38:15,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 45 transitions, 315 flow [2020-10-16 01:38:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:38:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:38:15,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 956 transitions. [2020-10-16 01:38:15,779 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8129251700680272 [2020-10-16 01:38:15,779 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 956 transitions. [2020-10-16 01:38:15,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 956 transitions. [2020-10-16 01:38:15,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:15,780 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 956 transitions. [2020-10-16 01:38:15,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:38:15,784 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:38:15,784 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:38:15,784 INFO L185 Difference]: Start difference. First operand has 50 places, 35 transitions, 211 flow. Second operand 7 states and 956 transitions. [2020-10-16 01:38:15,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 45 transitions, 315 flow [2020-10-16 01:38:15,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 45 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 01:38:15,788 INFO L241 Difference]: Finished difference. Result has 58 places, 42 transitions, 306 flow [2020-10-16 01:38:15,788 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2020-10-16 01:38:15,788 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2020-10-16 01:38:15,788 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 306 flow [2020-10-16 01:38:15,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:38:15,789 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:15,789 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:15,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:38:15,789 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:15,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:15,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1298593170, now seen corresponding path program 1 times [2020-10-16 01:38:15,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:15,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436936047] [2020-10-16 01:38:15,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:15,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436936047] [2020-10-16 01:38:15,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:15,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:38:15,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488248478] [2020-10-16 01:38:15,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:38:15,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:15,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:38:15,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:38:15,879 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 168 [2020-10-16 01:38:15,881 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 306 flow. Second operand 6 states. [2020-10-16 01:38:15,881 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:15,881 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 168 [2020-10-16 01:38:15,881 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:16,058 INFO L129 PetriNetUnfolder]: 64/211 cut-off events. [2020-10-16 01:38:16,058 INFO L130 PetriNetUnfolder]: For 1005/1395 co-relation queries the response was YES. [2020-10-16 01:38:16,060 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 211 events. 64/211 cut-off events. For 1005/1395 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 1188 event pairs, 5 based on Foata normal form. 142/338 useless extension candidates. Maximal degree in co-relation 1045. Up to 132 conditions per place. [2020-10-16 01:38:16,061 INFO L132 encePairwiseOnDemand]: 162/168 looper letters, 2 selfloop transitions, 19 changer transitions 3/46 dead transitions. [2020-10-16 01:38:16,061 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 46 transitions, 384 flow [2020-10-16 01:38:16,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:38:16,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:38:16,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1223 transitions. [2020-10-16 01:38:16,067 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8088624338624338 [2020-10-16 01:38:16,067 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1223 transitions. [2020-10-16 01:38:16,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1223 transitions. [2020-10-16 01:38:16,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:16,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1223 transitions. [2020-10-16 01:38:16,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:38:16,076 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:38:16,076 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:38:16,076 INFO L185 Difference]: Start difference. First operand has 58 places, 42 transitions, 306 flow. Second operand 9 states and 1223 transitions. [2020-10-16 01:38:16,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 46 transitions, 384 flow [2020-10-16 01:38:16,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 46 transitions, 328 flow, removed 21 selfloop flow, removed 4 redundant places. [2020-10-16 01:38:16,081 INFO L241 Difference]: Finished difference. Result has 65 places, 43 transitions, 311 flow [2020-10-16 01:38:16,081 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=43} [2020-10-16 01:38:16,081 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2020-10-16 01:38:16,081 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 43 transitions, 311 flow [2020-10-16 01:38:16,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:38:16,082 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:16,082 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:16,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:38:16,082 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:16,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:16,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1460215227, now seen corresponding path program 1 times [2020-10-16 01:38:16,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:16,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263513093] [2020-10-16 01:38:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:38:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:38:16,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263513093] [2020-10-16 01:38:16,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:38:16,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:38:16,255 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443996557] [2020-10-16 01:38:16,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:38:16,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:38:16,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:38:16,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:38:16,257 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 168 [2020-10-16 01:38:16,258 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 43 transitions, 311 flow. Second operand 8 states. [2020-10-16 01:38:16,258 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:38:16,258 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 168 [2020-10-16 01:38:16,258 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:38:16,544 INFO L129 PetriNetUnfolder]: 81/278 cut-off events. [2020-10-16 01:38:16,545 INFO L130 PetriNetUnfolder]: For 1229/1422 co-relation queries the response was YES. [2020-10-16 01:38:16,546 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1259 conditions, 278 events. 81/278 cut-off events. For 1229/1422 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 1801 event pairs, 0 based on Foata normal form. 31/288 useless extension candidates. Maximal degree in co-relation 1231. Up to 90 conditions per place. [2020-10-16 01:38:16,547 INFO L132 encePairwiseOnDemand]: 161/168 looper letters, 8 selfloop transitions, 7 changer transitions 7/50 dead transitions. [2020-10-16 01:38:16,548 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 50 transitions, 423 flow [2020-10-16 01:38:16,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:38:16,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:38:16,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 815 transitions. [2020-10-16 01:38:16,551 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6930272108843537 [2020-10-16 01:38:16,551 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 815 transitions. [2020-10-16 01:38:16,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 815 transitions. [2020-10-16 01:38:16,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:38:16,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 815 transitions. [2020-10-16 01:38:16,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:38:16,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:38:16,559 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:38:16,559 INFO L185 Difference]: Start difference. First operand has 65 places, 43 transitions, 311 flow. Second operand 7 states and 815 transitions. [2020-10-16 01:38:16,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 50 transitions, 423 flow [2020-10-16 01:38:16,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 50 transitions, 325 flow, removed 32 selfloop flow, removed 11 redundant places. [2020-10-16 01:38:16,569 INFO L241 Difference]: Finished difference. Result has 62 places, 41 transitions, 253 flow [2020-10-16 01:38:16,570 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=253, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2020-10-16 01:38:16,570 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2020-10-16 01:38:16,570 INFO L481 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 253 flow [2020-10-16 01:38:16,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:38:16,571 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:38:16,571 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:38:16,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:38:16,571 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:38:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:38:16,572 INFO L82 PathProgramCache]: Analyzing trace with hash -699601605, now seen corresponding path program 2 times [2020-10-16 01:38:16,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:38:16,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400417792] [2020-10-16 01:38:16,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:38:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:38:16,616 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:38:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 01:38:16,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 01:38:16,700 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 01:38:16,700 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 01:38:16,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:38:16,724 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,726 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,727 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,728 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,729 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,729 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,730 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,730 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,731 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,731 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,732 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,733 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,733 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,734 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,735 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,736 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,737 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,738 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,738 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,739 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,739 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,740 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,740 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,741 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 01:38:16,741 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 01:38:16,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:38:16 BasicIcfg [2020-10-16 01:38:16,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:38:16,815 INFO L168 Benchmark]: Toolchain (without parser) took 13984.18 ms. Allocated memory was 252.2 MB in the beginning and 568.9 MB in the end (delta: 316.7 MB). Free memory was 208.0 MB in the beginning and 394.5 MB in the end (delta: -186.5 MB). Peak memory consumption was 130.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:16,815 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:38:16,818 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.51 ms. Allocated memory was 252.2 MB in the beginning and 317.2 MB in the end (delta: 65.0 MB). Free memory was 208.0 MB in the beginning and 267.4 MB in the end (delta: -59.4 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:16,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.19 ms. Allocated memory is still 317.2 MB. Free memory was 267.4 MB in the beginning and 264.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:16,820 INFO L168 Benchmark]: Boogie Preprocessor took 39.69 ms. Allocated memory is still 317.2 MB. Free memory was 264.9 MB in the beginning and 262.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:16,822 INFO L168 Benchmark]: RCFGBuilder took 2027.40 ms. Allocated memory was 317.2 MB in the beginning and 359.7 MB in the end (delta: 42.5 MB). Free memory was 262.4 MB in the beginning and 185.7 MB in the end (delta: 76.6 MB). Peak memory consumption was 119.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:38:16,823 INFO L168 Benchmark]: TraceAbstraction took 11137.41 ms. Allocated memory was 359.7 MB in the beginning and 568.9 MB in the end (delta: 209.2 MB). Free memory was 185.7 MB in the beginning and 394.5 MB in the end (delta: -208.7 MB). Peak memory consumption was 469.2 kB. Max. memory is 14.2 GB. [2020-10-16 01:38:16,834 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 711.51 ms. Allocated memory was 252.2 MB in the beginning and 317.2 MB in the end (delta: 65.0 MB). Free memory was 208.0 MB in the beginning and 267.4 MB in the end (delta: -59.4 MB). Peak memory consumption was 33.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 63.19 ms. Allocated memory is still 317.2 MB. Free memory was 267.4 MB in the beginning and 264.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.69 ms. Allocated memory is still 317.2 MB. Free memory was 264.9 MB in the beginning and 262.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2027.40 ms. Allocated memory was 317.2 MB in the beginning and 359.7 MB in the end (delta: 42.5 MB). Free memory was 262.4 MB in the beginning and 185.7 MB in the end (delta: 76.6 MB). Peak memory consumption was 119.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 11137.41 ms. Allocated memory was 359.7 MB in the beginning and 568.9 MB in the end (delta: 209.2 MB). Free memory was 185.7 MB in the beginning and 394.5 MB in the end (delta: -208.7 MB). Peak memory consumption was 469.2 kB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1054 VarBasedMoverChecksPositive, 63 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 122 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.9s, 98 PlacesBefore, 34 PlacesAfterwards, 90 TransitionsBefore, 25 TransitionsAfterwards, 1650 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 4509 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L708] 0 int y = 0; [L710] 0 int z = 0; [L711] 0 _Bool z$flush_delayed; [L712] 0 int z$mem_tmp; [L713] 0 _Bool z$r_buff0_thd0; [L714] 0 _Bool z$r_buff0_thd1; [L715] 0 _Bool z$r_buff0_thd2; [L716] 0 _Bool z$r_buff0_thd3; [L717] 0 _Bool z$r_buff1_thd0; [L718] 0 _Bool z$r_buff1_thd1; [L719] 0 _Bool z$r_buff1_thd2; [L720] 0 _Bool z$r_buff1_thd3; [L721] 0 _Bool z$read_delayed; [L722] 0 int *z$read_delayed_var; [L723] 0 int z$w_buff0; [L724] 0 _Bool z$w_buff0_used; [L725] 0 int z$w_buff1; [L726] 0 _Bool z$w_buff1_used; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t1961; [L810] FCALL, FORK 0 pthread_create(&t1961, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L811] 0 pthread_t t1962; [L812] FCALL, FORK 0 pthread_create(&t1962, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$w_buff1 = z$w_buff0 [L733] 1 z$w_buff0 = 2 [L734] 1 z$w_buff1_used = z$w_buff0_used [L735] 1 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L737] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L738] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L739] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L740] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L741] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L761] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L767] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L767] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L768] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L769] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L770] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L770] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L771] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L771] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L813] 0 pthread_t t1963; [L814] FCALL, FORK 0 pthread_create(&t1963, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, 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=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L749] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L749] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L750] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L751] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L787] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L788] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L789] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L790] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L820] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L821] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L822] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L822] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L823] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L823] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L824] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 z$flush_delayed = weak$$choice2 [L830] 0 z$mem_tmp = z [L831] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L831] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L832] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L832] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L832] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L833] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L833] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L834] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L834] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L836] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L839] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L839] 0 z = z$flush_delayed ? z$mem_tmp : z [L840] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=255, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 10.9s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 84 SDtfs, 81 SDslu, 96 SDs, 0 SdLazy, 550 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=311occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 213 NumberOfCodeBlocks, 213 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 22762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...