/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/rfi002_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:57:26,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:57:26,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:57:26,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:57:26,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:57:26,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:57:26,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:57:26,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:57:26,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:57:26,480 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:57:26,481 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:57:26,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:57:26,482 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:57:26,484 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:57:26,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:57:26,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:57:26,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:57:26,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:57:26,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:57:26,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:57:26,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:57:26,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:57:26,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:57:26,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:57:26,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:57:26,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:57:26,523 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:57:26,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:57:26,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:57:26,530 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:57:26,530 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:57:26,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:57:26,531 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:57:26,532 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:57:26,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:57:26,533 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:57:26,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:57:26,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:57:26,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:57:26,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:57:26,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:57:26,536 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:57:26,558 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:57:26,558 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:57:26,559 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:57:26,560 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:57:26,560 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:57:26,560 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:57:26,560 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:57:26,560 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:57:26,561 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:57:26,561 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:57:26,561 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:57:26,561 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:57:26,561 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:57:26,561 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:57:26,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:57:26,562 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:57:26,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:57:26,562 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:57:26,562 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:57:26,563 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:57:26,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:57:26,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:57:26,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:57:26,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:57:26,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:57:26,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:57:26,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:57:26,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:57:26,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:57:26,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:57:26,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:57:26,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:57:26,880 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:57:26,881 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:57:26,881 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.oepc.i [2020-10-16 04:57:26,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4759c15/2f728ef010904c1e8f6a1db9c6811a47/FLAG9f724753a [2020-10-16 04:57:27,511 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:57:27,512 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.oepc.i [2020-10-16 04:57:27,536 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4759c15/2f728ef010904c1e8f6a1db9c6811a47/FLAG9f724753a [2020-10-16 04:57:27,796 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4759c15/2f728ef010904c1e8f6a1db9c6811a47 [2020-10-16 04:57:27,804 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:57:27,806 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:57:27,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:27,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:57:27,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:57:27,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:27" (1/1) ... [2020-10-16 04:57:27,816 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe4707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:27, skipping insertion in model container [2020-10-16 04:57:27,816 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:57:27" (1/1) ... [2020-10-16 04:57:27,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:57:27,875 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:57:28,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:28,466 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:57:28,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:57:28,643 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:57:28,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28 WrapperNode [2020-10-16 04:57:28,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:57:28,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:28,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:57:28,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:57:28,654 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:57:28" (1/1) ... [2020-10-16 04:57:28,680 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:57:28" (1/1) ... [2020-10-16 04:57:28,729 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:57:28,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:57:28,730 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:57:28,730 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:57:28,740 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (1/1) ... [2020-10-16 04:57:28,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (1/1) ... [2020-10-16 04:57:28,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (1/1) ... [2020-10-16 04:57:28,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (1/1) ... [2020-10-16 04:57:28,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (1/1) ... [2020-10-16 04:57:28,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (1/1) ... [2020-10-16 04:57:28,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (1/1) ... [2020-10-16 04:57:28,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:57:28,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:57:28,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:57:28,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:57:28,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (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:57:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:57:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:57:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:57:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:57:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:57:28,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:57:28,901 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:57:28,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:57:28,902 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:57:28,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:57:28,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:57:28,908 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:57:33,378 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:57:33,378 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-16 04:57:33,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:33 BoogieIcfgContainer [2020-10-16 04:57:33,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:57:33,382 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:57:33,382 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:57:33,386 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:57:33,386 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:57:27" (1/3) ... [2020-10-16 04:57:33,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626ffea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:33, skipping insertion in model container [2020-10-16 04:57:33,387 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:57:28" (2/3) ... [2020-10-16 04:57:33,387 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@626ffea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:57:33, skipping insertion in model container [2020-10-16 04:57:33,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:57:33" (3/3) ... [2020-10-16 04:57:33,389 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_tso.oepc.i [2020-10-16 04:57:33,401 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:57:33,408 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-10-16 04:57:33,409 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:57:33,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,447 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,448 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,449 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,450 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,451 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,452 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,453 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,454 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,455 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,456 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,458 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,460 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,460 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,462 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,465 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,466 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,467 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,468 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,469 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,473 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,474 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,475 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,478 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,479 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,480 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,486 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,488 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,502 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,504 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,506 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:57:33,528 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-16 04:57:33,549 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:57:33,549 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:57:33,550 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:57:33,550 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:57:33,550 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:57:33,550 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:57:33,550 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:57:33,550 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:57:33,564 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 95 transitions, 200 flow [2020-10-16 04:57:33,612 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-16 04:57:33,612 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:33,618 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2020-10-16 04:57:33,618 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 95 transitions, 200 flow [2020-10-16 04:57:33,625 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 93 transitions, 192 flow [2020-10-16 04:57:33,628 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:57:33,630 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 93 transitions, 192 flow [2020-10-16 04:57:33,634 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 93 transitions, 192 flow [2020-10-16 04:57:33,634 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 98 places, 93 transitions, 192 flow [2020-10-16 04:57:33,661 INFO L129 PetriNetUnfolder]: 2/93 cut-off events. [2020-10-16 04:57:33,661 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:33,662 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 93 events. 2/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2020-10-16 04:57:33,665 INFO L117 LiptonReduction]: Number of co-enabled transitions 1152 [2020-10-16 04:57:33,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:57:33,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:34,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:34,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:34,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:34,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:34,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:34,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:34,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:57:34,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:35,372 WARN L193 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2020-10-16 04:57:35,636 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-10-16 04:57:35,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:57:35,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:35,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:57:35,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:35,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 04:57:35,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:35,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:35,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:35,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 04:57:35,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:36,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:36,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:36,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 04:57:36,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:36,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:57:36,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:36,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:36,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:37,309 WARN L193 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 04:57:37,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 04:57:37,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:37,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:57:37,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,163 WARN L193 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 04:57:38,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:57:38,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,294 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:38,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:38,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:57:38,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,367 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:38,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:38,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:38,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:38,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:38,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:38,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:38,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:38,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:38,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:38,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:57:38,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:38,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,782 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:38,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:38,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:38,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:38,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:39,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:39,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:57:39,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,145 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:39,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:57:39,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:39,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,444 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,612 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 04:57:39,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 04:57:39,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,667 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 8, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 04:57:39,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,702 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 5, 4, 1] term [2020-10-16 04:57:39,702 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:57:39,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 5, 4, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 04:57:39,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:39,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:57:39,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 04:57:39,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:57:40,009 WARN L193 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-16 04:57:40,241 WARN L193 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-16 04:57:41,754 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 113 [2020-10-16 04:57:41,927 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-16 04:57:41,934 INFO L132 LiptonReduction]: Checked pairs total: 4041 [2020-10-16 04:57:41,934 INFO L134 LiptonReduction]: Total number of compositions: 82 [2020-10-16 04:57:41,937 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8312 [2020-10-16 04:57:41,943 INFO L129 PetriNetUnfolder]: 0/6 cut-off events. [2020-10-16 04:57:41,943 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:41,943 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:41,944 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:57:41,944 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:41,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:41,949 INFO L82 PathProgramCache]: Analyzing trace with hash 2146558093, now seen corresponding path program 1 times [2020-10-16 04:57:41,956 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:41,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134863173] [2020-10-16 04:57:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:42,217 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:57:42,218 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134863173] [2020-10-16 04:57:42,219 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:42,219 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:57:42,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800066034] [2020-10-16 04:57:42,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:57:42,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:42,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:57:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:57:42,260 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 177 [2020-10-16 04:57:42,262 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states. [2020-10-16 04:57:42,262 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:42,262 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 177 [2020-10-16 04:57:42,265 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:42,419 INFO L129 PetriNetUnfolder]: 57/168 cut-off events. [2020-10-16 04:57:42,419 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:42,421 INFO L80 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 168 events. 57/168 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 793 event pairs, 6 based on Foata normal form. 15/164 useless extension candidates. Maximal degree in co-relation 272. Up to 88 conditions per place. [2020-10-16 04:57:42,423 INFO L132 encePairwiseOnDemand]: 173/177 looper letters, 12 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2020-10-16 04:57:42,423 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 86 flow [2020-10-16 04:57:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:57:42,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:57:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2020-10-16 04:57:42,443 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8681732580037664 [2020-10-16 04:57:42,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2020-10-16 04:57:42,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2020-10-16 04:57:42,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:42,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2020-10-16 04:57:42,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:57:42,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:57:42,463 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:57:42,466 INFO L185 Difference]: Start difference. First operand has 29 places, 23 transitions, 52 flow. Second operand 3 states and 461 transitions. [2020-10-16 04:57:42,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 86 flow [2020-10-16 04:57:42,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:42,473 INFO L241 Difference]: Finished difference. Result has 28 places, 21 transitions, 50 flow [2020-10-16 04:57:42,476 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2020-10-16 04:57:42,478 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, -1 predicate places. [2020-10-16 04:57:42,478 INFO L481 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 50 flow [2020-10-16 04:57:42,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:57:42,478 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:42,478 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-16 04:57:42,479 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:57:42,479 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:42,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2118793603, now seen corresponding path program 1 times [2020-10-16 04:57:42,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:42,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548609788] [2020-10-16 04:57:42,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:42,559 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:57:42,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548609788] [2020-10-16 04:57:42,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:42,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:57:42,560 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892840528] [2020-10-16 04:57:42,561 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:57:42,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:42,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:57:42,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:57:42,563 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 177 [2020-10-16 04:57:42,563 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 50 flow. Second operand 3 states. [2020-10-16 04:57:42,563 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:42,563 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 177 [2020-10-16 04:57:42,563 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:42,603 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2020-10-16 04:57:42,603 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:42,604 INFO L80 FinitePrefix]: Finished finitePrefix Result has 48 conditions, 28 events. 3/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 49 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 39. Up to 10 conditions per place. [2020-10-16 04:57:42,604 INFO L132 encePairwiseOnDemand]: 174/177 looper letters, 4 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2020-10-16 04:57:42,604 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 21 transitions, 62 flow [2020-10-16 04:57:42,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:57:42,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:57:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2020-10-16 04:57:42,608 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8832391713747646 [2020-10-16 04:57:42,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2020-10-16 04:57:42,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2020-10-16 04:57:42,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:42,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2020-10-16 04:57:42,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:57:42,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:57:42,612 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:57:42,612 INFO L185 Difference]: Start difference. First operand has 28 places, 21 transitions, 50 flow. Second operand 3 states and 469 transitions. [2020-10-16 04:57:42,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 21 transitions, 62 flow [2020-10-16 04:57:42,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 21 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:42,613 INFO L241 Difference]: Finished difference. Result has 27 places, 19 transitions, 46 flow [2020-10-16 04:57:42,614 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=46, PETRI_PLACES=27, PETRI_TRANSITIONS=19} [2020-10-16 04:57:42,614 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, -2 predicate places. [2020-10-16 04:57:42,615 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 19 transitions, 46 flow [2020-10-16 04:57:42,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:57:42,615 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:42,615 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:42,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:57:42,615 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:42,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:42,616 INFO L82 PathProgramCache]: Analyzing trace with hash 347268441, now seen corresponding path program 1 times [2020-10-16 04:57:42,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:42,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043257360] [2020-10-16 04:57:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:42,714 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:57:42,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043257360] [2020-10-16 04:57:42,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:42,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:42,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32220700] [2020-10-16 04:57:42,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:42,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:42,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:42,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:42,718 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 177 [2020-10-16 04:57:42,718 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 19 transitions, 46 flow. Second operand 4 states. [2020-10-16 04:57:42,718 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:42,718 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 177 [2020-10-16 04:57:42,718 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:42,766 INFO L129 PetriNetUnfolder]: 0/23 cut-off events. [2020-10-16 04:57:42,766 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:57:42,767 INFO L80 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 23 events. 0/23 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 36 event pairs, 0 based on Foata normal form. 2/25 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 04:57:42,767 INFO L132 encePairwiseOnDemand]: 173/177 looper letters, 2 selfloop transitions, 2 changer transitions 2/21 dead transitions. [2020-10-16 04:57:42,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 21 transitions, 62 flow [2020-10-16 04:57:42,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:42,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 758 transitions. [2020-10-16 04:57:42,770 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8564971751412429 [2020-10-16 04:57:42,771 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 758 transitions. [2020-10-16 04:57:42,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 758 transitions. [2020-10-16 04:57:42,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:42,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 758 transitions. [2020-10-16 04:57:42,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:42,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:42,775 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:42,775 INFO L185 Difference]: Start difference. First operand has 27 places, 19 transitions, 46 flow. Second operand 5 states and 758 transitions. [2020-10-16 04:57:42,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 21 transitions, 62 flow [2020-10-16 04:57:42,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 58 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:42,776 INFO L241 Difference]: Finished difference. Result has 31 places, 19 transitions, 54 flow [2020-10-16 04:57:42,777 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=54, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2020-10-16 04:57:42,777 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2020-10-16 04:57:42,777 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 54 flow [2020-10-16 04:57:42,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:42,777 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:42,777 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:42,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:57:42,778 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:42,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1127270853, now seen corresponding path program 1 times [2020-10-16 04:57:42,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:42,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953411014] [2020-10-16 04:57:42,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:42,887 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:57:42,888 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953411014] [2020-10-16 04:57:42,888 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:42,888 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:57:42,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864048560] [2020-10-16 04:57:42,889 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:57:42,889 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:42,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:57:42,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:57:42,891 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 177 [2020-10-16 04:57:42,891 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 54 flow. Second operand 4 states. [2020-10-16 04:57:42,891 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:42,892 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 177 [2020-10-16 04:57:42,892 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:42,940 INFO L129 PetriNetUnfolder]: 0/24 cut-off events. [2020-10-16 04:57:42,940 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2020-10-16 04:57:42,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 24 events. 0/24 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 0 based on Foata normal form. 2/26 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2020-10-16 04:57:42,940 INFO L132 encePairwiseOnDemand]: 173/177 looper letters, 2 selfloop transitions, 2 changer transitions 2/21 dead transitions. [2020-10-16 04:57:42,941 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 21 transitions, 72 flow [2020-10-16 04:57:42,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 773 transitions. [2020-10-16 04:57:42,944 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8734463276836159 [2020-10-16 04:57:42,944 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 773 transitions. [2020-10-16 04:57:42,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 773 transitions. [2020-10-16 04:57:42,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:42,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 773 transitions. [2020-10-16 04:57:42,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:42,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:42,948 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:42,948 INFO L185 Difference]: Start difference. First operand has 31 places, 19 transitions, 54 flow. Second operand 5 states and 773 transitions. [2020-10-16 04:57:42,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 21 transitions, 72 flow [2020-10-16 04:57:42,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 21 transitions, 64 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:42,949 INFO L241 Difference]: Finished difference. Result has 32 places, 19 transitions, 58 flow [2020-10-16 04:57:42,949 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2020-10-16 04:57:42,950 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2020-10-16 04:57:42,950 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 58 flow [2020-10-16 04:57:42,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:57:42,950 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:42,950 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:42,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:57:42,951 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:42,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:42,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2127949780, now seen corresponding path program 1 times [2020-10-16 04:57:42,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:42,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454138424] [2020-10-16 04:57:42,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:43,427 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:57:43,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454138424] [2020-10-16 04:57:43,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:43,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:43,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346679914] [2020-10-16 04:57:43,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:43,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:43,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:43,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:43,431 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 177 [2020-10-16 04:57:43,432 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 58 flow. Second operand 9 states. [2020-10-16 04:57:43,432 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:43,432 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 177 [2020-10-16 04:57:43,432 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:44,073 INFO L129 PetriNetUnfolder]: 72/181 cut-off events. [2020-10-16 04:57:44,073 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2020-10-16 04:57:44,074 INFO L80 FinitePrefix]: Finished finitePrefix Result has 393 conditions, 181 events. 72/181 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 789 event pairs, 7 based on Foata normal form. 9/187 useless extension candidates. Maximal degree in co-relation 380. Up to 94 conditions per place. [2020-10-16 04:57:44,076 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 16 selfloop transitions, 11 changer transitions 9/44 dead transitions. [2020-10-16 04:57:44,076 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 44 transitions, 190 flow [2020-10-16 04:57:44,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:44,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:44,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1119 transitions. [2020-10-16 04:57:44,082 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7024482109227872 [2020-10-16 04:57:44,083 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1119 transitions. [2020-10-16 04:57:44,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1119 transitions. [2020-10-16 04:57:44,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:44,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1119 transitions. [2020-10-16 04:57:44,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:44,089 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:44,089 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:44,089 INFO L185 Difference]: Start difference. First operand has 32 places, 19 transitions, 58 flow. Second operand 9 states and 1119 transitions. [2020-10-16 04:57:44,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 44 transitions, 190 flow [2020-10-16 04:57:44,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 44 transitions, 182 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 04:57:44,092 INFO L241 Difference]: Finished difference. Result has 39 places, 28 transitions, 128 flow [2020-10-16 04:57:44,092 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=128, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2020-10-16 04:57:44,093 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 10 predicate places. [2020-10-16 04:57:44,093 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 128 flow [2020-10-16 04:57:44,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:44,093 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:44,093 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:44,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:57:44,093 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:44,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1742346600, now seen corresponding path program 2 times [2020-10-16 04:57:44,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:44,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905352112] [2020-10-16 04:57:44,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:44,608 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:57:44,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905352112] [2020-10-16 04:57:44,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:44,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:44,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884038577] [2020-10-16 04:57:44,610 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:44,610 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:44,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:44,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:44,612 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 177 [2020-10-16 04:57:44,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 128 flow. Second operand 9 states. [2020-10-16 04:57:44,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:44,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 177 [2020-10-16 04:57:44,614 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:45,070 INFO L129 PetriNetUnfolder]: 82/200 cut-off events. [2020-10-16 04:57:45,070 INFO L130 PetriNetUnfolder]: For 258/284 co-relation queries the response was YES. [2020-10-16 04:57:45,072 INFO L80 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 200 events. 82/200 cut-off events. For 258/284 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 926 event pairs, 6 based on Foata normal form. 10/207 useless extension candidates. Maximal degree in co-relation 615. Up to 104 conditions per place. [2020-10-16 04:57:45,073 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 26 selfloop transitions, 11 changer transitions 5/50 dead transitions. [2020-10-16 04:57:45,073 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 50 transitions, 330 flow [2020-10-16 04:57:45,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:45,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 978 transitions. [2020-10-16 04:57:45,078 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.690677966101695 [2020-10-16 04:57:45,079 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 978 transitions. [2020-10-16 04:57:45,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 978 transitions. [2020-10-16 04:57:45,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:45,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 978 transitions. [2020-10-16 04:57:45,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:45,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:45,085 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:45,085 INFO L185 Difference]: Start difference. First operand has 39 places, 28 transitions, 128 flow. Second operand 8 states and 978 transitions. [2020-10-16 04:57:45,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 50 transitions, 330 flow [2020-10-16 04:57:45,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 50 transitions, 316 flow, removed 7 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:45,090 INFO L241 Difference]: Finished difference. Result has 45 places, 35 transitions, 202 flow [2020-10-16 04:57:45,090 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2020-10-16 04:57:45,090 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 16 predicate places. [2020-10-16 04:57:45,090 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 202 flow [2020-10-16 04:57:45,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:45,091 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:45,091 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:45,091 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:57:45,091 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:45,091 INFO L82 PathProgramCache]: Analyzing trace with hash -164135082, now seen corresponding path program 3 times [2020-10-16 04:57:45,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:45,092 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269124547] [2020-10-16 04:57:45,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:45,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:45,519 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:57:45,519 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269124547] [2020-10-16 04:57:45,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:45,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:45,520 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85246702] [2020-10-16 04:57:45,521 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:45,521 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:45,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:45,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:45,524 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 177 [2020-10-16 04:57:45,524 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 202 flow. Second operand 9 states. [2020-10-16 04:57:45,524 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:45,525 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 177 [2020-10-16 04:57:45,525 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:46,045 INFO L129 PetriNetUnfolder]: 177/361 cut-off events. [2020-10-16 04:57:46,046 INFO L130 PetriNetUnfolder]: For 526/528 co-relation queries the response was YES. [2020-10-16 04:57:46,047 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1323 conditions, 361 events. 177/361 cut-off events. For 526/528 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1759 event pairs, 9 based on Foata normal form. 6/365 useless extension candidates. Maximal degree in co-relation 1303. Up to 190 conditions per place. [2020-10-16 04:57:46,051 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 28 selfloop transitions, 34 changer transitions 6/74 dead transitions. [2020-10-16 04:57:46,051 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 572 flow [2020-10-16 04:57:46,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1010 transitions. [2020-10-16 04:57:46,059 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6340238543628374 [2020-10-16 04:57:46,059 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1010 transitions. [2020-10-16 04:57:46,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1010 transitions. [2020-10-16 04:57:46,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:46,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1010 transitions. [2020-10-16 04:57:46,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:46,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:46,066 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:46,066 INFO L185 Difference]: Start difference. First operand has 45 places, 35 transitions, 202 flow. Second operand 9 states and 1010 transitions. [2020-10-16 04:57:46,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 572 flow [2020-10-16 04:57:46,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 74 transitions, 565 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 04:57:46,073 INFO L241 Difference]: Finished difference. Result has 53 places, 58 transitions, 470 flow [2020-10-16 04:57:46,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=470, PETRI_PLACES=53, PETRI_TRANSITIONS=58} [2020-10-16 04:57:46,073 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2020-10-16 04:57:46,074 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 58 transitions, 470 flow [2020-10-16 04:57:46,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:46,074 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:46,074 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:46,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:57:46,074 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:46,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:46,075 INFO L82 PathProgramCache]: Analyzing trace with hash 131084118, now seen corresponding path program 4 times [2020-10-16 04:57:46,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:46,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141112287] [2020-10-16 04:57:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:46,565 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:57:46,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141112287] [2020-10-16 04:57:46,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:46,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:46,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145515887] [2020-10-16 04:57:46,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:46,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:46,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:46,570 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 177 [2020-10-16 04:57:46,571 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 470 flow. Second operand 9 states. [2020-10-16 04:57:46,571 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:46,571 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 177 [2020-10-16 04:57:46,571 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:47,271 INFO L129 PetriNetUnfolder]: 177/373 cut-off events. [2020-10-16 04:57:47,271 INFO L130 PetriNetUnfolder]: For 1101/1123 co-relation queries the response was YES. [2020-10-16 04:57:47,273 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 373 events. 177/373 cut-off events. For 1101/1123 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 1915 event pairs, 6 based on Foata normal form. 26/397 useless extension candidates. Maximal degree in co-relation 1671. Up to 124 conditions per place. [2020-10-16 04:57:47,276 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 40 selfloop transitions, 27 changer transitions 6/83 dead transitions. [2020-10-16 04:57:47,277 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 797 flow [2020-10-16 04:57:47,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:57:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:57:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1207 transitions. [2020-10-16 04:57:47,281 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6819209039548022 [2020-10-16 04:57:47,282 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1207 transitions. [2020-10-16 04:57:47,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1207 transitions. [2020-10-16 04:57:47,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:47,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1207 transitions. [2020-10-16 04:57:47,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:57:47,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:57:47,288 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:57:47,289 INFO L185 Difference]: Start difference. First operand has 53 places, 58 transitions, 470 flow. Second operand 10 states and 1207 transitions. [2020-10-16 04:57:47,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 797 flow [2020-10-16 04:57:47,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 83 transitions, 762 flow, removed 15 selfloop flow, removed 3 redundant places. [2020-10-16 04:57:47,299 INFO L241 Difference]: Finished difference. Result has 60 places, 66 transitions, 576 flow [2020-10-16 04:57:47,299 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=576, PETRI_PLACES=60, PETRI_TRANSITIONS=66} [2020-10-16 04:57:47,299 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 31 predicate places. [2020-10-16 04:57:47,300 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 66 transitions, 576 flow [2020-10-16 04:57:47,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:47,300 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:47,300 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:47,300 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:57:47,300 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1436209776, now seen corresponding path program 1 times [2020-10-16 04:57:47,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:47,301 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655166343] [2020-10-16 04:57:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:47,451 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:57:47,451 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655166343] [2020-10-16 04:57:47,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:47,452 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:57:47,452 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425477503] [2020-10-16 04:57:47,452 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:57:47,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:47,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:57:47,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:57:47,455 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 177 [2020-10-16 04:57:47,455 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 66 transitions, 576 flow. Second operand 5 states. [2020-10-16 04:57:47,455 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:47,455 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 177 [2020-10-16 04:57:47,456 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:47,758 INFO L129 PetriNetUnfolder]: 187/419 cut-off events. [2020-10-16 04:57:47,758 INFO L130 PetriNetUnfolder]: For 1248/1254 co-relation queries the response was YES. [2020-10-16 04:57:47,759 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1962 conditions, 419 events. 187/419 cut-off events. For 1248/1254 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 2329 event pairs, 38 based on Foata normal form. 7/423 useless extension candidates. Maximal degree in co-relation 1934. Up to 215 conditions per place. [2020-10-16 04:57:47,762 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 43 selfloop transitions, 19 changer transitions 15/90 dead transitions. [2020-10-16 04:57:47,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 90 transitions, 945 flow [2020-10-16 04:57:47,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:57:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:57:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2020-10-16 04:57:47,765 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7559322033898305 [2020-10-16 04:57:47,765 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2020-10-16 04:57:47,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2020-10-16 04:57:47,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:47,766 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2020-10-16 04:57:47,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:57:47,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:57:47,769 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:57:47,769 INFO L185 Difference]: Start difference. First operand has 60 places, 66 transitions, 576 flow. Second operand 5 states and 669 transitions. [2020-10-16 04:57:47,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 90 transitions, 945 flow [2020-10-16 04:57:47,775 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 90 transitions, 926 flow, removed 6 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:47,777 INFO L241 Difference]: Finished difference. Result has 59 places, 75 transitions, 728 flow [2020-10-16 04:57:47,778 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=559, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=728, PETRI_PLACES=59, PETRI_TRANSITIONS=75} [2020-10-16 04:57:47,778 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 30 predicate places. [2020-10-16 04:57:47,778 INFO L481 AbstractCegarLoop]: Abstraction has has 59 places, 75 transitions, 728 flow [2020-10-16 04:57:47,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:57:47,778 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:47,778 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:47,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:57:47,779 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:47,779 INFO L82 PathProgramCache]: Analyzing trace with hash -595953938, now seen corresponding path program 2 times [2020-10-16 04:57:47,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:47,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905276446] [2020-10-16 04:57:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:47,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:47,978 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:57:47,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905276446] [2020-10-16 04:57:47,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:47,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:57:47,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096514929] [2020-10-16 04:57:47,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:57:47,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:47,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:57:47,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:57:47,983 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 177 [2020-10-16 04:57:47,984 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 75 transitions, 728 flow. Second operand 7 states. [2020-10-16 04:57:47,984 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:47,984 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 177 [2020-10-16 04:57:47,984 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:48,322 INFO L129 PetriNetUnfolder]: 150/341 cut-off events. [2020-10-16 04:57:48,323 INFO L130 PetriNetUnfolder]: For 1341/1355 co-relation queries the response was YES. [2020-10-16 04:57:48,325 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1755 conditions, 341 events. 150/341 cut-off events. For 1341/1355 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1752 event pairs, 42 based on Foata normal form. 11/349 useless extension candidates. Maximal degree in co-relation 1728. Up to 179 conditions per place. [2020-10-16 04:57:48,336 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 30 selfloop transitions, 25 changer transitions 16/83 dead transitions. [2020-10-16 04:57:48,336 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 83 transitions, 935 flow [2020-10-16 04:57:48,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:57:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:57:48,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2020-10-16 04:57:48,340 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7448210922787194 [2020-10-16 04:57:48,340 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2020-10-16 04:57:48,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2020-10-16 04:57:48,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:48,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2020-10-16 04:57:48,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:57:48,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:57:48,345 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:57:48,345 INFO L185 Difference]: Start difference. First operand has 59 places, 75 transitions, 728 flow. Second operand 6 states and 791 transitions. [2020-10-16 04:57:48,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 83 transitions, 935 flow [2020-10-16 04:57:48,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 83 transitions, 900 flow, removed 8 selfloop flow, removed 3 redundant places. [2020-10-16 04:57:48,353 INFO L241 Difference]: Finished difference. Result has 61 places, 67 transitions, 675 flow [2020-10-16 04:57:48,354 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=675, PETRI_PLACES=61, PETRI_TRANSITIONS=67} [2020-10-16 04:57:48,354 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 32 predicate places. [2020-10-16 04:57:48,354 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 67 transitions, 675 flow [2020-10-16 04:57:48,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:57:48,354 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:48,354 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:48,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:57:48,355 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:48,355 INFO L82 PathProgramCache]: Analyzing trace with hash -712290510, now seen corresponding path program 3 times [2020-10-16 04:57:48,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:48,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849964375] [2020-10-16 04:57:48,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:48,630 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:57:48,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849964375] [2020-10-16 04:57:48,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:48,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:57:48,632 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008543888] [2020-10-16 04:57:48,632 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:48,632 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:48,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:48,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:48,636 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 177 [2020-10-16 04:57:48,637 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 67 transitions, 675 flow. Second operand 8 states. [2020-10-16 04:57:48,637 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:48,637 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 177 [2020-10-16 04:57:48,637 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:49,276 INFO L129 PetriNetUnfolder]: 306/577 cut-off events. [2020-10-16 04:57:49,276 INFO L130 PetriNetUnfolder]: For 2243/2251 co-relation queries the response was YES. [2020-10-16 04:57:49,280 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2700 conditions, 577 events. 306/577 cut-off events. For 2243/2251 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2566 event pairs, 49 based on Foata normal form. 9/582 useless extension candidates. Maximal degree in co-relation 2672. Up to 304 conditions per place. [2020-10-16 04:57:49,284 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 42 selfloop transitions, 36 changer transitions 11/96 dead transitions. [2020-10-16 04:57:49,284 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 1035 flow [2020-10-16 04:57:49,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:49,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:49,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1020 transitions. [2020-10-16 04:57:49,288 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.64030131826742 [2020-10-16 04:57:49,288 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1020 transitions. [2020-10-16 04:57:49,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1020 transitions. [2020-10-16 04:57:49,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:49,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1020 transitions. [2020-10-16 04:57:49,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:49,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:49,295 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:49,295 INFO L185 Difference]: Start difference. First operand has 61 places, 67 transitions, 675 flow. Second operand 9 states and 1020 transitions. [2020-10-16 04:57:49,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 1035 flow [2020-10-16 04:57:49,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 96 transitions, 962 flow, removed 3 selfloop flow, removed 7 redundant places. [2020-10-16 04:57:49,305 INFO L241 Difference]: Finished difference. Result has 63 places, 75 transitions, 787 flow [2020-10-16 04:57:49,306 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=787, PETRI_PLACES=63, PETRI_TRANSITIONS=75} [2020-10-16 04:57:49,307 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 34 predicate places. [2020-10-16 04:57:49,307 INFO L481 AbstractCegarLoop]: Abstraction has has 63 places, 75 transitions, 787 flow [2020-10-16 04:57:49,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:49,307 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:49,307 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:49,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:57:49,308 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:49,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:49,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1859361868, now seen corresponding path program 4 times [2020-10-16 04:57:49,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:49,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143003923] [2020-10-16 04:57:49,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:49,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:49,733 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:57:49,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143003923] [2020-10-16 04:57:49,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:49,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:57:49,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804736709] [2020-10-16 04:57:49,735 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:49,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:49,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:49,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:49,737 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 177 [2020-10-16 04:57:49,737 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 75 transitions, 787 flow. Second operand 8 states. [2020-10-16 04:57:49,737 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:49,738 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 177 [2020-10-16 04:57:49,738 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:50,296 INFO L129 PetriNetUnfolder]: 143/311 cut-off events. [2020-10-16 04:57:50,297 INFO L130 PetriNetUnfolder]: For 1508/1516 co-relation queries the response was YES. [2020-10-16 04:57:50,299 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 311 events. 143/311 cut-off events. For 1508/1516 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1528 event pairs, 13 based on Foata normal form. 4/311 useless extension candidates. Maximal degree in co-relation 1651. Up to 156 conditions per place. [2020-10-16 04:57:50,302 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 31 selfloop transitions, 34 changer transitions 7/82 dead transitions. [2020-10-16 04:57:50,302 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 82 transitions, 993 flow [2020-10-16 04:57:50,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:50,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 957 transitions. [2020-10-16 04:57:50,306 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6758474576271186 [2020-10-16 04:57:50,306 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 957 transitions. [2020-10-16 04:57:50,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 957 transitions. [2020-10-16 04:57:50,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:50,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 957 transitions. [2020-10-16 04:57:50,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:50,314 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:50,314 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:50,314 INFO L185 Difference]: Start difference. First operand has 63 places, 75 transitions, 787 flow. Second operand 8 states and 957 transitions. [2020-10-16 04:57:50,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 82 transitions, 993 flow [2020-10-16 04:57:50,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 916 flow, removed 7 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:50,331 INFO L241 Difference]: Finished difference. Result has 65 places, 73 transitions, 755 flow [2020-10-16 04:57:50,331 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=755, PETRI_PLACES=65, PETRI_TRANSITIONS=73} [2020-10-16 04:57:50,332 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 36 predicate places. [2020-10-16 04:57:50,332 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 73 transitions, 755 flow [2020-10-16 04:57:50,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:50,332 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:50,332 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:50,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:57:50,333 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:50,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:50,334 INFO L82 PathProgramCache]: Analyzing trace with hash -221806238, now seen corresponding path program 5 times [2020-10-16 04:57:50,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:50,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669645013] [2020-10-16 04:57:50,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:50,561 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:57:50,562 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669645013] [2020-10-16 04:57:50,562 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:50,562 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:50,562 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816469048] [2020-10-16 04:57:50,563 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:50,563 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:50,565 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 177 [2020-10-16 04:57:50,565 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 73 transitions, 755 flow. Second operand 8 states. [2020-10-16 04:57:50,565 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:50,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 177 [2020-10-16 04:57:50,566 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:51,045 INFO L129 PetriNetUnfolder]: 167/364 cut-off events. [2020-10-16 04:57:51,045 INFO L130 PetriNetUnfolder]: For 1693/1700 co-relation queries the response was YES. [2020-10-16 04:57:51,048 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1935 conditions, 364 events. 167/364 cut-off events. For 1693/1700 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1853 event pairs, 26 based on Foata normal form. 7/370 useless extension candidates. Maximal degree in co-relation 1908. Up to 160 conditions per place. [2020-10-16 04:57:51,052 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 49 selfloop transitions, 47 changer transitions 10/116 dead transitions. [2020-10-16 04:57:51,052 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 116 transitions, 1400 flow [2020-10-16 04:57:51,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:51,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1129 transitions. [2020-10-16 04:57:51,059 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7087256748273697 [2020-10-16 04:57:51,059 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1129 transitions. [2020-10-16 04:57:51,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1129 transitions. [2020-10-16 04:57:51,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:51,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1129 transitions. [2020-10-16 04:57:51,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:51,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:51,069 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:51,069 INFO L185 Difference]: Start difference. First operand has 65 places, 73 transitions, 755 flow. Second operand 9 states and 1129 transitions. [2020-10-16 04:57:51,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 116 transitions, 1400 flow [2020-10-16 04:57:51,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 116 transitions, 1316 flow, removed 5 selfloop flow, removed 6 redundant places. [2020-10-16 04:57:51,088 INFO L241 Difference]: Finished difference. Result has 72 places, 105 transitions, 1228 flow [2020-10-16 04:57:51,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1228, PETRI_PLACES=72, PETRI_TRANSITIONS=105} [2020-10-16 04:57:51,089 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 43 predicate places. [2020-10-16 04:57:51,089 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 105 transitions, 1228 flow [2020-10-16 04:57:51,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:51,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:51,089 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:51,090 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:57:51,090 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:51,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1911235642, now seen corresponding path program 6 times [2020-10-16 04:57:51,091 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:51,091 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568005689] [2020-10-16 04:57:51,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:51,650 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:57:51,651 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568005689] [2020-10-16 04:57:51,651 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:51,651 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 04:57:51,651 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957019321] [2020-10-16 04:57:51,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 04:57:51,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:51,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 04:57:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-16 04:57:51,654 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 177 [2020-10-16 04:57:51,655 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 105 transitions, 1228 flow. Second operand 11 states. [2020-10-16 04:57:51,655 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:51,655 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 177 [2020-10-16 04:57:51,656 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:52,461 INFO L129 PetriNetUnfolder]: 328/656 cut-off events. [2020-10-16 04:57:52,462 INFO L130 PetriNetUnfolder]: For 3393/3409 co-relation queries the response was YES. [2020-10-16 04:57:52,465 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3634 conditions, 656 events. 328/656 cut-off events. For 3393/3409 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3326 event pairs, 21 based on Foata normal form. 17/672 useless extension candidates. Maximal degree in co-relation 3602. Up to 282 conditions per place. [2020-10-16 04:57:52,471 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 86 selfloop transitions, 49 changer transitions 5/147 dead transitions. [2020-10-16 04:57:52,471 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 147 transitions, 1909 flow [2020-10-16 04:57:52,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:57:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:57:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1007 transitions. [2020-10-16 04:57:52,475 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6321406151914627 [2020-10-16 04:57:52,475 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1007 transitions. [2020-10-16 04:57:52,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1007 transitions. [2020-10-16 04:57:52,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:52,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1007 transitions. [2020-10-16 04:57:52,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:57:52,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:57:52,481 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:57:52,482 INFO L185 Difference]: Start difference. First operand has 72 places, 105 transitions, 1228 flow. Second operand 9 states and 1007 transitions. [2020-10-16 04:57:52,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 147 transitions, 1909 flow [2020-10-16 04:57:52,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 147 transitions, 1811 flow, removed 49 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:52,502 INFO L241 Difference]: Finished difference. Result has 80 places, 125 transitions, 1576 flow [2020-10-16 04:57:52,503 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1162, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1576, PETRI_PLACES=80, PETRI_TRANSITIONS=125} [2020-10-16 04:57:52,503 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 51 predicate places. [2020-10-16 04:57:52,503 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 125 transitions, 1576 flow [2020-10-16 04:57:52,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 04:57:52,503 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:52,503 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:52,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:57:52,504 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:52,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:52,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1821553916, now seen corresponding path program 7 times [2020-10-16 04:57:52,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:52,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657062638] [2020-10-16 04:57:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:52,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:52,710 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:57:52,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657062638] [2020-10-16 04:57:52,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:52,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 04:57:52,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317617402] [2020-10-16 04:57:52,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 04:57:52,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:52,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 04:57:52,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 04:57:52,713 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 177 [2020-10-16 04:57:52,713 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 125 transitions, 1576 flow. Second operand 8 states. [2020-10-16 04:57:52,714 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:52,714 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 177 [2020-10-16 04:57:52,714 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:53,315 INFO L129 PetriNetUnfolder]: 333/663 cut-off events. [2020-10-16 04:57:53,315 INFO L130 PetriNetUnfolder]: For 4160/4181 co-relation queries the response was YES. [2020-10-16 04:57:53,319 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3882 conditions, 663 events. 333/663 cut-off events. For 4160/4181 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3349 event pairs, 33 based on Foata normal form. 20/681 useless extension candidates. Maximal degree in co-relation 3846. Up to 452 conditions per place. [2020-10-16 04:57:53,323 INFO L132 encePairwiseOnDemand]: 167/177 looper letters, 93 selfloop transitions, 42 changer transitions 6/148 dead transitions. [2020-10-16 04:57:53,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 148 transitions, 2073 flow [2020-10-16 04:57:53,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 929 transitions. [2020-10-16 04:57:53,327 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6560734463276836 [2020-10-16 04:57:53,327 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 929 transitions. [2020-10-16 04:57:53,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 929 transitions. [2020-10-16 04:57:53,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:53,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 929 transitions. [2020-10-16 04:57:53,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:53,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:53,333 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:53,333 INFO L185 Difference]: Start difference. First operand has 80 places, 125 transitions, 1576 flow. Second operand 8 states and 929 transitions. [2020-10-16 04:57:53,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 148 transitions, 2073 flow [2020-10-16 04:57:53,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 148 transitions, 2015 flow, removed 28 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:53,355 INFO L241 Difference]: Finished difference. Result has 88 places, 136 transitions, 1800 flow [2020-10-16 04:57:53,355 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1800, PETRI_PLACES=88, PETRI_TRANSITIONS=136} [2020-10-16 04:57:53,356 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 59 predicate places. [2020-10-16 04:57:53,356 INFO L481 AbstractCegarLoop]: Abstraction has has 88 places, 136 transitions, 1800 flow [2020-10-16 04:57:53,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 04:57:53,356 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:53,356 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:53,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:57:53,357 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:53,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1409443024, now seen corresponding path program 8 times [2020-10-16 04:57:53,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:53,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334248740] [2020-10-16 04:57:53,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:53,912 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:57:53,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334248740] [2020-10-16 04:57:53,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:53,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 04:57:53,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936092098] [2020-10-16 04:57:53,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 04:57:53,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 04:57:53,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-16 04:57:53,916 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 177 [2020-10-16 04:57:53,917 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 136 transitions, 1800 flow. Second operand 11 states. [2020-10-16 04:57:53,918 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:53,918 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 177 [2020-10-16 04:57:53,918 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:54,720 INFO L129 PetriNetUnfolder]: 394/789 cut-off events. [2020-10-16 04:57:54,720 INFO L130 PetriNetUnfolder]: For 6210/6229 co-relation queries the response was YES. [2020-10-16 04:57:54,725 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4817 conditions, 789 events. 394/789 cut-off events. For 6210/6229 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 4172 event pairs, 34 based on Foata normal form. 18/807 useless extension candidates. Maximal degree in co-relation 4776. Up to 421 conditions per place. [2020-10-16 04:57:54,731 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 94 selfloop transitions, 10 changer transitions 60/171 dead transitions. [2020-10-16 04:57:54,732 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 171 transitions, 2516 flow [2020-10-16 04:57:54,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:57:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:57:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 903 transitions. [2020-10-16 04:57:54,736 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6377118644067796 [2020-10-16 04:57:54,736 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 903 transitions. [2020-10-16 04:57:54,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 903 transitions. [2020-10-16 04:57:54,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:54,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 903 transitions. [2020-10-16 04:57:54,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:57:54,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:57:54,740 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:57:54,741 INFO L185 Difference]: Start difference. First operand has 88 places, 136 transitions, 1800 flow. Second operand 8 states and 903 transitions. [2020-10-16 04:57:54,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 171 transitions, 2516 flow [2020-10-16 04:57:54,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 171 transitions, 2411 flow, removed 52 selfloop flow, removed 2 redundant places. [2020-10-16 04:57:54,773 INFO L241 Difference]: Finished difference. Result has 95 places, 108 transitions, 1410 flow [2020-10-16 04:57:54,773 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1739, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1410, PETRI_PLACES=95, PETRI_TRANSITIONS=108} [2020-10-16 04:57:54,774 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 66 predicate places. [2020-10-16 04:57:54,774 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 108 transitions, 1410 flow [2020-10-16 04:57:54,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 04:57:54,774 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:54,774 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:54,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:57:54,775 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:54,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:54,775 INFO L82 PathProgramCache]: Analyzing trace with hash 89535892, now seen corresponding path program 9 times [2020-10-16 04:57:54,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:54,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886562143] [2020-10-16 04:57:54,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:55,173 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:57:55,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886562143] [2020-10-16 04:57:55,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:55,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:55,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559991736] [2020-10-16 04:57:55,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:55,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:55,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:55,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:55,178 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 177 [2020-10-16 04:57:55,179 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 108 transitions, 1410 flow. Second operand 10 states. [2020-10-16 04:57:55,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:55,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 177 [2020-10-16 04:57:55,179 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:56,229 INFO L129 PetriNetUnfolder]: 163/435 cut-off events. [2020-10-16 04:57:56,230 INFO L130 PetriNetUnfolder]: For 3767/3784 co-relation queries the response was YES. [2020-10-16 04:57:56,233 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 435 events. 163/435 cut-off events. For 3767/3784 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2574 event pairs, 9 based on Foata normal form. 17/451 useless extension candidates. Maximal degree in co-relation 2788. Up to 115 conditions per place. [2020-10-16 04:57:56,236 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 84 selfloop transitions, 69 changer transitions 7/170 dead transitions. [2020-10-16 04:57:56,236 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 170 transitions, 2597 flow [2020-10-16 04:57:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 04:57:56,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 04:57:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1712 transitions. [2020-10-16 04:57:56,240 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6908797417271993 [2020-10-16 04:57:56,241 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1712 transitions. [2020-10-16 04:57:56,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1712 transitions. [2020-10-16 04:57:56,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:56,241 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1712 transitions. [2020-10-16 04:57:56,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 04:57:56,247 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 04:57:56,247 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 04:57:56,247 INFO L185 Difference]: Start difference. First operand has 95 places, 108 transitions, 1410 flow. Second operand 14 states and 1712 transitions. [2020-10-16 04:57:56,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 170 transitions, 2597 flow [2020-10-16 04:57:56,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 170 transitions, 2426 flow, removed 57 selfloop flow, removed 10 redundant places. [2020-10-16 04:57:56,269 INFO L241 Difference]: Finished difference. Result has 98 places, 138 transitions, 1944 flow [2020-10-16 04:57:56,269 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1944, PETRI_PLACES=98, PETRI_TRANSITIONS=138} [2020-10-16 04:57:56,270 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 69 predicate places. [2020-10-16 04:57:56,270 INFO L481 AbstractCegarLoop]: Abstraction has has 98 places, 138 transitions, 1944 flow [2020-10-16 04:57:56,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:56,270 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:56,270 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:56,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:57:56,271 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:56,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1221920552, now seen corresponding path program 10 times [2020-10-16 04:57:56,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:56,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562249225] [2020-10-16 04:57:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:56,480 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:57:56,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562249225] [2020-10-16 04:57:56,481 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:56,481 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:56,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813241800] [2020-10-16 04:57:56,482 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:56,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:56,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:56,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:56,486 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 177 [2020-10-16 04:57:56,491 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 138 transitions, 1944 flow. Second operand 9 states. [2020-10-16 04:57:56,492 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:56,492 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 177 [2020-10-16 04:57:56,492 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:57,196 INFO L129 PetriNetUnfolder]: 168/463 cut-off events. [2020-10-16 04:57:57,196 INFO L130 PetriNetUnfolder]: For 5180/5212 co-relation queries the response was YES. [2020-10-16 04:57:57,199 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3191 conditions, 463 events. 168/463 cut-off events. For 5180/5212 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2884 event pairs, 6 based on Foata normal form. 16/479 useless extension candidates. Maximal degree in co-relation 3147. Up to 129 conditions per place. [2020-10-16 04:57:57,201 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 70 selfloop transitions, 46 changer transitions 37/163 dead transitions. [2020-10-16 04:57:57,201 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 163 transitions, 2568 flow [2020-10-16 04:57:57,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:57:57,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:57:57,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1238 transitions. [2020-10-16 04:57:57,204 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6994350282485876 [2020-10-16 04:57:57,204 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1238 transitions. [2020-10-16 04:57:57,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1238 transitions. [2020-10-16 04:57:57,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:57,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1238 transitions. [2020-10-16 04:57:57,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:57:57,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:57:57,209 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:57:57,209 INFO L185 Difference]: Start difference. First operand has 98 places, 138 transitions, 1944 flow. Second operand 10 states and 1238 transitions. [2020-10-16 04:57:57,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 163 transitions, 2568 flow [2020-10-16 04:57:57,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 163 transitions, 2456 flow, removed 51 selfloop flow, removed 5 redundant places. [2020-10-16 04:57:57,237 INFO L241 Difference]: Finished difference. Result has 102 places, 118 transitions, 1630 flow [2020-10-16 04:57:57,238 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1630, PETRI_PLACES=102, PETRI_TRANSITIONS=118} [2020-10-16 04:57:57,238 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 73 predicate places. [2020-10-16 04:57:57,238 INFO L481 AbstractCegarLoop]: Abstraction has has 102 places, 118 transitions, 1630 flow [2020-10-16 04:57:57,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:57,238 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:57,238 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:57:57,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 04:57:57,239 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:57,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:57,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2134993630, now seen corresponding path program 11 times [2020-10-16 04:57:57,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:57,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501719496] [2020-10-16 04:57:57,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:57,563 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:57:57,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501719496] [2020-10-16 04:57:57,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:57,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:57,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645697543] [2020-10-16 04:57:57,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:57,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:57,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:57,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:57,566 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 177 [2020-10-16 04:57:57,567 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 118 transitions, 1630 flow. Second operand 9 states. [2020-10-16 04:57:57,567 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:57,567 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 177 [2020-10-16 04:57:57,567 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:58,276 INFO L129 PetriNetUnfolder]: 286/631 cut-off events. [2020-10-16 04:57:58,276 INFO L130 PetriNetUnfolder]: For 7790/7809 co-relation queries the response was YES. [2020-10-16 04:57:58,278 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3996 conditions, 631 events. 286/631 cut-off events. For 7790/7809 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3423 event pairs, 13 based on Foata normal form. 15/644 useless extension candidates. Maximal degree in co-relation 3952. Up to 161 conditions per place. [2020-10-16 04:57:58,281 INFO L132 encePairwiseOnDemand]: 167/177 looper letters, 90 selfloop transitions, 12 changer transitions 65/174 dead transitions. [2020-10-16 04:57:58,281 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 174 transitions, 2623 flow [2020-10-16 04:57:58,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 04:57:58,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 04:57:58,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1185 transitions. [2020-10-16 04:57:58,284 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6694915254237288 [2020-10-16 04:57:58,284 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1185 transitions. [2020-10-16 04:57:58,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1185 transitions. [2020-10-16 04:57:58,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:58,284 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1185 transitions. [2020-10-16 04:57:58,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 04:57:58,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 04:57:58,288 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 04:57:58,288 INFO L185 Difference]: Start difference. First operand has 102 places, 118 transitions, 1630 flow. Second operand 10 states and 1185 transitions. [2020-10-16 04:57:58,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 174 transitions, 2623 flow [2020-10-16 04:57:58,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 174 transitions, 2518 flow, removed 19 selfloop flow, removed 7 redundant places. [2020-10-16 04:57:58,318 INFO L241 Difference]: Finished difference. Result has 109 places, 87 transitions, 1094 flow [2020-10-16 04:57:58,318 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1557, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1094, PETRI_PLACES=109, PETRI_TRANSITIONS=87} [2020-10-16 04:57:58,318 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 80 predicate places. [2020-10-16 04:57:58,318 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 87 transitions, 1094 flow [2020-10-16 04:57:58,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:57:58,319 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:58,319 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:57:58,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 04:57:58,319 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:58,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1295041602, now seen corresponding path program 1 times [2020-10-16 04:57:58,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:58,320 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678443855] [2020-10-16 04:57:58,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:58,788 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:57:58,788 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678443855] [2020-10-16 04:57:58,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:58,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:57:58,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258684014] [2020-10-16 04:57:58,790 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:57:58,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:58,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:57:58,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:57:58,793 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 177 [2020-10-16 04:57:58,793 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 87 transitions, 1094 flow. Second operand 10 states. [2020-10-16 04:57:58,793 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:58,794 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 177 [2020-10-16 04:57:58,794 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:57:59,641 INFO L129 PetriNetUnfolder]: 193/456 cut-off events. [2020-10-16 04:57:59,641 INFO L130 PetriNetUnfolder]: For 4669/4684 co-relation queries the response was YES. [2020-10-16 04:57:59,644 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2862 conditions, 456 events. 193/456 cut-off events. For 4669/4684 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 2354 event pairs, 16 based on Foata normal form. 13/468 useless extension candidates. Maximal degree in co-relation 2815. Up to 187 conditions per place. [2020-10-16 04:57:59,648 INFO L132 encePairwiseOnDemand]: 168/177 looper letters, 71 selfloop transitions, 34 changer transitions 13/125 dead transitions. [2020-10-16 04:57:59,648 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 125 transitions, 1720 flow [2020-10-16 04:57:59,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 04:57:59,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 04:57:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1335 transitions. [2020-10-16 04:57:59,651 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6285310734463276 [2020-10-16 04:57:59,651 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1335 transitions. [2020-10-16 04:57:59,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1335 transitions. [2020-10-16 04:57:59,651 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:57:59,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1335 transitions. [2020-10-16 04:57:59,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 04:57:59,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 04:57:59,654 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 04:57:59,654 INFO L185 Difference]: Start difference. First operand has 109 places, 87 transitions, 1094 flow. Second operand 12 states and 1335 transitions. [2020-10-16 04:57:59,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 125 transitions, 1720 flow [2020-10-16 04:57:59,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 125 transitions, 1628 flow, removed 12 selfloop flow, removed 10 redundant places. [2020-10-16 04:57:59,672 INFO L241 Difference]: Finished difference. Result has 110 places, 94 transitions, 1236 flow [2020-10-16 04:57:59,672 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1236, PETRI_PLACES=110, PETRI_TRANSITIONS=94} [2020-10-16 04:57:59,672 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 81 predicate places. [2020-10-16 04:57:59,672 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 94 transitions, 1236 flow [2020-10-16 04:57:59,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:57:59,672 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:57:59,673 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:57:59,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 04:57:59,673 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:57:59,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:57:59,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1360255062, now seen corresponding path program 2 times [2020-10-16 04:57:59,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:57:59,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419620816] [2020-10-16 04:57:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:57:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:57:59,954 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:57:59,955 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419620816] [2020-10-16 04:57:59,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:57:59,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:57:59,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745984031] [2020-10-16 04:57:59,956 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:57:59,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:57:59,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:57:59,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:57:59,958 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 177 [2020-10-16 04:57:59,958 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 94 transitions, 1236 flow. Second operand 9 states. [2020-10-16 04:57:59,958 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:57:59,959 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 177 [2020-10-16 04:57:59,959 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:00,612 INFO L129 PetriNetUnfolder]: 187/447 cut-off events. [2020-10-16 04:58:00,612 INFO L130 PetriNetUnfolder]: For 4714/4729 co-relation queries the response was YES. [2020-10-16 04:58:00,614 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2880 conditions, 447 events. 187/447 cut-off events. For 4714/4729 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2279 event pairs, 32 based on Foata normal form. 8/454 useless extension candidates. Maximal degree in co-relation 2831. Up to 233 conditions per place. [2020-10-16 04:58:00,617 INFO L132 encePairwiseOnDemand]: 166/177 looper letters, 58 selfloop transitions, 32 changer transitions 21/118 dead transitions. [2020-10-16 04:58:00,617 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 118 transitions, 1608 flow [2020-10-16 04:58:00,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 04:58:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 04:58:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1377 transitions. [2020-10-16 04:58:00,619 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6483050847457628 [2020-10-16 04:58:00,619 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1377 transitions. [2020-10-16 04:58:00,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1377 transitions. [2020-10-16 04:58:00,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:00,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1377 transitions. [2020-10-16 04:58:00,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 04:58:00,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 04:58:00,622 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 04:58:00,622 INFO L185 Difference]: Start difference. First operand has 110 places, 94 transitions, 1236 flow. Second operand 12 states and 1377 transitions. [2020-10-16 04:58:00,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 118 transitions, 1608 flow [2020-10-16 04:58:00,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 118 transitions, 1535 flow, removed 12 selfloop flow, removed 8 redundant places. [2020-10-16 04:58:00,638 INFO L241 Difference]: Finished difference. Result has 115 places, 88 transitions, 1188 flow [2020-10-16 04:58:00,638 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1165, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1188, PETRI_PLACES=115, PETRI_TRANSITIONS=88} [2020-10-16 04:58:00,638 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 86 predicate places. [2020-10-16 04:58:00,639 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 88 transitions, 1188 flow [2020-10-16 04:58:00,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:58:00,639 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:00,639 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:58:00,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 04:58:00,639 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1095261254, now seen corresponding path program 3 times [2020-10-16 04:58:00,640 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:00,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905419202] [2020-10-16 04:58:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:01,096 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:58:01,096 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905419202] [2020-10-16 04:58:01,096 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:01,097 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 04:58:01,097 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455449027] [2020-10-16 04:58:01,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 04:58:01,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:01,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 04:58:01,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-16 04:58:01,100 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 177 [2020-10-16 04:58:01,102 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 88 transitions, 1188 flow. Second operand 11 states. [2020-10-16 04:58:01,102 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:01,102 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 177 [2020-10-16 04:58:01,102 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:01,822 INFO L129 PetriNetUnfolder]: 70/221 cut-off events. [2020-10-16 04:58:01,822 INFO L130 PetriNetUnfolder]: For 2177/2187 co-relation queries the response was YES. [2020-10-16 04:58:01,824 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 221 events. 70/221 cut-off events. For 2177/2187 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1108 event pairs, 11 based on Foata normal form. 8/229 useless extension candidates. Maximal degree in co-relation 1408. Up to 77 conditions per place. [2020-10-16 04:58:01,826 INFO L132 encePairwiseOnDemand]: 169/177 looper letters, 44 selfloop transitions, 12 changer transitions 22/91 dead transitions. [2020-10-16 04:58:01,826 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 91 transitions, 1400 flow [2020-10-16 04:58:01,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:58:01,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:58:01,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1100 transitions. [2020-10-16 04:58:01,829 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6905210295040803 [2020-10-16 04:58:01,829 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1100 transitions. [2020-10-16 04:58:01,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1100 transitions. [2020-10-16 04:58:01,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:01,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1100 transitions. [2020-10-16 04:58:01,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:58:01,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:58:01,833 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:58:01,833 INFO L185 Difference]: Start difference. First operand has 115 places, 88 transitions, 1188 flow. Second operand 9 states and 1100 transitions. [2020-10-16 04:58:01,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 91 transitions, 1400 flow [2020-10-16 04:58:01,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 91 transitions, 1237 flow, removed 19 selfloop flow, removed 15 redundant places. [2020-10-16 04:58:01,849 INFO L241 Difference]: Finished difference. Result has 108 places, 68 transitions, 777 flow [2020-10-16 04:58:01,850 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=1027, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=777, PETRI_PLACES=108, PETRI_TRANSITIONS=68} [2020-10-16 04:58:01,850 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 79 predicate places. [2020-10-16 04:58:01,850 INFO L481 AbstractCegarLoop]: Abstraction has has 108 places, 68 transitions, 777 flow [2020-10-16 04:58:01,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 04:58:01,850 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:01,851 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:58:01,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 04:58:01,851 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:01,852 INFO L82 PathProgramCache]: Analyzing trace with hash -419601427, now seen corresponding path program 1 times [2020-10-16 04:58:01,852 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:01,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48287756] [2020-10-16 04:58:01,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:02,033 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:58:02,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48287756] [2020-10-16 04:58:02,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:02,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:58:02,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666515745] [2020-10-16 04:58:02,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:58:02,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:02,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:58:02,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:58:02,038 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 177 [2020-10-16 04:58:02,038 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 68 transitions, 777 flow. Second operand 7 states. [2020-10-16 04:58:02,039 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:02,039 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 177 [2020-10-16 04:58:02,039 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:02,339 INFO L129 PetriNetUnfolder]: 43/157 cut-off events. [2020-10-16 04:58:02,339 INFO L130 PetriNetUnfolder]: For 1581/1592 co-relation queries the response was YES. [2020-10-16 04:58:02,340 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 157 events. 43/157 cut-off events. For 1581/1592 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 687 event pairs, 7 based on Foata normal form. 7/164 useless extension candidates. Maximal degree in co-relation 965. Up to 48 conditions per place. [2020-10-16 04:58:02,341 INFO L132 encePairwiseOnDemand]: 171/177 looper letters, 27 selfloop transitions, 9 changer transitions 24/75 dead transitions. [2020-10-16 04:58:02,341 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 75 transitions, 1002 flow [2020-10-16 04:58:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:58:02,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:58:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 790 transitions. [2020-10-16 04:58:02,342 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.743879472693032 [2020-10-16 04:58:02,343 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 790 transitions. [2020-10-16 04:58:02,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 790 transitions. [2020-10-16 04:58:02,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:02,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 790 transitions. [2020-10-16 04:58:02,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:58:02,346 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:58:02,346 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:58:02,346 INFO L185 Difference]: Start difference. First operand has 108 places, 68 transitions, 777 flow. Second operand 6 states and 790 transitions. [2020-10-16 04:58:02,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 75 transitions, 1002 flow [2020-10-16 04:58:02,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 75 transitions, 885 flow, removed 24 selfloop flow, removed 16 redundant places. [2020-10-16 04:58:02,353 INFO L241 Difference]: Finished difference. Result has 94 places, 47 transitions, 455 flow [2020-10-16 04:58:02,353 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=676, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=94, PETRI_TRANSITIONS=47} [2020-10-16 04:58:02,353 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 65 predicate places. [2020-10-16 04:58:02,353 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 47 transitions, 455 flow [2020-10-16 04:58:02,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:58:02,354 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:02,354 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:58:02,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 04:58:02,354 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:02,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2034962373, now seen corresponding path program 1 times [2020-10-16 04:58:02,355 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:02,355 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608473859] [2020-10-16 04:58:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:02,840 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:58:02,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608473859] [2020-10-16 04:58:02,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:02,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 04:58:02,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592530765] [2020-10-16 04:58:02,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 04:58:02,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 04:58:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-16 04:58:02,843 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 177 [2020-10-16 04:58:02,844 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 47 transitions, 455 flow. Second operand 11 states. [2020-10-16 04:58:02,844 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:02,844 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 177 [2020-10-16 04:58:02,844 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:03,146 INFO L129 PetriNetUnfolder]: 31/102 cut-off events. [2020-10-16 04:58:03,146 INFO L130 PetriNetUnfolder]: For 763/767 co-relation queries the response was YES. [2020-10-16 04:58:03,147 INFO L80 FinitePrefix]: Finished finitePrefix Result has 583 conditions, 102 events. 31/102 cut-off events. For 763/767 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 345 event pairs, 8 based on Foata normal form. 3/105 useless extension candidates. Maximal degree in co-relation 553. Up to 37 conditions per place. [2020-10-16 04:58:03,148 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 17 selfloop transitions, 2 changer transitions 19/48 dead transitions. [2020-10-16 04:58:03,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 48 transitions, 553 flow [2020-10-16 04:58:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:58:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:58:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 982 transitions. [2020-10-16 04:58:03,149 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.693502824858757 [2020-10-16 04:58:03,150 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 982 transitions. [2020-10-16 04:58:03,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 982 transitions. [2020-10-16 04:58:03,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:03,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 982 transitions. [2020-10-16 04:58:03,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:58:03,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:58:03,152 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:58:03,152 INFO L185 Difference]: Start difference. First operand has 94 places, 47 transitions, 455 flow. Second operand 8 states and 982 transitions. [2020-10-16 04:58:03,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 48 transitions, 553 flow [2020-10-16 04:58:03,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 48 transitions, 435 flow, removed 17 selfloop flow, removed 21 redundant places. [2020-10-16 04:58:03,155 INFO L241 Difference]: Finished difference. Result has 75 places, 29 transitions, 217 flow [2020-10-16 04:58:03,155 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=217, PETRI_PLACES=75, PETRI_TRANSITIONS=29} [2020-10-16 04:58:03,156 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 46 predicate places. [2020-10-16 04:58:03,156 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 29 transitions, 217 flow [2020-10-16 04:58:03,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 04:58:03,156 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:58:03,156 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:58:03,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 04:58:03,156 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 04:58:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:58:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2004217117, now seen corresponding path program 1 times [2020-10-16 04:58:03,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:58:03,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088119386] [2020-10-16 04:58:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:58:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:58:03,756 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:58:03,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088119386] [2020-10-16 04:58:03,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:58:03,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 04:58:03,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8572208] [2020-10-16 04:58:03,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 04:58:03,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:58:03,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 04:58:03,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-16 04:58:03,759 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 177 [2020-10-16 04:58:03,760 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 29 transitions, 217 flow. Second operand 10 states. [2020-10-16 04:58:03,760 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:58:03,760 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 177 [2020-10-16 04:58:03,760 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:58:04,145 INFO L129 PetriNetUnfolder]: 16/58 cut-off events. [2020-10-16 04:58:04,145 INFO L130 PetriNetUnfolder]: For 202/203 co-relation queries the response was YES. [2020-10-16 04:58:04,145 INFO L80 FinitePrefix]: Finished finitePrefix Result has 289 conditions, 58 events. 16/58 cut-off events. For 202/203 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 139 event pairs, 5 based on Foata normal form. 2/60 useless extension candidates. Maximal degree in co-relation 266. Up to 22 conditions per place. [2020-10-16 04:58:04,146 INFO L132 encePairwiseOnDemand]: 170/177 looper letters, 0 selfloop transitions, 0 changer transitions 28/28 dead transitions. [2020-10-16 04:58:04,146 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 28 transitions, 247 flow [2020-10-16 04:58:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 04:58:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 04:58:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 940 transitions. [2020-10-16 04:58:04,148 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6638418079096046 [2020-10-16 04:58:04,148 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 940 transitions. [2020-10-16 04:58:04,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 940 transitions. [2020-10-16 04:58:04,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:58:04,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 940 transitions. [2020-10-16 04:58:04,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 04:58:04,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 04:58:04,151 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 04:58:04,151 INFO L185 Difference]: Start difference. First operand has 75 places, 29 transitions, 217 flow. Second operand 8 states and 940 transitions. [2020-10-16 04:58:04,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 28 transitions, 247 flow [2020-10-16 04:58:04,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 28 transitions, 199 flow, removed 10 selfloop flow, removed 14 redundant places. [2020-10-16 04:58:04,153 INFO L241 Difference]: Finished difference. Result has 53 places, 0 transitions, 0 flow [2020-10-16 04:58:04,153 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=177, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=53, PETRI_TRANSITIONS=0} [2020-10-16 04:58:04,153 INFO L342 CegarLoopForPetriNet]: 29 programPoint places, 24 predicate places. [2020-10-16 04:58:04,153 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 0 transitions, 0 flow [2020-10-16 04:58:04,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 04:58:04,154 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 04:58:04,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:58:04 BasicIcfg [2020-10-16 04:58:04,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:58:04,160 INFO L168 Benchmark]: Toolchain (without parser) took 36354.49 ms. Allocated memory was 248.0 MB in the beginning and 940.0 MB in the end (delta: 692.1 MB). Free memory was 203.5 MB in the beginning and 453.3 MB in the end (delta: -249.8 MB). Peak memory consumption was 442.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:04,161 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:58:04,161 INFO L168 Benchmark]: CACSL2BoogieTranslator took 837.10 ms. Allocated memory was 248.0 MB in the beginning and 304.6 MB in the end (delta: 56.6 MB). Free memory was 203.5 MB in the beginning and 250.1 MB in the end (delta: -46.6 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:04,162 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.47 ms. Allocated memory is still 304.6 MB. Free memory was 250.1 MB in the beginning and 245.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:04,162 INFO L168 Benchmark]: Boogie Preprocessor took 72.50 ms. Allocated memory is still 304.6 MB. Free memory was 245.1 MB in the beginning and 240.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:04,163 INFO L168 Benchmark]: RCFGBuilder took 4578.42 ms. Allocated memory was 304.6 MB in the beginning and 431.5 MB in the end (delta: 126.9 MB). Free memory was 240.0 MB in the beginning and 230.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 161.7 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:04,164 INFO L168 Benchmark]: TraceAbstraction took 30776.40 ms. Allocated memory was 431.5 MB in the beginning and 940.0 MB in the end (delta: 508.6 MB). Free memory was 230.6 MB in the beginning and 453.3 MB in the end (delta: -222.7 MB). Peak memory consumption was 285.8 MB. Max. memory is 14.2 GB. [2020-10-16 04:58:04,167 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.24 ms. Allocated memory is still 248.0 MB. Free memory is still 224.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 837.10 ms. Allocated memory was 248.0 MB in the beginning and 304.6 MB in the end (delta: 56.6 MB). Free memory was 203.5 MB in the beginning and 250.1 MB in the end (delta: -46.6 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 84.47 ms. Allocated memory is still 304.6 MB. Free memory was 250.1 MB in the beginning and 245.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 72.50 ms. Allocated memory is still 304.6 MB. Free memory was 245.1 MB in the beginning and 240.0 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * RCFGBuilder took 4578.42 ms. Allocated memory was 304.6 MB in the beginning and 431.5 MB in the end (delta: 126.9 MB). Free memory was 240.0 MB in the beginning and 230.6 MB in the end (delta: 9.4 MB). Peak memory consumption was 161.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 30776.40 ms. Allocated memory was 431.5 MB in the beginning and 940.0 MB in the end (delta: 508.6 MB). Free memory was 230.6 MB in the beginning and 453.3 MB in the end (delta: -222.7 MB). Peak memory consumption was 285.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 707 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 46 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 78 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.3s, 98 PlacesBefore, 29 PlacesAfterwards, 93 TransitionsBefore, 23 TransitionsAfterwards, 1152 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 4041 MoverChecksTotal - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 94 locations, 3 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: SAFE, OverallTime: 30.6s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 13.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 188 SDtfs, 234 SDslu, 484 SDs, 0 SdLazy, 2366 SolverSat, 491 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1944occurred in iteration=17, 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, 1.2s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 350 NumberOfCodeBlocks, 350 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 325 ConstructedInterpolants, 0 QuantifiedInterpolants, 71547 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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 correct! Received shutdown request...