/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:32:37,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:32:37,296 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:32:37,337 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:32:37,337 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:32:37,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:32:37,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:32:37,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:32:37,354 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:32:37,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:32:37,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:32:37,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:32:37,361 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:32:37,362 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:32:37,363 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:32:37,364 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:32:37,365 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:32:37,366 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:32:37,367 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:32:37,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:32:37,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:32:37,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:32:37,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:32:37,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:32:37,375 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:32:37,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:32:37,376 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:32:37,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:32:37,377 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:32:37,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:32:37,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:32:37,378 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:32:37,379 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:32:37,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:32:37,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:32:37,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:32:37,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:32:37,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:32:37,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:32:37,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:32:37,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:32:37,384 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2020-10-16 01:32:37,406 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:32:37,406 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:32:37,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:32:37,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:32:37,408 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:32:37,408 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:32:37,408 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:32:37,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:32:37,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:32:37,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:32:37,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:32:37,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:32:37,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:32:37,410 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:32:37,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:32:37,410 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:32:37,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:32:37,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:32:37,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:32:37,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:32:37,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:32:37,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:32:37,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:32:37,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:32:37,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:32:37,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:32:37,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:32:37,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:32:37,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:32:37,730 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:32:37,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:32:37,751 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:32:37,753 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:32:37,753 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:32:37,753 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_rmo.oepc.i [2020-10-16 01:32:37,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d791283f/653ab1fa01e14eb9b026202d1b8fb256/FLAG5e5df6a23 [2020-10-16 01:32:38,390 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:32:38,391 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_rmo.oepc.i [2020-10-16 01:32:38,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d791283f/653ab1fa01e14eb9b026202d1b8fb256/FLAG5e5df6a23 [2020-10-16 01:32:38,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d791283f/653ab1fa01e14eb9b026202d1b8fb256 [2020-10-16 01:32:38,668 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:32:38,670 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:32:38,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:32:38,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:32:38,675 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:32:38,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:32:38" (1/1) ... [2020-10-16 01:32:38,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b6f427d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:38, skipping insertion in model container [2020-10-16 01:32:38,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:32:38" (1/1) ... [2020-10-16 01:32:38,688 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:32:38,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:32:39,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:32:39,299 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:32:39,416 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:32:39,488 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:32:39,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39 WrapperNode [2020-10-16 01:32:39,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:32:39,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:32:39,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:32:39,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:32:39,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:32:39,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:32:39,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:32:39,560 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:32:39,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,577 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,603 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... [2020-10-16 01:32:39,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:32:39,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:32:39,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:32:39,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:32:39,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:32:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:32:39,693 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:32:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:32:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:32:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:32:39,694 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:32:39,694 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:32:39,695 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:32:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:32:39,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:32:39,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:32:39,698 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 01:32:43,431 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:32:43,432 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:32:43,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:32:43 BoogieIcfgContainer [2020-10-16 01:32:43,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:32:43,440 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:32:43,440 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:32:43,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:32:43,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:32:38" (1/3) ... [2020-10-16 01:32:43,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1f4bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:32:43, skipping insertion in model container [2020-10-16 01:32:43,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:32:39" (2/3) ... [2020-10-16 01:32:43,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1f4bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:32:43, skipping insertion in model container [2020-10-16 01:32:43,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:32:43" (3/3) ... [2020-10-16 01:32:43,454 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_rmo.oepc.i [2020-10-16 01:32:43,467 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:32:43,477 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:32:43,478 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:32:43,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,531 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,532 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,546 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,547 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,549 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,551 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,552 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,552 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,555 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,556 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,557 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,558 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,559 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,560 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,561 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,630 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,631 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,632 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,640 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,641 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,643 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,649 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,651 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,659 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,660 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,661 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,662 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,664 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:32:43,684 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:32:43,707 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:32:43,708 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:32:43,708 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:32:43,708 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:32:43,708 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:32:43,708 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:32:43,708 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:32:43,709 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:32:43,722 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 01:32:43,763 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 01:32:43,764 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:43,769 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 01:32:43,769 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 01:32:43,778 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2020-10-16 01:32:43,781 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:32:43,784 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 01:32:43,787 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 01:32:43,788 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2020-10-16 01:32:43,826 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 01:32:43,826 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:43,827 INFO L80 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 78 events. 2/78 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 48. Up to 2 conditions per place. [2020-10-16 01:32:43,832 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-16 01:32:43,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:43,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:43,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:43,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:43,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:43,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:43,946 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:43,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:43,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:43,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:43,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:43,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:43,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:43,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:43,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:43,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:44,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:44,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,126 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:44,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:44,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:44,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:44,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,329 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:32:44,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,748 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:44,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:44,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:44,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:44,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:44,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:44,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:44,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:44,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:44,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:44,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:44,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:44,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:45,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:45,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:45,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:45,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:45,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:45,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:45,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:45,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:45,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:45,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,507 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:32:45,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:45,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:45,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:45,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:45,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:45,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:45,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:45,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:45,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:45,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,787 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:45,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:45,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:45,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:45,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:45,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:45,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:45,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:45,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:45,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:45,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:45,927 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:45,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:45,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:45,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:45,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:45,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:46,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:46,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:46,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 01:32:46,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,377 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:46,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:46,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:46,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:46,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:46,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,479 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:46,489 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:46,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-16 01:32:46,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:46,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:46,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:46,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:46,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:46,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:46,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,569 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:46,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:46,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:46,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:46,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:46,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:46,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:46,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:46,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:46,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:46,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:46,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:46,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:47,010 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 01:32:47,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:47,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:47,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:47,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:47,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:47,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:47,183 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:47,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:47,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:32:47,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:47,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:47,320 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:47,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:47,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:32:47,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:47,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:32:47,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:47,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:47,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:47,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:47,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:47,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:32:47,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:32:47,477 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:47,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:32:47,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:32:47,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:47,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:32:47,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:32:47,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:47,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:47,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:47,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:47,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:32:47,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:32:47,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:32:47,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:47,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:47,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:47,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:32:47,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:32:48,215 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 01:32:48,313 INFO L132 LiptonReduction]: Checked pairs total: 2967 [2020-10-16 01:32:48,313 INFO L134 LiptonReduction]: Total number of compositions: 69 [2020-10-16 01:32:48,316 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4537 [2020-10-16 01:32:48,323 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2020-10-16 01:32:48,323 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:48,324 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:48,325 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 01:32:48,325 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:48,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1583910661, now seen corresponding path program 1 times [2020-10-16 01:32:48,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:48,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659505626] [2020-10-16 01:32:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:48,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:48,591 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659505626] [2020-10-16 01:32:48,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:48,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:32:48,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858384734] [2020-10-16 01:32:48,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:32:48,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:48,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:32:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:32:48,623 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 149 [2020-10-16 01:32:48,625 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states. [2020-10-16 01:32:48,625 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:48,625 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 149 [2020-10-16 01:32:48,627 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:48,758 INFO L129 PetriNetUnfolder]: 57/144 cut-off events. [2020-10-16 01:32:48,758 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:48,760 INFO L80 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 144 events. 57/144 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 603 event pairs, 6 based on Foata normal form. 16/155 useless extension candidates. Maximal degree in co-relation 248. Up to 88 conditions per place. [2020-10-16 01:32:48,762 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 12 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2020-10-16 01:32:48,762 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 82 flow [2020-10-16 01:32:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:32:48,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:32:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2020-10-16 01:32:48,780 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8232662192393736 [2020-10-16 01:32:48,781 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 368 transitions. [2020-10-16 01:32:48,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 368 transitions. [2020-10-16 01:32:48,784 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:48,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 368 transitions. [2020-10-16 01:32:48,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:32:48,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:32:48,799 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:32:48,802 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 48 flow. Second operand 3 states and 368 transitions. [2020-10-16 01:32:48,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 82 flow [2020-10-16 01:32:48,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:48,808 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 46 flow [2020-10-16 01:32:48,811 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, 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=3, PETRI_FLOW=46, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2020-10-16 01:32:48,812 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 01:32:48,812 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 46 flow [2020-10-16 01:32:48,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:32:48,812 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:48,812 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:48,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:32:48,813 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:48,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:48,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1773772219, now seen corresponding path program 1 times [2020-10-16 01:32:48,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:48,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243321476] [2020-10-16 01:32:48,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:49,020 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243321476] [2020-10-16 01:32:49,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:49,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 01:32:49,021 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841810481] [2020-10-16 01:32:49,022 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:32:49,023 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:49,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:32:49,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:32:49,025 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 149 [2020-10-16 01:32:49,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 46 flow. Second operand 4 states. [2020-10-16 01:32:49,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:49,026 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 149 [2020-10-16 01:32:49,026 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:49,082 INFO L129 PetriNetUnfolder]: 1/28 cut-off events. [2020-10-16 01:32:49,083 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:32:49,083 INFO L80 FinitePrefix]: Finished finitePrefix Result has 47 conditions, 28 events. 1/28 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 53 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 38. Up to 5 conditions per place. [2020-10-16 01:32:49,083 INFO L132 encePairwiseOnDemand]: 145/149 looper letters, 2 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2020-10-16 01:32:49,083 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 72 flow [2020-10-16 01:32:49,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:49,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 606 transitions. [2020-10-16 01:32:49,088 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8134228187919463 [2020-10-16 01:32:49,088 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 606 transitions. [2020-10-16 01:32:49,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 606 transitions. [2020-10-16 01:32:49,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:49,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 606 transitions. [2020-10-16 01:32:49,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:49,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:49,094 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:49,094 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 46 flow. Second operand 5 states and 606 transitions. [2020-10-16 01:32:49,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 72 flow [2020-10-16 01:32:49,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:32:49,095 INFO L241 Difference]: Finished difference. Result has 31 places, 18 transitions, 52 flow [2020-10-16 01:32:49,096 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, 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=52, PETRI_PLACES=31, PETRI_TRANSITIONS=18} [2020-10-16 01:32:49,096 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 4 predicate places. [2020-10-16 01:32:49,097 INFO L481 AbstractCegarLoop]: Abstraction has has 31 places, 18 transitions, 52 flow [2020-10-16 01:32:49,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:32:49,097 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:49,097 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:49,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:32:49,097 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:49,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:49,098 INFO L82 PathProgramCache]: Analyzing trace with hash 324774380, now seen corresponding path program 1 times [2020-10-16 01:32:49,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:49,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411439689] [2020-10-16 01:32:49,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:49,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:49,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411439689] [2020-10-16 01:32:49,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:49,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:49,329 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107931927] [2020-10-16 01:32:49,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:49,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:49,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:49,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:49,332 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 149 [2020-10-16 01:32:49,332 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 18 transitions, 52 flow. Second operand 6 states. [2020-10-16 01:32:49,332 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:49,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 149 [2020-10-16 01:32:49,333 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:49,700 INFO L129 PetriNetUnfolder]: 83/179 cut-off events. [2020-10-16 01:32:49,700 INFO L130 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2020-10-16 01:32:49,702 INFO L80 FinitePrefix]: Finished finitePrefix Result has 397 conditions, 179 events. 83/179 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 684 event pairs, 8 based on Foata normal form. 12/190 useless extension candidates. Maximal degree in co-relation 385. Up to 96 conditions per place. [2020-10-16 01:32:49,704 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 21 selfloop transitions, 6 changer transitions 12/45 dead transitions. [2020-10-16 01:32:49,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 199 flow [2020-10-16 01:32:49,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:32:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:32:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 862 transitions. [2020-10-16 01:32:49,709 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6428038777032066 [2020-10-16 01:32:49,710 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 862 transitions. [2020-10-16 01:32:49,710 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 862 transitions. [2020-10-16 01:32:49,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:49,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 862 transitions. [2020-10-16 01:32:49,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:32:49,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:32:49,719 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:32:49,719 INFO L185 Difference]: Start difference. First operand has 31 places, 18 transitions, 52 flow. Second operand 9 states and 862 transitions. [2020-10-16 01:32:49,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 199 flow [2020-10-16 01:32:49,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 45 transitions, 185 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:49,724 INFO L241 Difference]: Finished difference. Result has 39 places, 21 transitions, 90 flow [2020-10-16 01:32:49,724 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=90, PETRI_PLACES=39, PETRI_TRANSITIONS=21} [2020-10-16 01:32:49,724 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2020-10-16 01:32:49,724 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 21 transitions, 90 flow [2020-10-16 01:32:49,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:49,724 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:49,724 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:49,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:32:49,725 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:49,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:49,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1265237084, now seen corresponding path program 1 times [2020-10-16 01:32:49,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:49,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635802567] [2020-10-16 01:32:49,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:50,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:50,009 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635802567] [2020-10-16 01:32:50,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:50,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:50,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684705078] [2020-10-16 01:32:50,010 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:32:50,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:50,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:32:50,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:32:50,011 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 149 [2020-10-16 01:32:50,012 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 21 transitions, 90 flow. Second operand 8 states. [2020-10-16 01:32:50,012 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:50,012 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 149 [2020-10-16 01:32:50,012 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:50,913 INFO L129 PetriNetUnfolder]: 227/442 cut-off events. [2020-10-16 01:32:50,913 INFO L130 PetriNetUnfolder]: For 612/615 co-relation queries the response was YES. [2020-10-16 01:32:50,916 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 442 events. 227/442 cut-off events. For 612/615 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1953 event pairs, 49 based on Foata normal form. 23/464 useless extension candidates. Maximal degree in co-relation 1190. Up to 233 conditions per place. [2020-10-16 01:32:50,919 INFO L132 encePairwiseOnDemand]: 137/149 looper letters, 34 selfloop transitions, 28 changer transitions 21/87 dead transitions. [2020-10-16 01:32:50,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 87 transitions, 484 flow [2020-10-16 01:32:50,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 01:32:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 01:32:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1332 transitions. [2020-10-16 01:32:50,925 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5587248322147651 [2020-10-16 01:32:50,926 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1332 transitions. [2020-10-16 01:32:50,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1332 transitions. [2020-10-16 01:32:50,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:50,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1332 transitions. [2020-10-16 01:32:50,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 01:32:50,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 01:32:50,934 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 01:32:50,934 INFO L185 Difference]: Start difference. First operand has 39 places, 21 transitions, 90 flow. Second operand 16 states and 1332 transitions. [2020-10-16 01:32:50,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 87 transitions, 484 flow [2020-10-16 01:32:50,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 87 transitions, 459 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-16 01:32:50,941 INFO L241 Difference]: Finished difference. Result has 57 places, 45 transitions, 287 flow [2020-10-16 01:32:50,941 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=287, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2020-10-16 01:32:50,942 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 30 predicate places. [2020-10-16 01:32:50,942 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 287 flow [2020-10-16 01:32:50,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:32:50,942 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:50,942 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:50,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:32:50,943 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:50,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:50,943 INFO L82 PathProgramCache]: Analyzing trace with hash 733128767, now seen corresponding path program 1 times [2020-10-16 01:32:50,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:50,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646536071] [2020-10-16 01:32:50,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:51,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:51,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646536071] [2020-10-16 01:32:51,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:51,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:51,185 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348226092] [2020-10-16 01:32:51,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:51,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:51,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:51,187 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 149 [2020-10-16 01:32:51,188 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 287 flow. Second operand 9 states. [2020-10-16 01:32:51,188 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:51,188 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 149 [2020-10-16 01:32:51,188 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:51,922 INFO L129 PetriNetUnfolder]: 129/333 cut-off events. [2020-10-16 01:32:51,922 INFO L130 PetriNetUnfolder]: For 1481/1494 co-relation queries the response was YES. [2020-10-16 01:32:51,925 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 333 events. 129/333 cut-off events. For 1481/1494 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1835 event pairs, 12 based on Foata normal form. 14/346 useless extension candidates. Maximal degree in co-relation 1408. Up to 124 conditions per place. [2020-10-16 01:32:51,928 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 29 selfloop transitions, 73 changer transitions 17/127 dead transitions. [2020-10-16 01:32:51,928 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 127 transitions, 1101 flow [2020-10-16 01:32:51,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-16 01:32:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-16 01:32:51,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1587 transitions. [2020-10-16 01:32:51,935 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5917225950782998 [2020-10-16 01:32:51,935 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1587 transitions. [2020-10-16 01:32:51,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1587 transitions. [2020-10-16 01:32:51,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:51,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1587 transitions. [2020-10-16 01:32:51,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-16 01:32:51,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-16 01:32:51,945 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-16 01:32:51,945 INFO L185 Difference]: Start difference. First operand has 57 places, 45 transitions, 287 flow. Second operand 18 states and 1587 transitions. [2020-10-16 01:32:51,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 127 transitions, 1101 flow [2020-10-16 01:32:51,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 127 transitions, 1080 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-16 01:32:51,956 INFO L241 Difference]: Finished difference. Result has 69 places, 105 transitions, 923 flow [2020-10-16 01:32:51,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=923, PETRI_PLACES=69, PETRI_TRANSITIONS=105} [2020-10-16 01:32:51,957 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 42 predicate places. [2020-10-16 01:32:51,957 INFO L481 AbstractCegarLoop]: Abstraction has has 69 places, 105 transitions, 923 flow [2020-10-16 01:32:51,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:51,957 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:51,958 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:51,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:32:51,958 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:51,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:51,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1210927161, now seen corresponding path program 2 times [2020-10-16 01:32:51,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:51,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539978562] [2020-10-16 01:32:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:52,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:52,094 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539978562] [2020-10-16 01:32:52,094 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:52,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:52,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228407541] [2020-10-16 01:32:52,095 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:52,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:52,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:52,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:52,096 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 149 [2020-10-16 01:32:52,096 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 105 transitions, 923 flow. Second operand 6 states. [2020-10-16 01:32:52,097 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:52,097 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 149 [2020-10-16 01:32:52,097 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:52,406 INFO L129 PetriNetUnfolder]: 102/283 cut-off events. [2020-10-16 01:32:52,406 INFO L130 PetriNetUnfolder]: For 1275/1300 co-relation queries the response was YES. [2020-10-16 01:32:52,408 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1442 conditions, 283 events. 102/283 cut-off events. For 1275/1300 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1532 event pairs, 3 based on Foata normal form. 17/300 useless extension candidates. Maximal degree in co-relation 1412. Up to 143 conditions per place. [2020-10-16 01:32:52,411 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 59 selfloop transitions, 52 changer transitions 5/124 dead transitions. [2020-10-16 01:32:52,411 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 124 transitions, 1340 flow [2020-10-16 01:32:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:52,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 769 transitions. [2020-10-16 01:32:52,415 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6451342281879194 [2020-10-16 01:32:52,415 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 769 transitions. [2020-10-16 01:32:52,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 769 transitions. [2020-10-16 01:32:52,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:52,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 769 transitions. [2020-10-16 01:32:52,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:52,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:52,421 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:52,421 INFO L185 Difference]: Start difference. First operand has 69 places, 105 transitions, 923 flow. Second operand 8 states and 769 transitions. [2020-10-16 01:32:52,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 124 transitions, 1340 flow [2020-10-16 01:32:52,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 124 transitions, 1196 flow, removed 48 selfloop flow, removed 6 redundant places. [2020-10-16 01:32:52,434 INFO L241 Difference]: Finished difference. Result has 73 places, 114 transitions, 1100 flow [2020-10-16 01:32:52,435 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1100, PETRI_PLACES=73, PETRI_TRANSITIONS=114} [2020-10-16 01:32:52,435 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 46 predicate places. [2020-10-16 01:32:52,435 INFO L481 AbstractCegarLoop]: Abstraction has has 73 places, 114 transitions, 1100 flow [2020-10-16 01:32:52,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:32:52,435 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:52,435 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:52,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:32:52,436 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:52,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:52,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1211761096, now seen corresponding path program 1 times [2020-10-16 01:32:52,436 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:52,436 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953778932] [2020-10-16 01:32:52,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:52,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:52,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953778932] [2020-10-16 01:32:52,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:52,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:52,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245633254] [2020-10-16 01:32:52,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:52,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:52,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:52,865 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 149 [2020-10-16 01:32:52,865 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 114 transitions, 1100 flow. Second operand 9 states. [2020-10-16 01:32:52,866 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:52,866 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 149 [2020-10-16 01:32:52,866 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:53,376 INFO L129 PetriNetUnfolder]: 101/277 cut-off events. [2020-10-16 01:32:53,377 INFO L130 PetriNetUnfolder]: For 1342/1363 co-relation queries the response was YES. [2020-10-16 01:32:53,379 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 277 events. 101/277 cut-off events. For 1342/1363 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1533 event pairs, 1 based on Foata normal form. 24/301 useless extension candidates. Maximal degree in co-relation 1493. Up to 184 conditions per place. [2020-10-16 01:32:53,382 INFO L132 encePairwiseOnDemand]: 139/149 looper letters, 78 selfloop transitions, 37 changer transitions 5/128 dead transitions. [2020-10-16 01:32:53,382 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 128 transitions, 1468 flow [2020-10-16 01:32:53,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:32:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:32:53,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 855 transitions. [2020-10-16 01:32:53,386 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5738255033557047 [2020-10-16 01:32:53,386 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 855 transitions. [2020-10-16 01:32:53,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 855 transitions. [2020-10-16 01:32:53,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:53,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 855 transitions. [2020-10-16 01:32:53,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:32:53,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:32:53,393 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:32:53,394 INFO L185 Difference]: Start difference. First operand has 73 places, 114 transitions, 1100 flow. Second operand 10 states and 855 transitions. [2020-10-16 01:32:53,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 128 transitions, 1468 flow [2020-10-16 01:32:53,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 128 transitions, 1451 flow, removed 3 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:53,408 INFO L241 Difference]: Finished difference. Result has 81 places, 118 transitions, 1216 flow [2020-10-16 01:32:53,409 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1216, PETRI_PLACES=81, PETRI_TRANSITIONS=118} [2020-10-16 01:32:53,409 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 54 predicate places. [2020-10-16 01:32:53,410 INFO L481 AbstractCegarLoop]: Abstraction has has 81 places, 118 transitions, 1216 flow [2020-10-16 01:32:53,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:53,410 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:53,410 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:53,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:32:53,410 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:53,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash -52070474, now seen corresponding path program 2 times [2020-10-16 01:32:53,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:53,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687589551] [2020-10-16 01:32:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:53,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687589551] [2020-10-16 01:32:53,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:53,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:53,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512774824] [2020-10-16 01:32:53,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:53,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:53,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:53,934 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 149 [2020-10-16 01:32:53,935 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 118 transitions, 1216 flow. Second operand 9 states. [2020-10-16 01:32:53,935 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:53,935 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 149 [2020-10-16 01:32:53,935 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:54,384 INFO L129 PetriNetUnfolder]: 96/266 cut-off events. [2020-10-16 01:32:54,384 INFO L130 PetriNetUnfolder]: For 1365/1370 co-relation queries the response was YES. [2020-10-16 01:32:54,385 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1529 conditions, 266 events. 96/266 cut-off events. For 1365/1370 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1459 event pairs, 1 based on Foata normal form. 7/272 useless extension candidates. Maximal degree in co-relation 1494. Up to 141 conditions per place. [2020-10-16 01:32:54,388 INFO L132 encePairwiseOnDemand]: 143/149 looper letters, 75 selfloop transitions, 42 changer transitions 3/128 dead transitions. [2020-10-16 01:32:54,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 128 transitions, 1564 flow [2020-10-16 01:32:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:32:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:32:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 644 transitions. [2020-10-16 01:32:54,392 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6174496644295302 [2020-10-16 01:32:54,392 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 644 transitions. [2020-10-16 01:32:54,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 644 transitions. [2020-10-16 01:32:54,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:54,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 644 transitions. [2020-10-16 01:32:54,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:32:54,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:32:54,396 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:32:54,396 INFO L185 Difference]: Start difference. First operand has 81 places, 118 transitions, 1216 flow. Second operand 7 states and 644 transitions. [2020-10-16 01:32:54,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 128 transitions, 1564 flow [2020-10-16 01:32:54,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 128 transitions, 1527 flow, removed 5 selfloop flow, removed 3 redundant places. [2020-10-16 01:32:54,411 INFO L241 Difference]: Finished difference. Result has 85 places, 118 transitions, 1312 flow [2020-10-16 01:32:54,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1312, PETRI_PLACES=85, PETRI_TRANSITIONS=118} [2020-10-16 01:32:54,411 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 58 predicate places. [2020-10-16 01:32:54,411 INFO L481 AbstractCegarLoop]: Abstraction has has 85 places, 118 transitions, 1312 flow [2020-10-16 01:32:54,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:54,412 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:54,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:54,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:32:54,412 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:54,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:54,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1820188551, now seen corresponding path program 1 times [2020-10-16 01:32:54,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:54,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113813193] [2020-10-16 01:32:54,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:54,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:54,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113813193] [2020-10-16 01:32:54,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:54,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:32:54,648 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807412693] [2020-10-16 01:32:54,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:32:54,649 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:54,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:32:54,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:32:54,651 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 149 [2020-10-16 01:32:54,651 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 118 transitions, 1312 flow. Second operand 9 states. [2020-10-16 01:32:54,651 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:54,651 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 149 [2020-10-16 01:32:54,651 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:55,062 INFO L129 PetriNetUnfolder]: 134/364 cut-off events. [2020-10-16 01:32:55,063 INFO L130 PetriNetUnfolder]: For 2135/2142 co-relation queries the response was YES. [2020-10-16 01:32:55,066 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2155 conditions, 364 events. 134/364 cut-off events. For 2135/2142 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2194 event pairs, 0 based on Foata normal form. 10/373 useless extension candidates. Maximal degree in co-relation 2118. Up to 132 conditions per place. [2020-10-16 01:32:55,069 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 57 selfloop transitions, 31 changer transitions 71/167 dead transitions. [2020-10-16 01:32:55,069 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 167 transitions, 2157 flow [2020-10-16 01:32:55,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:55,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 743 transitions. [2020-10-16 01:32:55,073 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6233221476510067 [2020-10-16 01:32:55,073 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 743 transitions. [2020-10-16 01:32:55,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 743 transitions. [2020-10-16 01:32:55,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:55,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 743 transitions. [2020-10-16 01:32:55,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:55,079 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:55,079 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:55,079 INFO L185 Difference]: Start difference. First operand has 85 places, 118 transitions, 1312 flow. Second operand 8 states and 743 transitions. [2020-10-16 01:32:55,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 167 transitions, 2157 flow [2020-10-16 01:32:55,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 167 transitions, 1969 flow, removed 15 selfloop flow, removed 11 redundant places. [2020-10-16 01:32:55,105 INFO L241 Difference]: Finished difference. Result has 83 places, 95 transitions, 1006 flow [2020-10-16 01:32:55,105 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1006, PETRI_PLACES=83, PETRI_TRANSITIONS=95} [2020-10-16 01:32:55,106 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 56 predicate places. [2020-10-16 01:32:55,106 INFO L481 AbstractCegarLoop]: Abstraction has has 83 places, 95 transitions, 1006 flow [2020-10-16 01:32:55,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:32:55,106 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:55,106 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:55,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:32:55,107 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:55,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:55,108 INFO L82 PathProgramCache]: Analyzing trace with hash -602347817, now seen corresponding path program 2 times [2020-10-16 01:32:55,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:55,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262550679] [2020-10-16 01:32:55,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:55,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:55,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262550679] [2020-10-16 01:32:55,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:55,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:32:55,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024311245] [2020-10-16 01:32:55,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:32:55,531 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:55,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:32:55,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:32:55,532 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 149 [2020-10-16 01:32:55,533 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 95 transitions, 1006 flow. Second operand 10 states. [2020-10-16 01:32:55,534 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:55,534 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 149 [2020-10-16 01:32:55,534 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:55,650 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2020-10-16 01:32:56,093 INFO L129 PetriNetUnfolder]: 70/204 cut-off events. [2020-10-16 01:32:56,094 INFO L130 PetriNetUnfolder]: For 924/930 co-relation queries the response was YES. [2020-10-16 01:32:56,095 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 204 events. 70/204 cut-off events. For 924/930 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1030 event pairs, 1 based on Foata normal form. 7/210 useless extension candidates. Maximal degree in co-relation 1154. Up to 80 conditions per place. [2020-10-16 01:32:56,097 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 65 selfloop transitions, 11 changer transitions 23/106 dead transitions. [2020-10-16 01:32:56,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 106 transitions, 1332 flow [2020-10-16 01:32:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:32:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:32:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 702 transitions. [2020-10-16 01:32:56,101 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5889261744966443 [2020-10-16 01:32:56,101 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 702 transitions. [2020-10-16 01:32:56,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 702 transitions. [2020-10-16 01:32:56,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:56,102 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 702 transitions. [2020-10-16 01:32:56,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:32:56,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:32:56,107 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:32:56,107 INFO L185 Difference]: Start difference. First operand has 83 places, 95 transitions, 1006 flow. Second operand 8 states and 702 transitions. [2020-10-16 01:32:56,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 106 transitions, 1332 flow [2020-10-16 01:32:56,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 106 transitions, 1231 flow, removed 17 selfloop flow, removed 10 redundant places. [2020-10-16 01:32:56,122 INFO L241 Difference]: Finished difference. Result has 79 places, 80 transitions, 816 flow [2020-10-16 01:32:56,123 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=816, PETRI_PLACES=79, PETRI_TRANSITIONS=80} [2020-10-16 01:32:56,123 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 52 predicate places. [2020-10-16 01:32:56,123 INFO L481 AbstractCegarLoop]: Abstraction has has 79 places, 80 transitions, 816 flow [2020-10-16 01:32:56,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:32:56,124 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:56,124 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:56,124 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:32:56,124 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:56,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:56,125 INFO L82 PathProgramCache]: Analyzing trace with hash -12444693, now seen corresponding path program 1 times [2020-10-16 01:32:56,125 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:56,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055174531] [2020-10-16 01:32:56,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:56,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055174531] [2020-10-16 01:32:56,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:56,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:32:56,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550959609] [2020-10-16 01:32:56,289 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:32:56,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:56,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:32:56,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:32:56,290 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 149 [2020-10-16 01:32:56,291 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 80 transitions, 816 flow. Second operand 7 states. [2020-10-16 01:32:56,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:56,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 149 [2020-10-16 01:32:56,291 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:56,924 INFO L129 PetriNetUnfolder]: 211/404 cut-off events. [2020-10-16 01:32:56,925 INFO L130 PetriNetUnfolder]: For 2053/2058 co-relation queries the response was YES. [2020-10-16 01:32:56,926 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 404 events. 211/404 cut-off events. For 2053/2058 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1719 event pairs, 4 based on Foata normal form. 8/411 useless extension candidates. Maximal degree in co-relation 2069. Up to 142 conditions per place. [2020-10-16 01:32:56,930 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 69 selfloop transitions, 34 changer transitions 26/133 dead transitions. [2020-10-16 01:32:56,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 133 transitions, 1523 flow [2020-10-16 01:32:56,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:32:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:32:56,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 914 transitions. [2020-10-16 01:32:56,939 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5576571079926784 [2020-10-16 01:32:56,940 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 914 transitions. [2020-10-16 01:32:56,940 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 914 transitions. [2020-10-16 01:32:56,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:56,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 914 transitions. [2020-10-16 01:32:56,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:32:56,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:32:56,945 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:32:56,945 INFO L185 Difference]: Start difference. First operand has 79 places, 80 transitions, 816 flow. Second operand 11 states and 914 transitions. [2020-10-16 01:32:56,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 133 transitions, 1523 flow [2020-10-16 01:32:56,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 133 transitions, 1443 flow, removed 21 selfloop flow, removed 9 redundant places. [2020-10-16 01:32:56,957 INFO L241 Difference]: Finished difference. Result has 76 places, 85 transitions, 909 flow [2020-10-16 01:32:56,957 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=909, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2020-10-16 01:32:56,957 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 49 predicate places. [2020-10-16 01:32:56,958 INFO L481 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 909 flow [2020-10-16 01:32:56,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:32:56,958 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:56,958 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:56,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:32:56,958 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1267628617, now seen corresponding path program 2 times [2020-10-16 01:32:56,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:56,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706858844] [2020-10-16 01:32:56,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:57,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:57,054 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706858844] [2020-10-16 01:32:57,055 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:57,055 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:32:57,055 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897565470] [2020-10-16 01:32:57,055 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:32:57,055 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:57,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:32:57,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:32:57,057 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 149 [2020-10-16 01:32:57,057 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 909 flow. Second operand 5 states. [2020-10-16 01:32:57,057 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:57,057 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 149 [2020-10-16 01:32:57,058 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:57,222 INFO L129 PetriNetUnfolder]: 90/235 cut-off events. [2020-10-16 01:32:57,223 INFO L130 PetriNetUnfolder]: For 1178/1189 co-relation queries the response was YES. [2020-10-16 01:32:57,224 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1389 conditions, 235 events. 90/235 cut-off events. For 1178/1189 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1161 event pairs, 4 based on Foata normal form. 10/244 useless extension candidates. Maximal degree in co-relation 1367. Up to 91 conditions per place. [2020-10-16 01:32:57,226 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 40 selfloop transitions, 10 changer transitions 43/109 dead transitions. [2020-10-16 01:32:57,226 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 109 transitions, 1368 flow [2020-10-16 01:32:57,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:32:57,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:32:57,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 503 transitions. [2020-10-16 01:32:57,229 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6751677852348993 [2020-10-16 01:32:57,230 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 503 transitions. [2020-10-16 01:32:57,230 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 503 transitions. [2020-10-16 01:32:57,230 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:57,230 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 503 transitions. [2020-10-16 01:32:57,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:32:57,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:32:57,233 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:32:57,233 INFO L185 Difference]: Start difference. First operand has 76 places, 85 transitions, 909 flow. Second operand 5 states and 503 transitions. [2020-10-16 01:32:57,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 109 transitions, 1368 flow [2020-10-16 01:32:57,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 109 transitions, 1298 flow, removed 7 selfloop flow, removed 5 redundant places. [2020-10-16 01:32:57,243 INFO L241 Difference]: Finished difference. Result has 75 places, 66 transitions, 679 flow [2020-10-16 01:32:57,244 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=75, PETRI_TRANSITIONS=66} [2020-10-16 01:32:57,244 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2020-10-16 01:32:57,244 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 66 transitions, 679 flow [2020-10-16 01:32:57,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:32:57,244 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:57,245 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:57,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:32:57,245 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:57,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:57,245 INFO L82 PathProgramCache]: Analyzing trace with hash 287849501, now seen corresponding path program 3 times [2020-10-16 01:32:57,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:57,247 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648501104] [2020-10-16 01:32:57,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:57,774 WARN L193 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2020-10-16 01:32:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:57,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648501104] [2020-10-16 01:32:57,857 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:57,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:32:57,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716462460] [2020-10-16 01:32:57,857 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:32:57,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:57,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:32:57,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:32:57,859 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 149 [2020-10-16 01:32:57,860 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 66 transitions, 679 flow. Second operand 11 states. [2020-10-16 01:32:57,860 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:57,860 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 149 [2020-10-16 01:32:57,860 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:58,852 INFO L129 PetriNetUnfolder]: 50/154 cut-off events. [2020-10-16 01:32:58,852 INFO L130 PetriNetUnfolder]: For 685/701 co-relation queries the response was YES. [2020-10-16 01:32:58,853 INFO L80 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 154 events. 50/154 cut-off events. For 685/701 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 658 event pairs, 1 based on Foata normal form. 19/173 useless extension candidates. Maximal degree in co-relation 862. Up to 53 conditions per place. [2020-10-16 01:32:58,854 INFO L132 encePairwiseOnDemand]: 138/149 looper letters, 39 selfloop transitions, 30 changer transitions 10/89 dead transitions. [2020-10-16 01:32:58,854 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 89 transitions, 1069 flow [2020-10-16 01:32:58,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 01:32:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 01:32:58,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1362 transitions. [2020-10-16 01:32:58,857 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5713087248322147 [2020-10-16 01:32:58,857 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1362 transitions. [2020-10-16 01:32:58,857 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1362 transitions. [2020-10-16 01:32:58,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:58,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1362 transitions. [2020-10-16 01:32:58,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 01:32:58,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 01:32:58,863 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 01:32:58,864 INFO L185 Difference]: Start difference. First operand has 75 places, 66 transitions, 679 flow. Second operand 16 states and 1362 transitions. [2020-10-16 01:32:58,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 89 transitions, 1069 flow [2020-10-16 01:32:58,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 89 transitions, 1031 flow, removed 8 selfloop flow, removed 4 redundant places. [2020-10-16 01:32:58,871 INFO L241 Difference]: Finished difference. Result has 93 places, 73 transitions, 827 flow [2020-10-16 01:32:58,871 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=827, PETRI_PLACES=93, PETRI_TRANSITIONS=73} [2020-10-16 01:32:58,871 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 66 predicate places. [2020-10-16 01:32:58,871 INFO L481 AbstractCegarLoop]: Abstraction has has 93 places, 73 transitions, 827 flow [2020-10-16 01:32:58,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:32:58,872 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:58,872 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:58,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:32:58,872 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:58,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1927615481, now seen corresponding path program 3 times [2020-10-16 01:32:58,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:58,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996683907] [2020-10-16 01:32:58,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:58,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:59,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:59,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996683907] [2020-10-16 01:32:59,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:59,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 01:32:59,087 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769673257] [2020-10-16 01:32:59,087 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 01:32:59,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:59,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 01:32:59,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-16 01:32:59,089 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 149 [2020-10-16 01:32:59,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 73 transitions, 827 flow. Second operand 10 states. [2020-10-16 01:32:59,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:59,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 149 [2020-10-16 01:32:59,090 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:32:59,652 INFO L129 PetriNetUnfolder]: 55/185 cut-off events. [2020-10-16 01:32:59,652 INFO L130 PetriNetUnfolder]: For 1118/1134 co-relation queries the response was YES. [2020-10-16 01:32:59,653 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 185 events. 55/185 cut-off events. For 1118/1134 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 920 event pairs, 2 based on Foata normal form. 5/190 useless extension candidates. Maximal degree in co-relation 1133. Up to 59 conditions per place. [2020-10-16 01:32:59,655 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 46 selfloop transitions, 27 changer transitions 10/93 dead transitions. [2020-10-16 01:32:59,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 93 transitions, 1270 flow [2020-10-16 01:32:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 01:32:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 01:32:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 889 transitions. [2020-10-16 01:32:59,658 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5966442953020135 [2020-10-16 01:32:59,658 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 889 transitions. [2020-10-16 01:32:59,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 889 transitions. [2020-10-16 01:32:59,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:32:59,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 889 transitions. [2020-10-16 01:32:59,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 01:32:59,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 01:32:59,664 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 01:32:59,665 INFO L185 Difference]: Start difference. First operand has 93 places, 73 transitions, 827 flow. Second operand 10 states and 889 transitions. [2020-10-16 01:32:59,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 93 transitions, 1270 flow [2020-10-16 01:32:59,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 93 transitions, 1127 flow, removed 38 selfloop flow, removed 10 redundant places. [2020-10-16 01:32:59,674 INFO L241 Difference]: Finished difference. Result has 92 places, 72 transitions, 819 flow [2020-10-16 01:32:59,675 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=819, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2020-10-16 01:32:59,675 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 65 predicate places. [2020-10-16 01:32:59,675 INFO L481 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 819 flow [2020-10-16 01:32:59,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 01:32:59,675 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:32:59,675 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:32:59,675 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:32:59,676 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:32:59,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:32:59,676 INFO L82 PathProgramCache]: Analyzing trace with hash -973694793, now seen corresponding path program 4 times [2020-10-16 01:32:59,676 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:32:59,676 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038571467] [2020-10-16 01:32:59,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:32:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:32:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:32:59,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038571467] [2020-10-16 01:32:59,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:32:59,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:32:59,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243558042] [2020-10-16 01:32:59,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:32:59,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:32:59,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:32:59,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:32:59,837 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 149 [2020-10-16 01:32:59,837 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 72 transitions, 819 flow. Second operand 6 states. [2020-10-16 01:32:59,837 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:32:59,838 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 149 [2020-10-16 01:32:59,838 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:00,056 INFO L129 PetriNetUnfolder]: 49/175 cut-off events. [2020-10-16 01:33:00,056 INFO L130 PetriNetUnfolder]: For 1336/1353 co-relation queries the response was YES. [2020-10-16 01:33:00,057 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1080 conditions, 175 events. 49/175 cut-off events. For 1336/1353 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 880 event pairs, 6 based on Foata normal form. 7/182 useless extension candidates. Maximal degree in co-relation 1053. Up to 59 conditions per place. [2020-10-16 01:33:00,058 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 20 selfloop transitions, 13 changer transitions 44/87 dead transitions. [2020-10-16 01:33:00,058 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 87 transitions, 1175 flow [2020-10-16 01:33:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:33:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:33:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2020-10-16 01:33:00,060 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6452540747842761 [2020-10-16 01:33:00,061 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2020-10-16 01:33:00,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2020-10-16 01:33:00,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:00,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2020-10-16 01:33:00,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:33:00,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:33:00,065 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:33:00,065 INFO L185 Difference]: Start difference. First operand has 92 places, 72 transitions, 819 flow. Second operand 7 states and 673 transitions. [2020-10-16 01:33:00,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 87 transitions, 1175 flow [2020-10-16 01:33:00,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 1115 flow, removed 19 selfloop flow, removed 6 redundant places. [2020-10-16 01:33:00,074 INFO L241 Difference]: Finished difference. Result has 94 places, 43 transitions, 465 flow [2020-10-16 01:33:00,075 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=465, PETRI_PLACES=94, PETRI_TRANSITIONS=43} [2020-10-16 01:33:00,075 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 67 predicate places. [2020-10-16 01:33:00,075 INFO L481 AbstractCegarLoop]: Abstraction has has 94 places, 43 transitions, 465 flow [2020-10-16 01:33:00,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:33:00,075 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:00,076 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:00,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:33:00,076 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:00,076 INFO L82 PathProgramCache]: Analyzing trace with hash -288430335, now seen corresponding path program 1 times [2020-10-16 01:33:00,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:00,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092637823] [2020-10-16 01:33:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:00,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:00,319 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092637823] [2020-10-16 01:33:00,320 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:00,320 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:33:00,320 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010478102] [2020-10-16 01:33:00,321 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:33:00,321 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:00,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:33:00,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:33:00,322 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 149 [2020-10-16 01:33:00,323 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 43 transitions, 465 flow. Second operand 7 states. [2020-10-16 01:33:00,323 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:00,323 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 149 [2020-10-16 01:33:00,323 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:00,574 INFO L129 PetriNetUnfolder]: 11/71 cut-off events. [2020-10-16 01:33:00,574 INFO L130 PetriNetUnfolder]: For 479/497 co-relation queries the response was YES. [2020-10-16 01:33:00,575 INFO L80 FinitePrefix]: Finished finitePrefix Result has 427 conditions, 71 events. 11/71 cut-off events. For 479/497 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 234 event pairs, 2 based on Foata normal form. 5/76 useless extension candidates. Maximal degree in co-relation 399. Up to 30 conditions per place. [2020-10-16 01:33:00,575 INFO L132 encePairwiseOnDemand]: 140/149 looper letters, 17 selfloop transitions, 10 changer transitions 9/46 dead transitions. [2020-10-16 01:33:00,576 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 46 transitions, 581 flow [2020-10-16 01:33:00,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:33:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:33:00,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 712 transitions. [2020-10-16 01:33:00,578 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5973154362416108 [2020-10-16 01:33:00,579 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 712 transitions. [2020-10-16 01:33:00,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 712 transitions. [2020-10-16 01:33:00,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:00,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 712 transitions. [2020-10-16 01:33:00,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:33:00,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:33:00,585 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:33:00,585 INFO L185 Difference]: Start difference. First operand has 94 places, 43 transitions, 465 flow. Second operand 8 states and 712 transitions. [2020-10-16 01:33:00,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 46 transitions, 581 flow [2020-10-16 01:33:00,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 46 transitions, 471 flow, removed 16 selfloop flow, removed 18 redundant places. [2020-10-16 01:33:00,590 INFO L241 Difference]: Finished difference. Result has 80 places, 37 transitions, 352 flow [2020-10-16 01:33:00,590 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=352, PETRI_PLACES=80, PETRI_TRANSITIONS=37} [2020-10-16 01:33:00,590 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 53 predicate places. [2020-10-16 01:33:00,591 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 37 transitions, 352 flow [2020-10-16 01:33:00,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:33:00,591 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:00,591 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:00,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 01:33:00,591 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:00,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:00,592 INFO L82 PathProgramCache]: Analyzing trace with hash -199122261, now seen corresponding path program 2 times [2020-10-16 01:33:00,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:00,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102201136] [2020-10-16 01:33:00,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:01,701 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2020-10-16 01:33:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:01,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102201136] [2020-10-16 01:33:01,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:01,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-16 01:33:01,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699591531] [2020-10-16 01:33:01,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-16 01:33:01,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:01,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-16 01:33:01,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-10-16 01:33:01,771 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 149 [2020-10-16 01:33:01,772 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 37 transitions, 352 flow. Second operand 13 states. [2020-10-16 01:33:01,772 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:01,772 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 149 [2020-10-16 01:33:01,772 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:02,360 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-16 01:33:02,400 INFO L129 PetriNetUnfolder]: 26/84 cut-off events. [2020-10-16 01:33:02,400 INFO L130 PetriNetUnfolder]: For 559/560 co-relation queries the response was YES. [2020-10-16 01:33:02,401 INFO L80 FinitePrefix]: Finished finitePrefix Result has 481 conditions, 84 events. 26/84 cut-off events. For 559/560 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 217 event pairs, 7 based on Foata normal form. 5/89 useless extension candidates. Maximal degree in co-relation 458. Up to 47 conditions per place. [2020-10-16 01:33:02,401 INFO L132 encePairwiseOnDemand]: 143/149 looper letters, 25 selfloop transitions, 4 changer transitions 19/52 dead transitions. [2020-10-16 01:33:02,401 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 52 transitions, 536 flow [2020-10-16 01:33:02,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:33:02,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:33:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 601 transitions. [2020-10-16 01:33:02,403 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5041946308724832 [2020-10-16 01:33:02,403 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 601 transitions. [2020-10-16 01:33:02,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 601 transitions. [2020-10-16 01:33:02,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:02,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 601 transitions. [2020-10-16 01:33:02,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:33:02,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:33:02,406 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:33:02,406 INFO L185 Difference]: Start difference. First operand has 80 places, 37 transitions, 352 flow. Second operand 8 states and 601 transitions. [2020-10-16 01:33:02,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 52 transitions, 536 flow [2020-10-16 01:33:02,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 52 transitions, 476 flow, removed 6 selfloop flow, removed 12 redundant places. [2020-10-16 01:33:02,411 INFO L241 Difference]: Finished difference. Result has 71 places, 31 transitions, 255 flow [2020-10-16 01:33:02,411 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=255, PETRI_PLACES=71, PETRI_TRANSITIONS=31} [2020-10-16 01:33:02,411 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 44 predicate places. [2020-10-16 01:33:02,411 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 31 transitions, 255 flow [2020-10-16 01:33:02,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-16 01:33:02,412 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:02,412 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:02,412 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 01:33:02,412 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:02,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:02,412 INFO L82 PathProgramCache]: Analyzing trace with hash -340782833, now seen corresponding path program 3 times [2020-10-16 01:33:02,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:02,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44349138] [2020-10-16 01:33:02,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:02,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:02,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44349138] [2020-10-16 01:33:02,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:02,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:33:02,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258270703] [2020-10-16 01:33:02,701 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:33:02,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:02,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:33:02,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:33:02,702 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 149 [2020-10-16 01:33:02,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 31 transitions, 255 flow. Second operand 7 states. [2020-10-16 01:33:02,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:02,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 149 [2020-10-16 01:33:02,703 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:03,015 INFO L129 PetriNetUnfolder]: 9/45 cut-off events. [2020-10-16 01:33:03,015 INFO L130 PetriNetUnfolder]: For 275/279 co-relation queries the response was YES. [2020-10-16 01:33:03,015 INFO L80 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 45 events. 9/45 cut-off events. For 275/279 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 92 event pairs, 3 based on Foata normal form. 3/48 useless extension candidates. Maximal degree in co-relation 230. Up to 14 conditions per place. [2020-10-16 01:33:03,016 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 14 selfloop transitions, 4 changer transitions 5/33 dead transitions. [2020-10-16 01:33:03,016 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 33 transitions, 327 flow [2020-10-16 01:33:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:33:03,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:33:03,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 604 transitions. [2020-10-16 01:33:03,017 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5790987535953979 [2020-10-16 01:33:03,017 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 604 transitions. [2020-10-16 01:33:03,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 604 transitions. [2020-10-16 01:33:03,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:03,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 604 transitions. [2020-10-16 01:33:03,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:33:03,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:33:03,020 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:33:03,020 INFO L185 Difference]: Start difference. First operand has 71 places, 31 transitions, 255 flow. Second operand 7 states and 604 transitions. [2020-10-16 01:33:03,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 33 transitions, 327 flow [2020-10-16 01:33:03,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 33 transitions, 236 flow, removed 12 selfloop flow, removed 18 redundant places. [2020-10-16 01:33:03,023 INFO L241 Difference]: Finished difference. Result has 54 places, 28 transitions, 164 flow [2020-10-16 01:33:03,023 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=54, PETRI_TRANSITIONS=28} [2020-10-16 01:33:03,023 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 27 predicate places. [2020-10-16 01:33:03,023 INFO L481 AbstractCegarLoop]: Abstraction has has 54 places, 28 transitions, 164 flow [2020-10-16 01:33:03,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:33:03,023 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:03,023 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:03,024 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 01:33:03,024 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 01:33:03,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:03,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1975491989, now seen corresponding path program 4 times [2020-10-16 01:33:03,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:03,024 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389736573] [2020-10-16 01:33:03,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:03,366 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 37 [2020-10-16 01:33:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:03,610 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389736573] [2020-10-16 01:33:03,610 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:03,611 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:33:03,611 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5174555] [2020-10-16 01:33:03,611 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:33:03,611 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:03,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:33:03,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:33:03,613 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 149 [2020-10-16 01:33:03,613 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 28 transitions, 164 flow. Second operand 9 states. [2020-10-16 01:33:03,613 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:03,614 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 149 [2020-10-16 01:33:03,614 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:04,120 INFO L129 PetriNetUnfolder]: 6/30 cut-off events. [2020-10-16 01:33:04,120 INFO L130 PetriNetUnfolder]: For 73/73 co-relation queries the response was YES. [2020-10-16 01:33:04,120 INFO L80 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 30 events. 6/30 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 31 event pairs, 1 based on Foata normal form. 2/32 useless extension candidates. Maximal degree in co-relation 117. Up to 9 conditions per place. [2020-10-16 01:33:04,121 INFO L132 encePairwiseOnDemand]: 142/149 looper letters, 0 selfloop transitions, 0 changer transitions 27/27 dead transitions. [2020-10-16 01:33:04,121 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 27 transitions, 192 flow [2020-10-16 01:33:04,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:33:04,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:33:04,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 651 transitions. [2020-10-16 01:33:04,122 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5461409395973155 [2020-10-16 01:33:04,122 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 651 transitions. [2020-10-16 01:33:04,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 651 transitions. [2020-10-16 01:33:04,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:04,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 651 transitions. [2020-10-16 01:33:04,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:33:04,124 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:33:04,125 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:33:04,125 INFO L185 Difference]: Start difference. First operand has 54 places, 28 transitions, 164 flow. Second operand 8 states and 651 transitions. [2020-10-16 01:33:04,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 27 transitions, 192 flow [2020-10-16 01:33:04,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 27 transitions, 167 flow, removed 7 selfloop flow, removed 9 redundant places. [2020-10-16 01:33:04,126 INFO L241 Difference]: Finished difference. Result has 48 places, 0 transitions, 0 flow [2020-10-16 01:33:04,126 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=149, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=0, PETRI_PLACES=48, PETRI_TRANSITIONS=0} [2020-10-16 01:33:04,127 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 21 predicate places. [2020-10-16 01:33:04,127 INFO L481 AbstractCegarLoop]: Abstraction has has 48 places, 0 transitions, 0 flow [2020-10-16 01:33:04,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:33:04,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 01:33:04,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:33:04 BasicIcfg [2020-10-16 01:33:04,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:33:04,133 INFO L168 Benchmark]: Toolchain (without parser) took 25464.32 ms. Allocated memory was 249.0 MB in the beginning and 820.5 MB in the end (delta: 571.5 MB). Free memory was 204.2 MB in the beginning and 516.2 MB in the end (delta: -312.0 MB). Peak memory consumption was 259.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:04,134 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 01:33:04,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 817.92 ms. Allocated memory was 249.0 MB in the beginning and 307.8 MB in the end (delta: 58.7 MB). Free memory was 204.2 MB in the beginning and 256.0 MB in the end (delta: -51.8 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:04,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.55 ms. Allocated memory is still 307.8 MB. Free memory was 253.5 MB in the beginning and 251.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:04,136 INFO L168 Benchmark]: Boogie Preprocessor took 49.64 ms. Allocated memory is still 307.8 MB. Free memory was 251.0 MB in the beginning and 248.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:04,136 INFO L168 Benchmark]: RCFGBuilder took 3825.54 ms. Allocated memory was 307.8 MB in the beginning and 369.6 MB in the end (delta: 61.9 MB). Free memory was 248.4 MB in the beginning and 165.7 MB in the end (delta: 82.7 MB). Peak memory consumption was 148.1 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:04,137 INFO L168 Benchmark]: TraceAbstraction took 20691.77 ms. Allocated memory was 369.6 MB in the beginning and 820.5 MB in the end (delta: 450.9 MB). Free memory was 162.1 MB in the beginning and 516.2 MB in the end (delta: -354.1 MB). Peak memory consumption was 96.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:04,140 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.17 ms. Allocated memory is still 249.0 MB. Free memory is still 225.4 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 817.92 ms. Allocated memory was 249.0 MB in the beginning and 307.8 MB in the end (delta: 58.7 MB). Free memory was 204.2 MB in the beginning and 256.0 MB in the end (delta: -51.8 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 70.55 ms. Allocated memory is still 307.8 MB. Free memory was 253.5 MB in the beginning and 251.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 49.64 ms. Allocated memory is still 307.8 MB. Free memory was 251.0 MB in the beginning and 248.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3825.54 ms. Allocated memory was 307.8 MB in the beginning and 369.6 MB in the end (delta: 61.9 MB). Free memory was 248.4 MB in the beginning and 165.7 MB in the end (delta: 82.7 MB). Peak memory consumption was 148.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 20691.77 ms. Allocated memory was 369.6 MB in the beginning and 820.5 MB in the end (delta: 450.9 MB). Free memory was 162.1 MB in the beginning and 516.2 MB in the end (delta: -354.1 MB). Peak memory consumption was 96.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 616 VarBasedMoverChecksPositive, 55 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 34 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.3s, 61 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.5s, 83 PlacesBefore, 27 PlacesAfterwards, 78 TransitionsBefore, 21 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 69 TotalNumberOfCompositions, 2967 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 - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: SAFE, OverallTime: 20.4s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 125 SDtfs, 160 SDslu, 239 SDs, 0 SdLazy, 1451 SolverSat, 507 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 208 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 387 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1312occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 262 NumberOfCodeBlocks, 262 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 243 ConstructedInterpolants, 0 QuantifiedInterpolants, 48707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...