/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-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:52:55,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:52:55,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:52:55,402 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:52:55,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:52:55,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:52:55,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:52:55,407 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:52:55,409 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:52:55,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:52:55,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:52:55,412 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:52:55,412 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:52:55,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:52:55,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:52:55,415 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:52:55,416 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:52:55,417 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:52:55,418 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:52:55,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:52:55,422 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:52:55,423 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:52:55,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:52:55,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:52:55,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:52:55,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:52:55,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:52:55,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:52:55,429 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:52:55,430 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:52:55,430 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:52:55,431 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:52:55,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:52:55,432 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:52:55,433 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:52:55,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:52:55,434 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:52:55,435 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:52:55,435 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:52:55,436 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:52:55,436 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:52:55,437 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-SemanticLooper.epf [2020-10-16 04:52:55,476 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:52:55,476 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:52:55,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:52:55,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:52:55,481 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:52:55,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:52:55,481 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:52:55,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:52:55,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:52:55,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:52:55,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:52:55,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:52:55,484 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:52:55,484 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:52:55,484 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:52:55,484 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:52:55,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:52:55,485 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:52:55,485 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:52:55,487 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:52:55,487 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:52:55,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:52:55,488 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:52:55,488 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:52:55,488 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:52:55,488 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:52:55,488 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:52:55,489 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:52:55,489 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:52:55,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:52:55,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:52:55,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:52:55,851 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:52:55,852 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:52:55,852 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-10-16 04:52:55,916 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cfd87bd7/c3c575578f4b4f3b9cb73041bebad8bb/FLAG2b6e66647 [2020-10-16 04:52:56,481 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:52:56,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix047_rmo.opt.i [2020-10-16 04:52:56,503 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cfd87bd7/c3c575578f4b4f3b9cb73041bebad8bb/FLAG2b6e66647 [2020-10-16 04:52:56,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cfd87bd7/c3c575578f4b4f3b9cb73041bebad8bb [2020-10-16 04:52:56,701 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:52:56,703 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:52:56,706 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:52:56,706 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:52:56,710 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:52:56,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:52:56" (1/1) ... [2020-10-16 04:52:56,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c492c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:56, skipping insertion in model container [2020-10-16 04:52:56,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:52:56" (1/1) ... [2020-10-16 04:52:56,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:52:56,793 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:52:57,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:52:57,340 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:52:57,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:52:57,486 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:52:57,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57 WrapperNode [2020-10-16 04:52:57,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:52:57,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:52:57,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:52:57,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:52:57,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,518 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,562 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:52:57,563 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:52:57,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:52:57,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:52:57,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,574 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,579 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,590 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (1/1) ... [2020-10-16 04:52:57,605 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:52:57,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:52:57,606 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:52:57,606 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:52:57,607 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (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 04:52:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:52:57,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:52:57,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:52:57,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:52:57,677 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:52:57,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:52:57,677 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:52:57,677 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:52:57,678 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:52:57,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:52:57,678 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-16 04:52:57,678 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-16 04:52:57,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:52:57,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:52:57,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:52:57,681 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 04:52:59,749 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:52:59,750 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:52:59,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:52:59 BoogieIcfgContainer [2020-10-16 04:52:59,752 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:52:59,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:52:59,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:52:59,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:52:59,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:52:56" (1/3) ... [2020-10-16 04:52:59,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc5ac95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:52:59, skipping insertion in model container [2020-10-16 04:52:59,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:52:57" (2/3) ... [2020-10-16 04:52:59,759 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fc5ac95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:52:59, skipping insertion in model container [2020-10-16 04:52:59,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:52:59" (3/3) ... [2020-10-16 04:52:59,761 INFO L111 eAbstractionObserver]: Analyzing ICFG mix047_rmo.opt.i [2020-10-16 04:52:59,774 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:52:59,782 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:52:59,783 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:52:59,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,817 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,817 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,818 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,818 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,819 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,819 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,820 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,821 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,822 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,822 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,822 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,823 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,823 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,823 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,824 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,825 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,829 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,830 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,830 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,835 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,836 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,836 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,836 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,841 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,842 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,842 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,843 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,844 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,844 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,845 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,846 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,846 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:52:59,864 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:52:59,886 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:52:59,886 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:52:59,886 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:52:59,886 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:52:59,886 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:52:59,886 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:52:59,887 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:52:59,887 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:52:59,902 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 04:52:59,957 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 04:52:59,957 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:52:59,963 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:52:59,963 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 111 transitions, 242 flow [2020-10-16 04:52:59,971 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 107 transitions, 226 flow [2020-10-16 04:52:59,974 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:52:59,977 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 226 flow [2020-10-16 04:52:59,980 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 226 flow [2020-10-16 04:52:59,981 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 226 flow [2020-10-16 04:53:00,012 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-16 04:53:00,012 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:00,013 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 77 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-16 04:53:00,018 INFO L117 LiptonReduction]: Number of co-enabled transitions 2540 [2020-10-16 04:53:00,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 04:53:00,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,312 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:00,315 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:00,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:00,323 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:53:00,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:53:00,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:53:00,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:53:00,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:00,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:00,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:00,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:00,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:00,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:00,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:00,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:00,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:00,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:00,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:00,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:00,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:53:00,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:00,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:00,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:53:00,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:53:00,948 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:53:00,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:00,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:00,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:00,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:00,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:01,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,003 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:01,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:01,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:01,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:01,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:01,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:01,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:53:01,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:53:01,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:53:01,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:01,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:01,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:01,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:01,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:01,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:01,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 5, 1] term [2020-10-16 04:53:01,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:01,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:01,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:01,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,421 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-16 04:53:01,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:01,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:01,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:01,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:01,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:01,895 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:53:02,237 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:53:02,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:53:02,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:02,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-10-16 04:53:02,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:53:02,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:53:02,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-16 04:53:02,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,361 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:53:02,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:02,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:02,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:02,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:02,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:02,511 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:02,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:02,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:02,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:02,519 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:53:02,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:53:02,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:53:02,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:53:02,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:53:02,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:02,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:02,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:02,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-10-16 04:53:02,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 04:53:02,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:53:02,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:53:02,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:02,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:02,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:02,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:02,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:03,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:03,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:03,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:03,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-10-16 04:53:03,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:53:03,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 6, 5, 5, 3, 3, 2, 1] term [2020-10-16 04:53:03,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:53:03,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-10-16 04:53:03,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:03,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:03,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:03,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:03,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:03,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:03,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:03,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:03,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:03,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:03,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 1] term [2020-10-16 04:53:03,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-10-16 04:53:03,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:53:03,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:53:03,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:53:04,156 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-16 04:53:04,511 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2020-10-16 04:53:04,620 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-16 04:53:04,629 INFO L132 LiptonReduction]: Checked pairs total: 6794 [2020-10-16 04:53:04,629 INFO L134 LiptonReduction]: Total number of compositions: 88 [2020-10-16 04:53:04,632 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4660 [2020-10-16 04:53:04,643 INFO L129 PetriNetUnfolder]: 0/19 cut-off events. [2020-10-16 04:53:04,643 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:04,644 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:04,645 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:04,645 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:04,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:04,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1430044184, now seen corresponding path program 1 times [2020-10-16 04:53:04,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:04,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172855648] [2020-10-16 04:53:04,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:04,932 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 04:53:04,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172855648] [2020-10-16 04:53:04,933 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:04,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:53:04,934 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331280639] [2020-10-16 04:53:04,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:53:04,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:04,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:53:04,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:53:04,962 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 199 [2020-10-16 04:53:04,966 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states. [2020-10-16 04:53:04,966 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:04,966 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 199 [2020-10-16 04:53:04,968 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:05,038 INFO L129 PetriNetUnfolder]: 16/70 cut-off events. [2020-10-16 04:53:05,038 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:05,039 INFO L80 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 70 events. 16/70 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 213 event pairs, 6 based on Foata normal form. 6/67 useless extension candidates. Maximal degree in co-relation 107. Up to 27 conditions per place. [2020-10-16 04:53:05,041 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 7 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 04:53:05,041 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 31 transitions, 92 flow [2020-10-16 04:53:05,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:53:05,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:53:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2020-10-16 04:53:05,060 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8793969849246231 [2020-10-16 04:53:05,061 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2020-10-16 04:53:05,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2020-10-16 04:53:05,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:05,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2020-10-16 04:53:05,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:53:05,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:53:05,080 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:53:05,083 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 72 flow. Second operand 3 states and 525 transitions. [2020-10-16 04:53:05,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 31 transitions, 92 flow [2020-10-16 04:53:05,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 88 flow, removed 0 selfloop flow, removed 4 redundant places. [2020-10-16 04:53:05,089 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 68 flow [2020-10-16 04:53:05,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 04:53:05,093 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2020-10-16 04:53:05,093 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 68 flow [2020-10-16 04:53:05,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:53:05,093 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:05,093 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:05,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:53:05,094 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash 667622400, now seen corresponding path program 1 times [2020-10-16 04:53:05,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:05,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727462154] [2020-10-16 04:53:05,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:05,318 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 04:53:05,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727462154] [2020-10-16 04:53:05,319 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:05,319 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:53:05,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062049414] [2020-10-16 04:53:05,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:05,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:05,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:05,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:05,323 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:53:05,324 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 68 flow. Second operand 4 states. [2020-10-16 04:53:05,324 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:05,324 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:53:05,324 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:05,389 INFO L129 PetriNetUnfolder]: 12/71 cut-off events. [2020-10-16 04:53:05,389 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:53:05,390 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 71 events. 12/71 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 226 event pairs, 3 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 108. Up to 20 conditions per place. [2020-10-16 04:53:05,390 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 4 selfloop transitions, 3 changer transitions 8/37 dead transitions. [2020-10-16 04:53:05,391 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 116 flow [2020-10-16 04:53:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:53:05,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:53:05,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 857 transitions. [2020-10-16 04:53:05,394 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8613065326633166 [2020-10-16 04:53:05,394 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 857 transitions. [2020-10-16 04:53:05,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 857 transitions. [2020-10-16 04:53:05,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:05,395 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 857 transitions. [2020-10-16 04:53:05,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:53:05,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:53:05,400 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:53:05,400 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 68 flow. Second operand 5 states and 857 transitions. [2020-10-16 04:53:05,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 116 flow [2020-10-16 04:53:05,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:53:05,402 INFO L241 Difference]: Finished difference. Result has 44 places, 29 transitions, 89 flow [2020-10-16 04:53:05,402 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2020-10-16 04:53:05,403 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2020-10-16 04:53:05,403 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 89 flow [2020-10-16 04:53:05,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:05,404 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:05,404 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:05,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:53:05,404 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:05,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:05,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1745373452, now seen corresponding path program 1 times [2020-10-16 04:53:05,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:05,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407967753] [2020-10-16 04:53:05,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:05,500 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 04:53:05,501 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407967753] [2020-10-16 04:53:05,501 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:05,501 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:53:05,501 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682561907] [2020-10-16 04:53:05,502 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:05,502 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:05,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:05,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:05,505 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 199 [2020-10-16 04:53:05,506 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 89 flow. Second operand 4 states. [2020-10-16 04:53:05,506 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:05,506 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 199 [2020-10-16 04:53:05,506 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:05,561 INFO L129 PetriNetUnfolder]: 7/59 cut-off events. [2020-10-16 04:53:05,561 INFO L130 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2020-10-16 04:53:05,562 INFO L80 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 59 events. 7/59 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 169 event pairs, 3 based on Foata normal form. 5/60 useless extension candidates. Maximal degree in co-relation 107. Up to 17 conditions per place. [2020-10-16 04:53:05,563 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 2 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2020-10-16 04:53:05,563 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 31 transitions, 107 flow [2020-10-16 04:53:05,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:53:05,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:53:05,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 838 transitions. [2020-10-16 04:53:05,567 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.842211055276382 [2020-10-16 04:53:05,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 838 transitions. [2020-10-16 04:53:05,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 838 transitions. [2020-10-16 04:53:05,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:05,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 838 transitions. [2020-10-16 04:53:05,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:53:05,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:53:05,574 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:53:05,574 INFO L185 Difference]: Start difference. First operand has 44 places, 29 transitions, 89 flow. Second operand 5 states and 838 transitions. [2020-10-16 04:53:05,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 31 transitions, 107 flow [2020-10-16 04:53:05,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 31 transitions, 102 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:53:05,577 INFO L241 Difference]: Finished difference. Result has 46 places, 29 transitions, 96 flow [2020-10-16 04:53:05,577 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=29} [2020-10-16 04:53:05,577 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2020-10-16 04:53:05,578 INFO L481 AbstractCegarLoop]: Abstraction has has 46 places, 29 transitions, 96 flow [2020-10-16 04:53:05,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:05,578 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:05,578 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:05,578 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:53:05,579 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash -739666052, now seen corresponding path program 1 times [2020-10-16 04:53:05,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:05,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115341318] [2020-10-16 04:53:05,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:05,661 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 04:53:05,662 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115341318] [2020-10-16 04:53:05,662 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:05,663 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:53:05,663 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142982863] [2020-10-16 04:53:05,663 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:05,664 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:05,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:05,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:05,666 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:53:05,667 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 29 transitions, 96 flow. Second operand 4 states. [2020-10-16 04:53:05,667 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:05,667 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:53:05,667 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:05,719 INFO L129 PetriNetUnfolder]: 19/83 cut-off events. [2020-10-16 04:53:05,719 INFO L130 PetriNetUnfolder]: For 100/109 co-relation queries the response was YES. [2020-10-16 04:53:05,720 INFO L80 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 83 events. 19/83 cut-off events. For 100/109 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 295 event pairs, 6 based on Foata normal form. 5/82 useless extension candidates. Maximal degree in co-relation 185. Up to 26 conditions per place. [2020-10-16 04:53:05,721 INFO L132 encePairwiseOnDemand]: 194/199 looper letters, 4 selfloop transitions, 3 changer transitions 5/36 dead transitions. [2020-10-16 04:53:05,722 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 36 transitions, 138 flow [2020-10-16 04:53:05,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:53:05,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:53:05,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 854 transitions. [2020-10-16 04:53:05,725 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8582914572864322 [2020-10-16 04:53:05,725 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 854 transitions. [2020-10-16 04:53:05,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 854 transitions. [2020-10-16 04:53:05,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:05,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 854 transitions. [2020-10-16 04:53:05,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:53:05,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:53:05,730 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:53:05,730 INFO L185 Difference]: Start difference. First operand has 46 places, 29 transitions, 96 flow. Second operand 5 states and 854 transitions. [2020-10-16 04:53:05,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 36 transitions, 138 flow [2020-10-16 04:53:05,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 36 transitions, 130 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:53:05,733 INFO L241 Difference]: Finished difference. Result has 47 places, 31 transitions, 115 flow [2020-10-16 04:53:05,733 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=115, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2020-10-16 04:53:05,733 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places. [2020-10-16 04:53:05,734 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 115 flow [2020-10-16 04:53:05,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:05,734 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:05,734 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:05,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:53:05,734 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:05,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1875187583, now seen corresponding path program 1 times [2020-10-16 04:53:05,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:05,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851660288] [2020-10-16 04:53:05,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:05,814 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 04:53:05,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851660288] [2020-10-16 04:53:05,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:05,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:53:05,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123767978] [2020-10-16 04:53:05,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:05,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:05,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:05,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:05,818 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:53:05,818 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 115 flow. Second operand 4 states. [2020-10-16 04:53:05,818 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:05,819 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:53:05,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:05,873 INFO L129 PetriNetUnfolder]: 11/81 cut-off events. [2020-10-16 04:53:05,873 INFO L130 PetriNetUnfolder]: For 118/169 co-relation queries the response was YES. [2020-10-16 04:53:05,874 INFO L80 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 81 events. 11/81 cut-off events. For 118/169 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 324 event pairs, 2 based on Foata normal form. 6/81 useless extension candidates. Maximal degree in co-relation 210. Up to 23 conditions per place. [2020-10-16 04:53:05,875 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 5 selfloop transitions, 3 changer transitions 2/34 dead transitions. [2020-10-16 04:53:05,875 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 157 flow [2020-10-16 04:53:05,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:53:05,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:53:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 04:53:05,878 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8552763819095477 [2020-10-16 04:53:05,878 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 04:53:05,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 04:53:05,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:05,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 04:53:05,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:53:05,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:53:05,883 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:53:05,883 INFO L185 Difference]: Start difference. First operand has 47 places, 31 transitions, 115 flow. Second operand 5 states and 851 transitions. [2020-10-16 04:53:05,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 157 flow [2020-10-16 04:53:05,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 146 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 04:53:05,886 INFO L241 Difference]: Finished difference. Result has 50 places, 31 transitions, 123 flow [2020-10-16 04:53:05,886 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2020-10-16 04:53:05,886 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2020-10-16 04:53:05,887 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 123 flow [2020-10-16 04:53:05,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:05,887 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:05,887 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:05,887 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:53:05,887 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1914313475, now seen corresponding path program 1 times [2020-10-16 04:53:05,888 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:05,888 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221958491] [2020-10-16 04:53:05,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:06,025 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 04:53:06,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221958491] [2020-10-16 04:53:06,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:06,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:53:06,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165327428] [2020-10-16 04:53:06,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:53:06,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:06,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:53:06,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:53:06,030 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 199 [2020-10-16 04:53:06,031 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 123 flow. Second operand 5 states. [2020-10-16 04:53:06,031 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:06,031 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 199 [2020-10-16 04:53:06,031 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:06,260 INFO L129 PetriNetUnfolder]: 206/473 cut-off events. [2020-10-16 04:53:06,260 INFO L130 PetriNetUnfolder]: For 1503/1641 co-relation queries the response was YES. [2020-10-16 04:53:06,264 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1331 conditions, 473 events. 206/473 cut-off events. For 1503/1641 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 2788 event pairs, 111 based on Foata normal form. 34/471 useless extension candidates. Maximal degree in co-relation 1313. Up to 243 conditions per place. [2020-10-16 04:53:06,268 INFO L132 encePairwiseOnDemand]: 191/199 looper letters, 9 selfloop transitions, 6 changer transitions 7/45 dead transitions. [2020-10-16 04:53:06,269 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 45 transitions, 203 flow [2020-10-16 04:53:06,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:53:06,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:53:06,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 918 transitions. [2020-10-16 04:53:06,273 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7688442211055276 [2020-10-16 04:53:06,273 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 918 transitions. [2020-10-16 04:53:06,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 918 transitions. [2020-10-16 04:53:06,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:06,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 918 transitions. [2020-10-16 04:53:06,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:53:06,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:53:06,279 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:53:06,279 INFO L185 Difference]: Start difference. First operand has 50 places, 31 transitions, 123 flow. Second operand 6 states and 918 transitions. [2020-10-16 04:53:06,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 45 transitions, 203 flow [2020-10-16 04:53:06,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 194 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 04:53:06,286 INFO L241 Difference]: Finished difference. Result has 54 places, 36 transitions, 163 flow [2020-10-16 04:53:06,286 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=54, PETRI_TRANSITIONS=36} [2020-10-16 04:53:06,287 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2020-10-16 04:53:06,287 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 36 transitions, 163 flow [2020-10-16 04:53:06,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:53:06,287 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:06,287 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:06,288 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:53:06,288 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:06,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:06,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1502969219, now seen corresponding path program 2 times [2020-10-16 04:53:06,289 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:06,289 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576242550] [2020-10-16 04:53:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:06,412 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 04:53:06,412 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576242550] [2020-10-16 04:53:06,413 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:06,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:53:06,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514820492] [2020-10-16 04:53:06,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:53:06,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:06,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:53:06,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:53:06,416 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 199 [2020-10-16 04:53:06,417 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 36 transitions, 163 flow. Second operand 6 states. [2020-10-16 04:53:06,418 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:06,418 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 199 [2020-10-16 04:53:06,418 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:06,671 INFO L129 PetriNetUnfolder]: 168/409 cut-off events. [2020-10-16 04:53:06,671 INFO L130 PetriNetUnfolder]: For 1395/1490 co-relation queries the response was YES. [2020-10-16 04:53:06,674 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 409 events. 168/409 cut-off events. For 1395/1490 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2416 event pairs, 92 based on Foata normal form. 36/416 useless extension candidates. Maximal degree in co-relation 1431. Up to 216 conditions per place. [2020-10-16 04:53:06,678 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 11 selfloop transitions, 8 changer transitions 6/48 dead transitions. [2020-10-16 04:53:06,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 48 transitions, 278 flow [2020-10-16 04:53:06,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:53:06,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:53:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 904 transitions. [2020-10-16 04:53:06,683 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7571189279731994 [2020-10-16 04:53:06,684 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 904 transitions. [2020-10-16 04:53:06,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 904 transitions. [2020-10-16 04:53:06,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:06,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 904 transitions. [2020-10-16 04:53:06,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:53:06,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:53:06,693 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:53:06,693 INFO L185 Difference]: Start difference. First operand has 54 places, 36 transitions, 163 flow. Second operand 6 states and 904 transitions. [2020-10-16 04:53:06,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 48 transitions, 278 flow [2020-10-16 04:53:06,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 48 transitions, 270 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:53:06,699 INFO L241 Difference]: Finished difference. Result has 59 places, 41 transitions, 220 flow [2020-10-16 04:53:06,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2020-10-16 04:53:06,699 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2020-10-16 04:53:06,700 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 220 flow [2020-10-16 04:53:06,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:53:06,700 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:06,700 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 04:53:06,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:53:06,700 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:06,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1756456555, now seen corresponding path program 1 times [2020-10-16 04:53:06,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:06,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178854441] [2020-10-16 04:53:06,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:06,900 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 04:53:06,900 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178854441] [2020-10-16 04:53:06,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:06,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:53:06,901 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5425788] [2020-10-16 04:53:06,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:53:06,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:06,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:53:06,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:53:06,904 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 199 [2020-10-16 04:53:06,905 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 220 flow. Second operand 7 states. [2020-10-16 04:53:06,905 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:06,905 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 199 [2020-10-16 04:53:06,905 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:07,154 INFO L129 PetriNetUnfolder]: 143/367 cut-off events. [2020-10-16 04:53:07,154 INFO L130 PetriNetUnfolder]: For 1634/1737 co-relation queries the response was YES. [2020-10-16 04:53:07,158 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1498 conditions, 367 events. 143/367 cut-off events. For 1634/1737 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2118 event pairs, 21 based on Foata normal form. 38/373 useless extension candidates. Maximal degree in co-relation 1473. Up to 143 conditions per place. [2020-10-16 04:53:07,162 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 11 selfloop transitions, 14 changer transitions 5/53 dead transitions. [2020-10-16 04:53:07,162 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 53 transitions, 366 flow [2020-10-16 04:53:07,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:53:07,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:53:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1067 transitions. [2020-10-16 04:53:07,166 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7659727207465901 [2020-10-16 04:53:07,166 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1067 transitions. [2020-10-16 04:53:07,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1067 transitions. [2020-10-16 04:53:07,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:07,168 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1067 transitions. [2020-10-16 04:53:07,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:53:07,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:53:07,173 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:53:07,173 INFO L185 Difference]: Start difference. First operand has 59 places, 41 transitions, 220 flow. Second operand 7 states and 1067 transitions. [2020-10-16 04:53:07,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 53 transitions, 366 flow [2020-10-16 04:53:07,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 53 transitions, 352 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 04:53:07,179 INFO L241 Difference]: Finished difference. Result has 64 places, 45 transitions, 288 flow [2020-10-16 04:53:07,179 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=288, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2020-10-16 04:53:07,180 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2020-10-16 04:53:07,180 INFO L481 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 288 flow [2020-10-16 04:53:07,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:53:07,180 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:07,180 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:07,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:53:07,181 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1347866530, now seen corresponding path program 1 times [2020-10-16 04:53:07,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:07,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71647160] [2020-10-16 04:53:07,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:07,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:07,478 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 04:53:07,479 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71647160] [2020-10-16 04:53:07,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:07,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:53:07,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019200344] [2020-10-16 04:53:07,480 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:53:07,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:07,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:53:07,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:53:07,482 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 199 [2020-10-16 04:53:07,483 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 288 flow. Second operand 8 states. [2020-10-16 04:53:07,483 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:07,483 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 199 [2020-10-16 04:53:07,484 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:07,794 INFO L129 PetriNetUnfolder]: 138/367 cut-off events. [2020-10-16 04:53:07,794 INFO L130 PetriNetUnfolder]: For 1644/1766 co-relation queries the response was YES. [2020-10-16 04:53:07,799 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 367 events. 138/367 cut-off events. For 1644/1766 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2186 event pairs, 20 based on Foata normal form. 26/369 useless extension candidates. Maximal degree in co-relation 1585. Up to 158 conditions per place. [2020-10-16 04:53:07,803 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 14 selfloop transitions, 16 changer transitions 2/55 dead transitions. [2020-10-16 04:53:07,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 55 transitions, 439 flow [2020-10-16 04:53:07,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:53:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:53:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1313 transitions. [2020-10-16 04:53:07,808 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7331099944165271 [2020-10-16 04:53:07,808 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1313 transitions. [2020-10-16 04:53:07,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1313 transitions. [2020-10-16 04:53:07,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:07,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1313 transitions. [2020-10-16 04:53:07,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:53:07,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:53:07,815 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:53:07,816 INFO L185 Difference]: Start difference. First operand has 64 places, 45 transitions, 288 flow. Second operand 9 states and 1313 transitions. [2020-10-16 04:53:07,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 55 transitions, 439 flow [2020-10-16 04:53:07,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 55 transitions, 403 flow, removed 18 selfloop flow, removed 2 redundant places. [2020-10-16 04:53:07,823 INFO L241 Difference]: Finished difference. Result has 72 places, 49 transitions, 358 flow [2020-10-16 04:53:07,823 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=358, PETRI_PLACES=72, PETRI_TRANSITIONS=49} [2020-10-16 04:53:07,823 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2020-10-16 04:53:07,823 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 49 transitions, 358 flow [2020-10-16 04:53:07,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:53:07,824 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:07,824 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:07,824 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:53:07,824 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:07,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:07,825 INFO L82 PathProgramCache]: Analyzing trace with hash 999467764, now seen corresponding path program 2 times [2020-10-16 04:53:07,825 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:07,825 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334764011] [2020-10-16 04:53:07,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:08,081 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 04:53:08,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334764011] [2020-10-16 04:53:08,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:08,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:53:08,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589691894] [2020-10-16 04:53:08,082 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:53:08,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:08,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:53:08,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:53:08,084 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 199 [2020-10-16 04:53:08,085 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 49 transitions, 358 flow. Second operand 8 states. [2020-10-16 04:53:08,085 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:08,085 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 199 [2020-10-16 04:53:08,085 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:08,387 INFO L129 PetriNetUnfolder]: 131/413 cut-off events. [2020-10-16 04:53:08,387 INFO L130 PetriNetUnfolder]: For 2231/2340 co-relation queries the response was YES. [2020-10-16 04:53:08,391 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1823 conditions, 413 events. 131/413 cut-off events. For 2231/2340 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 2775 event pairs, 30 based on Foata normal form. 32/413 useless extension candidates. Maximal degree in co-relation 1791. Up to 124 conditions per place. [2020-10-16 04:53:08,395 INFO L132 encePairwiseOnDemand]: 193/199 looper letters, 16 selfloop transitions, 14 changer transitions 3/56 dead transitions. [2020-10-16 04:53:08,395 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 56 transitions, 488 flow [2020-10-16 04:53:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:53:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:53:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1035 transitions. [2020-10-16 04:53:08,399 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7430007178750897 [2020-10-16 04:53:08,399 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1035 transitions. [2020-10-16 04:53:08,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1035 transitions. [2020-10-16 04:53:08,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:08,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1035 transitions. [2020-10-16 04:53:08,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:53:08,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:53:08,406 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:53:08,406 INFO L185 Difference]: Start difference. First operand has 72 places, 49 transitions, 358 flow. Second operand 7 states and 1035 transitions. [2020-10-16 04:53:08,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 56 transitions, 488 flow [2020-10-16 04:53:08,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 56 transitions, 443 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-16 04:53:08,414 INFO L241 Difference]: Finished difference. Result has 73 places, 49 transitions, 368 flow [2020-10-16 04:53:08,414 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=368, PETRI_PLACES=73, PETRI_TRANSITIONS=49} [2020-10-16 04:53:08,414 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2020-10-16 04:53:08,414 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 49 transitions, 368 flow [2020-10-16 04:53:08,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:53:08,415 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:08,415 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:53:08,415 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:53:08,415 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:08,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:08,416 INFO L82 PathProgramCache]: Analyzing trace with hash -252764582, now seen corresponding path program 1 times [2020-10-16 04:53:08,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:08,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209450066] [2020-10-16 04:53:08,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:08,492 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 04:53:08,493 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209450066] [2020-10-16 04:53:08,493 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:08,493 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:53:08,493 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101229685] [2020-10-16 04:53:08,494 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:08,494 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:08,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:08,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:08,495 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:53:08,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 49 transitions, 368 flow. Second operand 4 states. [2020-10-16 04:53:08,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:08,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:53:08,496 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:08,876 INFO L129 PetriNetUnfolder]: 979/1940 cut-off events. [2020-10-16 04:53:08,877 INFO L130 PetriNetUnfolder]: For 5209/5584 co-relation queries the response was YES. [2020-10-16 04:53:08,894 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6227 conditions, 1940 events. 979/1940 cut-off events. For 5209/5584 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 14895 event pairs, 468 based on Foata normal form. 155/1796 useless extension candidates. Maximal degree in co-relation 6195. Up to 1007 conditions per place. [2020-10-16 04:53:08,908 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 11 selfloop transitions, 10 changer transitions 0/62 dead transitions. [2020-10-16 04:53:08,908 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 62 transitions, 436 flow [2020-10-16 04:53:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:53:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:53:08,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 862 transitions. [2020-10-16 04:53:08,911 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8663316582914573 [2020-10-16 04:53:08,911 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 862 transitions. [2020-10-16 04:53:08,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 862 transitions. [2020-10-16 04:53:08,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:08,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 862 transitions. [2020-10-16 04:53:08,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:53:08,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:53:08,916 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:53:08,916 INFO L185 Difference]: Start difference. First operand has 73 places, 49 transitions, 368 flow. Second operand 5 states and 862 transitions. [2020-10-16 04:53:08,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 62 transitions, 436 flow [2020-10-16 04:53:08,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 401 flow, removed 5 selfloop flow, removed 6 redundant places. [2020-10-16 04:53:08,930 INFO L241 Difference]: Finished difference. Result has 72 places, 58 transitions, 412 flow [2020-10-16 04:53:08,930 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2020-10-16 04:53:08,930 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2020-10-16 04:53:08,930 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 412 flow [2020-10-16 04:53:08,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:08,931 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:08,931 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 04:53:08,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:53:08,931 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:08,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:08,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1798059175, now seen corresponding path program 1 times [2020-10-16 04:53:08,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:08,932 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304648281] [2020-10-16 04:53:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:09,012 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 04:53:09,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304648281] [2020-10-16 04:53:09,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:09,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:53:09,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851393910] [2020-10-16 04:53:09,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:53:09,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:09,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:53:09,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:53:09,015 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:53:09,016 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 412 flow. Second operand 5 states. [2020-10-16 04:53:09,016 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:09,016 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:53:09,016 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:09,301 INFO L129 PetriNetUnfolder]: 648/1382 cut-off events. [2020-10-16 04:53:09,302 INFO L130 PetriNetUnfolder]: For 3246/7441 co-relation queries the response was YES. [2020-10-16 04:53:09,313 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5594 conditions, 1382 events. 648/1382 cut-off events. For 3246/7441 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 10444 event pairs, 137 based on Foata normal form. 362/1522 useless extension candidates. Maximal degree in co-relation 5562. Up to 927 conditions per place. [2020-10-16 04:53:09,323 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 11 selfloop transitions, 19 changer transitions 0/71 dead transitions. [2020-10-16 04:53:09,323 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 71 transitions, 548 flow [2020-10-16 04:53:09,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:53:09,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:53:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1207 transitions. [2020-10-16 04:53:09,327 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8664752333094041 [2020-10-16 04:53:09,327 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1207 transitions. [2020-10-16 04:53:09,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1207 transitions. [2020-10-16 04:53:09,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:09,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1207 transitions. [2020-10-16 04:53:09,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:53:09,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:53:09,333 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:53:09,333 INFO L185 Difference]: Start difference. First operand has 72 places, 58 transitions, 412 flow. Second operand 7 states and 1207 transitions. [2020-10-16 04:53:09,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 71 transitions, 548 flow [2020-10-16 04:53:09,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 71 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:53:09,342 INFO L241 Difference]: Finished difference. Result has 80 places, 67 transitions, 545 flow [2020-10-16 04:53:09,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=545, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2020-10-16 04:53:09,343 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 38 predicate places. [2020-10-16 04:53:09,343 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 545 flow [2020-10-16 04:53:09,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:53:09,343 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:09,343 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] [2020-10-16 04:53:09,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:53:09,344 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:09,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:09,344 INFO L82 PathProgramCache]: Analyzing trace with hash -135115546, now seen corresponding path program 1 times [2020-10-16 04:53:09,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:09,345 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394147475] [2020-10-16 04:53:09,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:09,450 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 04:53:09,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394147475] [2020-10-16 04:53:09,451 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:09,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:53:09,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121159364] [2020-10-16 04:53:09,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:53:09,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:09,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:53:09,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:53:09,456 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 199 [2020-10-16 04:53:09,457 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 545 flow. Second operand 5 states. [2020-10-16 04:53:09,457 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:09,457 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 199 [2020-10-16 04:53:09,457 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:09,966 INFO L129 PetriNetUnfolder]: 1299/2634 cut-off events. [2020-10-16 04:53:09,966 INFO L130 PetriNetUnfolder]: For 12494/20669 co-relation queries the response was YES. [2020-10-16 04:53:09,986 INFO L80 FinitePrefix]: Finished finitePrefix Result has 12667 conditions, 2634 events. 1299/2634 cut-off events. For 12494/20669 co-relation queries the response was YES. Maximal size of possible extension queue 470. Compared 22020 event pairs, 242 based on Foata normal form. 82/2322 useless extension candidates. Maximal degree in co-relation 12631. Up to 1858 conditions per place. [2020-10-16 04:53:10,001 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 6 selfloop transitions, 3 changer transitions 3/71 dead transitions. [2020-10-16 04:53:10,001 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 71 transitions, 601 flow [2020-10-16 04:53:10,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:53:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:53:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 825 transitions. [2020-10-16 04:53:10,004 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8291457286432161 [2020-10-16 04:53:10,004 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 825 transitions. [2020-10-16 04:53:10,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 825 transitions. [2020-10-16 04:53:10,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:10,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 825 transitions. [2020-10-16 04:53:10,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:53:10,009 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:53:10,009 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:53:10,009 INFO L185 Difference]: Start difference. First operand has 80 places, 67 transitions, 545 flow. Second operand 5 states and 825 transitions. [2020-10-16 04:53:10,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 71 transitions, 601 flow [2020-10-16 04:53:10,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 71 transitions, 551 flow, removed 17 selfloop flow, removed 3 redundant places. [2020-10-16 04:53:10,049 INFO L241 Difference]: Finished difference. Result has 84 places, 66 transitions, 494 flow [2020-10-16 04:53:10,049 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=84, PETRI_TRANSITIONS=66} [2020-10-16 04:53:10,049 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2020-10-16 04:53:10,049 INFO L481 AbstractCegarLoop]: Abstraction has has 84 places, 66 transitions, 494 flow [2020-10-16 04:53:10,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:53:10,050 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:10,050 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] [2020-10-16 04:53:10,050 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:53:10,050 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:10,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:10,050 INFO L82 PathProgramCache]: Analyzing trace with hash -582631258, now seen corresponding path program 2 times [2020-10-16 04:53:10,050 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:10,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15185765] [2020-10-16 04:53:10,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:10,125 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 04:53:10,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15185765] [2020-10-16 04:53:10,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:10,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:53:10,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335562051] [2020-10-16 04:53:10,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:53:10,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:10,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:53:10,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:53:10,128 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:53:10,129 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 66 transitions, 494 flow. Second operand 4 states. [2020-10-16 04:53:10,129 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:10,129 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:53:10,129 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:10,809 INFO L129 PetriNetUnfolder]: 1905/3859 cut-off events. [2020-10-16 04:53:10,809 INFO L130 PetriNetUnfolder]: For 17873/21554 co-relation queries the response was YES. [2020-10-16 04:53:10,830 INFO L80 FinitePrefix]: Finished finitePrefix Result has 17254 conditions, 3859 events. 1905/3859 cut-off events. For 17873/21554 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 34671 event pairs, 391 based on Foata normal form. 90/3305 useless extension candidates. Maximal degree in co-relation 17216. Up to 2572 conditions per place. [2020-10-16 04:53:10,844 INFO L132 encePairwiseOnDemand]: 195/199 looper letters, 5 selfloop transitions, 6 changer transitions 1/70 dead transitions. [2020-10-16 04:53:10,844 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 70 transitions, 568 flow [2020-10-16 04:53:10,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:53:10,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:53:10,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 851 transitions. [2020-10-16 04:53:10,847 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8552763819095477 [2020-10-16 04:53:10,847 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 851 transitions. [2020-10-16 04:53:10,847 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 851 transitions. [2020-10-16 04:53:10,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:10,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 851 transitions. [2020-10-16 04:53:10,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:53:10,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:53:10,852 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:53:10,852 INFO L185 Difference]: Start difference. First operand has 84 places, 66 transitions, 494 flow. Second operand 5 states and 851 transitions. [2020-10-16 04:53:10,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 70 transitions, 568 flow [2020-10-16 04:53:10,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 70 transitions, 559 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 04:53:10,912 INFO L241 Difference]: Finished difference. Result has 90 places, 68 transitions, 536 flow [2020-10-16 04:53:10,912 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=536, PETRI_PLACES=90, PETRI_TRANSITIONS=68} [2020-10-16 04:53:10,913 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 48 predicate places. [2020-10-16 04:53:10,913 INFO L481 AbstractCegarLoop]: Abstraction has has 90 places, 68 transitions, 536 flow [2020-10-16 04:53:10,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:53:10,913 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:10,913 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] [2020-10-16 04:53:10,913 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:53:10,914 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1777980136, now seen corresponding path program 1 times [2020-10-16 04:53:10,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:10,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504264496] [2020-10-16 04:53:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:11,061 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 04:53:11,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504264496] [2020-10-16 04:53:11,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:11,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:53:11,062 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063864825] [2020-10-16 04:53:11,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:53:11,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:11,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:53:11,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:53:11,065 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:53:11,065 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 68 transitions, 536 flow. Second operand 6 states. [2020-10-16 04:53:11,066 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:11,066 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:53:11,066 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:11,636 INFO L129 PetriNetUnfolder]: 1420/2876 cut-off events. [2020-10-16 04:53:11,637 INFO L130 PetriNetUnfolder]: For 15784/31978 co-relation queries the response was YES. [2020-10-16 04:53:11,664 INFO L80 FinitePrefix]: Finished finitePrefix Result has 14708 conditions, 2876 events. 1420/2876 cut-off events. For 15784/31978 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 24877 event pairs, 47 based on Foata normal form. 1180/3530 useless extension candidates. Maximal degree in co-relation 14667. Up to 2036 conditions per place. [2020-10-16 04:53:11,683 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 6 selfloop transitions, 28 changer transitions 7/78 dead transitions. [2020-10-16 04:53:11,684 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 78 transitions, 704 flow [2020-10-16 04:53:11,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:53:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:53:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1552 transitions. [2020-10-16 04:53:11,689 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8665549972082636 [2020-10-16 04:53:11,689 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1552 transitions. [2020-10-16 04:53:11,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1552 transitions. [2020-10-16 04:53:11,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:11,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1552 transitions. [2020-10-16 04:53:11,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:53:11,699 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:53:11,699 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:53:11,699 INFO L185 Difference]: Start difference. First operand has 90 places, 68 transitions, 536 flow. Second operand 9 states and 1552 transitions. [2020-10-16 04:53:11,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 78 transitions, 704 flow [2020-10-16 04:53:11,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 78 transitions, 676 flow, removed 7 selfloop flow, removed 4 redundant places. [2020-10-16 04:53:11,746 INFO L241 Difference]: Finished difference. Result has 97 places, 71 transitions, 610 flow [2020-10-16 04:53:11,746 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=610, PETRI_PLACES=97, PETRI_TRANSITIONS=71} [2020-10-16 04:53:11,746 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 55 predicate places. [2020-10-16 04:53:11,747 INFO L481 AbstractCegarLoop]: Abstraction has has 97 places, 71 transitions, 610 flow [2020-10-16 04:53:11,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:53:11,747 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:11,747 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, 1, 1] [2020-10-16 04:53:11,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:53:11,748 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:11,748 INFO L82 PathProgramCache]: Analyzing trace with hash -72693696, now seen corresponding path program 1 times [2020-10-16 04:53:11,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:11,749 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460296530] [2020-10-16 04:53:11,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:53:11,868 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 04:53:11,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460296530] [2020-10-16 04:53:11,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:53:11,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:53:11,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108783897] [2020-10-16 04:53:11,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:53:11,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:53:11,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:53:11,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:53:11,875 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 199 [2020-10-16 04:53:11,876 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 71 transitions, 610 flow. Second operand 7 states. [2020-10-16 04:53:11,876 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:53:11,876 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 199 [2020-10-16 04:53:11,876 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:53:12,396 INFO L129 PetriNetUnfolder]: 1177/2424 cut-off events. [2020-10-16 04:53:12,397 INFO L130 PetriNetUnfolder]: For 20925/43339 co-relation queries the response was YES. [2020-10-16 04:53:12,419 INFO L80 FinitePrefix]: Finished finitePrefix Result has 15357 conditions, 2424 events. 1177/2424 cut-off events. For 20925/43339 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 21102 event pairs, 0 based on Foata normal form. 1113/3019 useless extension candidates. Maximal degree in co-relation 15317. Up to 1683 conditions per place. [2020-10-16 04:53:12,427 INFO L132 encePairwiseOnDemand]: 192/199 looper letters, 2 selfloop transitions, 30 changer transitions 20/76 dead transitions. [2020-10-16 04:53:12,427 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 76 transitions, 744 flow [2020-10-16 04:53:12,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 04:53:12,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 04:53:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1889 transitions. [2020-10-16 04:53:12,433 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8629511192325263 [2020-10-16 04:53:12,433 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1889 transitions. [2020-10-16 04:53:12,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1889 transitions. [2020-10-16 04:53:12,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:53:12,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1889 transitions. [2020-10-16 04:53:12,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 04:53:12,442 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 04:53:12,442 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 04:53:12,442 INFO L185 Difference]: Start difference. First operand has 97 places, 71 transitions, 610 flow. Second operand 11 states and 1889 transitions. [2020-10-16 04:53:12,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 76 transitions, 744 flow [2020-10-16 04:53:12,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 76 transitions, 617 flow, removed 48 selfloop flow, removed 11 redundant places. [2020-10-16 04:53:12,694 INFO L241 Difference]: Finished difference. Result has 96 places, 56 transitions, 457 flow [2020-10-16 04:53:12,694 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=457, PETRI_PLACES=96, PETRI_TRANSITIONS=56} [2020-10-16 04:53:12,694 INFO L342 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2020-10-16 04:53:12,694 INFO L481 AbstractCegarLoop]: Abstraction has has 96 places, 56 transitions, 457 flow [2020-10-16 04:53:12,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:53:12,694 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:53:12,694 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, 1, 1, 1, 1, 1] [2020-10-16 04:53:12,695 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:53:12,695 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:53:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:53:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1261354147, now seen corresponding path program 1 times [2020-10-16 04:53:12,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:53:12,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259991639] [2020-10-16 04:53:12,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:53:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:53:12,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:53:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:53:12,771 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:53:12,811 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:53:12,811 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:53:12,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:53:12,841 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 04:53:12,841 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,843 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 04:53:12,843 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,844 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 04:53:12,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,844 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 04:53:12,844 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,844 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 04:53:12,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,845 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 04:53:12,845 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,845 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 04:53:12,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,846 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 04:53:12,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,846 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 04:53:12,846 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,847 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 04:53:12,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,847 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 04:53:12,847 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,849 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 04:53:12,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,849 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 04:53:12,849 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,849 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 04:53:12,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,850 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 04:53:12,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,850 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 04:53:12,850 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,851 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 04:53:12,851 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,851 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 04:53:12,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,852 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 04:53:12,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,852 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 04:53:12,852 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,853 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 04:53:12,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,853 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 04:53:12,853 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,853 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 04:53:12,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,854 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 04:53:12,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,854 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 04:53:12,854 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,855 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 04:53:12,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,855 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 04:53:12,855 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,856 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 04:53:12,856 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:53:12,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:53:12 BasicIcfg [2020-10-16 04:53:12,948 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:53:12,950 INFO L168 Benchmark]: Toolchain (without parser) took 16247.59 ms. Allocated memory was 243.3 MB in the beginning and 734.0 MB in the end (delta: 490.7 MB). Free memory was 199.0 MB in the beginning and 121.3 MB in the end (delta: 77.6 MB). Peak memory consumption was 568.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:12,952 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 243.3 MB. Free memory was 221.3 MB in the beginning and 220.5 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 04:53:12,953 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.92 ms. Allocated memory was 243.3 MB in the beginning and 291.5 MB in the end (delta: 48.2 MB). Free memory was 198.1 MB in the beginning and 242.2 MB in the end (delta: -44.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:12,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.34 ms. Allocated memory is still 291.5 MB. Free memory was 242.2 MB in the beginning and 238.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:12,954 INFO L168 Benchmark]: Boogie Preprocessor took 42.12 ms. Allocated memory is still 291.5 MB. Free memory was 238.8 MB in the beginning and 236.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:12,955 INFO L168 Benchmark]: RCFGBuilder took 2147.10 ms. Allocated memory was 291.5 MB in the beginning and 348.7 MB in the end (delta: 57.1 MB). Free memory was 236.3 MB in the beginning and 190.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 103.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:12,959 INFO L168 Benchmark]: TraceAbstraction took 13194.57 ms. Allocated memory was 348.7 MB in the beginning and 734.0 MB in the end (delta: 385.4 MB). Free memory was 190.1 MB in the beginning and 121.3 MB in the end (delta: 68.8 MB). Peak memory consumption was 454.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:53:12,968 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.20 ms. Allocated memory is still 243.3 MB. Free memory was 221.3 MB in the beginning and 220.5 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 780.92 ms. Allocated memory was 243.3 MB in the beginning and 291.5 MB in the end (delta: 48.2 MB). Free memory was 198.1 MB in the beginning and 242.2 MB in the end (delta: -44.1 MB). Peak memory consumption was 30.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 75.34 ms. Allocated memory is still 291.5 MB. Free memory was 242.2 MB in the beginning and 238.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 42.12 ms. Allocated memory is still 291.5 MB. Free memory was 238.8 MB in the beginning and 236.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2147.10 ms. Allocated memory was 291.5 MB in the beginning and 348.7 MB in the end (delta: 57.1 MB). Free memory was 236.3 MB in the beginning and 190.1 MB in the end (delta: 46.2 MB). Peak memory consumption was 103.4 MB. Max. memory is 14.2 GB. * TraceAbstraction took 13194.57 ms. Allocated memory was 348.7 MB in the beginning and 734.0 MB in the end (delta: 385.4 MB). Free memory was 190.1 MB in the beginning and 121.3 MB in the end (delta: 68.8 MB). Peak memory consumption was 454.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1640 VarBasedMoverChecksPositive, 61 VarBasedMoverChecksNegative, 15 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 209 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.6s, 118 PlacesBefore, 42 PlacesAfterwards, 107 TransitionsBefore, 30 TransitionsAfterwards, 2540 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 6794 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p3_EAX = 0; [L703] 0 int __unbuffered_p3_EBX = 0; [L705] 0 int a = 0; [L707] 0 int b = 0; [L708] 0 _Bool main$tmp_guard0; [L709] 0 _Bool main$tmp_guard1; [L711] 0 int x = 0; [L713] 0 int y = 0; [L715] 0 int z = 0; [L716] 0 _Bool z$flush_delayed; [L717] 0 int z$mem_tmp; [L718] 0 _Bool z$r_buff0_thd0; [L719] 0 _Bool z$r_buff0_thd1; [L720] 0 _Bool z$r_buff0_thd2; [L721] 0 _Bool z$r_buff0_thd3; [L722] 0 _Bool z$r_buff0_thd4; [L723] 0 _Bool z$r_buff1_thd0; [L724] 0 _Bool z$r_buff1_thd1; [L725] 0 _Bool z$r_buff1_thd2; [L726] 0 _Bool z$r_buff1_thd3; [L727] 0 _Bool z$r_buff1_thd4; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1269; [L834] FCALL, FORK 0 pthread_create(&t1269, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1270; [L836] FCALL, FORK 0 pthread_create(&t1270, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1271; [L838] FCALL, FORK 0 pthread_create(&t1271, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1272; [L840] FCALL, FORK 0 pthread_create(&t1272, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 4 z$w_buff1 = z$w_buff0 [L790] 4 z$w_buff0 = 2 [L791] 4 z$w_buff1_used = z$w_buff0_used [L792] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L794] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L795] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L796] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L797] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L798] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L799] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 a = 1 [L805] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L739] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 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) [L775] 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) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 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 [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L778] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L779] 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 [L811] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L762] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 2 return 0; [L782] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 3 return 0; [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L846] 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) [L846] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L846] 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) [L846] 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) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 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 [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L850] 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 [L853] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 0 z$flush_delayed = weak$$choice2 [L856] 0 z$mem_tmp = z [L857] 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) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1 [L857] 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) [L857] 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) [L858] 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)) [L858] 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) [L858] 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)) [L858] 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)) [L859] 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)) [L859] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L859] 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)) [L859] 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)) [L860] 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)) [L860] 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)) [L861] 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)) [L861] 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)) [L862] 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)) [L862] 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)) [L863] 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)) [L863] 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)) [L864] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L865] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L865] 0 z = z$flush_delayed ? z$mem_tmp : z [L866] 0 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 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: 12.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.7s, HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 72 SDs, 0 SdLazy, 443 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 89 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=610occurred in iteration=15, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 301 NumberOfCodeBlocks, 301 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 258 ConstructedInterpolants, 0 QuantifiedInterpolants, 30012 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...