/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/rfi003_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 01:33:14,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 01:33:14,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 01:33:14,278 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 01:33:14,278 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 01:33:14,279 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 01:33:14,280 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 01:33:14,282 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 01:33:14,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 01:33:14,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 01:33:14,285 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 01:33:14,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 01:33:14,287 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 01:33:14,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 01:33:14,288 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 01:33:14,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 01:33:14,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 01:33:14,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 01:33:14,296 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 01:33:14,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 01:33:14,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 01:33:14,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 01:33:14,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 01:33:14,302 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 01:33:14,304 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 01:33:14,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 01:33:14,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 01:33:14,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 01:33:14,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 01:33:14,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 01:33:14,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 01:33:14,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 01:33:14,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 01:33:14,308 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 01:33:14,309 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 01:33:14,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 01:33:14,310 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 01:33:14,310 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 01:33:14,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 01:33:14,311 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 01:33:14,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 01:33:14,313 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:33:14,333 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 01:33:14,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 01:33:14,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 01:33:14,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 01:33:14,335 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 01:33:14,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 01:33:14,336 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 01:33:14,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 01:33:14,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 01:33:14,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 01:33:14,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 01:33:14,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 01:33:14,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 01:33:14,337 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 01:33:14,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 01:33:14,337 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 01:33:14,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 01:33:14,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 01:33:14,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 01:33:14,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 01:33:14,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 01:33:14,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 01:33:14,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 01:33:14,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 01:33:14,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 01:33:14,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 01:33:14,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 01:33:14,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 01:33:14,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 01:33:14,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 01:33:14,646 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 01:33:14,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 01:33:14,651 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 01:33:14,652 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 01:33:14,652 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2020-10-16 01:33:14,715 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f196c76d/2b35a1a2698f40bcb8e61a120697e599/FLAG147293f5c [2020-10-16 01:33:15,304 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 01:33:15,305 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2020-10-16 01:33:15,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f196c76d/2b35a1a2698f40bcb8e61a120697e599/FLAG147293f5c [2020-10-16 01:33:15,732 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f196c76d/2b35a1a2698f40bcb8e61a120697e599 [2020-10-16 01:33:15,742 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 01:33:15,744 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 01:33:15,745 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 01:33:15,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 01:33:15,750 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 01:33:15,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:33:15" (1/1) ... [2020-10-16 01:33:15,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fe617e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:15, skipping insertion in model container [2020-10-16 01:33:15,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 01:33:15" (1/1) ... [2020-10-16 01:33:15,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 01:33:15,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 01:33:16,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:33:16,463 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 01:33:16,524 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 01:33:16,605 INFO L208 MainTranslator]: Completed translation [2020-10-16 01:33:16,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16 WrapperNode [2020-10-16 01:33:16,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 01:33:16,607 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 01:33:16,607 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 01:33:16,607 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 01:33:16,618 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:33:16" (1/1) ... [2020-10-16 01:33:16,639 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:33:16" (1/1) ... [2020-10-16 01:33:16,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 01:33:16,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 01:33:16,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 01:33:16,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 01:33:16,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (1/1) ... [2020-10-16 01:33:16,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (1/1) ... [2020-10-16 01:33:16,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (1/1) ... [2020-10-16 01:33:16,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (1/1) ... [2020-10-16 01:33:16,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (1/1) ... [2020-10-16 01:33:16,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (1/1) ... [2020-10-16 01:33:16,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (1/1) ... [2020-10-16 01:33:16,727 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 01:33:16,728 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 01:33:16,728 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 01:33:16,728 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 01:33:16,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (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:33:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 01:33:16,803 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 01:33:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 01:33:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 01:33:16,805 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 01:33:16,805 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 01:33:16,807 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 01:33:16,807 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 01:33:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 01:33:16,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 01:33:16,811 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 01:33:16,815 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:33:20,166 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 01:33:20,167 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 01:33:20,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:33:20 BoogieIcfgContainer [2020-10-16 01:33:20,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 01:33:20,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 01:33:20,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 01:33:20,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 01:33:20,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 01:33:15" (1/3) ... [2020-10-16 01:33:20,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f7b854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:33:20, skipping insertion in model container [2020-10-16 01:33:20,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 01:33:16" (2/3) ... [2020-10-16 01:33:20,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f7b854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 01:33:20, skipping insertion in model container [2020-10-16 01:33:20,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 01:33:20" (3/3) ... [2020-10-16 01:33:20,228 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi003_tso.opt.i [2020-10-16 01:33:20,239 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 01:33:20,249 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 01:33:20,251 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 01:33:20,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,295 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,296 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,296 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,297 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,298 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,299 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,300 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,301 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,302 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,303 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,303 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,303 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,303 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,304 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,308 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,317 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,318 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,319 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,320 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,321 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,322 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,323 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,327 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,332 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,335 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,344 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,345 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,346 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,349 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,350 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,351 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,351 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,352 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,353 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,354 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,354 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,355 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 01:33:20,380 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 01:33:20,409 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 01:33:20,410 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 01:33:20,410 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 01:33:20,410 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 01:33:20,410 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 01:33:20,410 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 01:33:20,411 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 01:33:20,411 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 01:33:20,427 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 01:33:20,475 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 01:33:20,475 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:20,480 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 57 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:33:20,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 85 places, 80 transitions, 170 flow [2020-10-16 01:33:20,488 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 78 transitions, 162 flow [2020-10-16 01:33:20,491 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 01:33:20,495 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 01:33:20,499 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 83 places, 78 transitions, 162 flow [2020-10-16 01:33:20,500 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 83 places, 78 transitions, 162 flow [2020-10-16 01:33:20,522 INFO L129 PetriNetUnfolder]: 2/78 cut-off events. [2020-10-16 01:33:20,522 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:20,523 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 57 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:33:20,526 INFO L117 LiptonReduction]: Number of co-enabled transitions 1088 [2020-10-16 01:33:20,976 WARN L193 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 01:33:21,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:21,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,222 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:33:21,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,224 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:33:21,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:21,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:21,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,405 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:21,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,407 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:33:21,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,409 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:33:21,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,451 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:21,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:21,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:21,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:21,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:21,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:21,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,568 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:33:21,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,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:33:21,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:21,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,693 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,723 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,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:33:21,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:21,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:21,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:21,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:33:21,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:21,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:21,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:21,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:21,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:22,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,047 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:22,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,056 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:33:22,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,059 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:33:22,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:33:22,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:33:22,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:33:22,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:22,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:22,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,487 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:33:22,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,489 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:33:22,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:22,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:22,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:22,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:22,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:22,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:22,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:22,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:22,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:22,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:22,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:22,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:22,586 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:22,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:22,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:22,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:22,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,668 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:33:22,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,669 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:33:22,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,704 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:22,706 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:22,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:22,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:22,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:22,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:22,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:22,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:22,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:22,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,800 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:33:22,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:22,801 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:33:22,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:33:23,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:33:23,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:23,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:23,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 01:33:23,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:23,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 01:33:23,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 01:33:23,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,199 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 01:33:23,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,201 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:33:23,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,203 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:33:23,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,285 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 01:33:23,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:33:23,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:33:23,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:33:23,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:23,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:33:23,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:23,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:33:23,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:33:23,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:33:23,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:23,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:23,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:23,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:23,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,562 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:23,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 01:33:23,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 01:33:23,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 01:33:23,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,611 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,613 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 01:33:23,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 01:33:23,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:33:23,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:33:23,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 01:33:23,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 01:33:23,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,654 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:33:23,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:23,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 01:33:23,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 01:33:23,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 01:33:23,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:24,794 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 01:33:24,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 01:33:24,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:24,810 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 01:33:24,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 01:33:25,688 WARN L193 SmtUtils]: Spent 862.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 01:33:26,344 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 110 [2020-10-16 01:33:26,615 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 01:33:27,263 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 127 [2020-10-16 01:33:27,560 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-16 01:33:28,259 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 01:33:28,577 WARN L193 SmtUtils]: Spent 315.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 01:33:28,813 WARN L193 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2020-10-16 01:33:28,919 INFO L132 LiptonReduction]: Checked pairs total: 3121 [2020-10-16 01:33:28,919 INFO L134 LiptonReduction]: Total number of compositions: 64 [2020-10-16 01:33:28,921 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8433 [2020-10-16 01:33:28,928 INFO L129 PetriNetUnfolder]: 0/12 cut-off events. [2020-10-16 01:33:28,929 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:28,929 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:28,930 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2020-10-16 01:33:28,930 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:33:28,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:28,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1713594894, now seen corresponding path program 1 times [2020-10-16 01:33:28,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:28,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111977180] [2020-10-16 01:33:28,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:29,169 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:29,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111977180] [2020-10-16 01:33:29,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:29,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:33:29,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571474796] [2020-10-16 01:33:29,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:33:29,181 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:33:29,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:33:29,199 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 144 [2020-10-16 01:33:29,201 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states. [2020-10-16 01:33:29,201 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:29,202 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 144 [2020-10-16 01:33:29,203 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:29,342 INFO L129 PetriNetUnfolder]: 74/156 cut-off events. [2020-10-16 01:33:29,342 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:29,344 INFO L80 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 156 events. 74/156 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 598 event pairs, 6 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 289. Up to 117 conditions per place. [2020-10-16 01:33:29,346 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 11 selfloop transitions, 2 changer transitions 2/24 dead transitions. [2020-10-16 01:33:29,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 84 flow [2020-10-16 01:33:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:33:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:33:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2020-10-16 01:33:29,369 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356481481481481 [2020-10-16 01:33:29,370 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2020-10-16 01:33:29,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2020-10-16 01:33:29,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:29,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2020-10-16 01:33:29,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:33:29,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:33:29,397 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:33:29,399 INFO L185 Difference]: Start difference. First operand has 27 places, 20 transitions, 46 flow. Second operand 3 states and 361 transitions. [2020-10-16 01:33:29,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 84 flow [2020-10-16 01:33:29,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:33:29,404 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 44 flow [2020-10-16 01:33:29,407 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, 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=44, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2020-10-16 01:33:29,408 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 01:33:29,408 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 44 flow [2020-10-16 01:33:29,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:33:29,408 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:29,408 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:29,409 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 01:33:29,409 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:33:29,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:29,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1581845299, now seen corresponding path program 1 times [2020-10-16 01:33:29,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:29,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460029660] [2020-10-16 01:33:29,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:29,533 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:29,534 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460029660] [2020-10-16 01:33:29,534 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:29,534 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:33:29,534 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374277807] [2020-10-16 01:33:29,535 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:33:29,536 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:29,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:33:29,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:33:29,538 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 144 [2020-10-16 01:33:29,538 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 44 flow. Second operand 3 states. [2020-10-16 01:33:29,538 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:29,538 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 144 [2020-10-16 01:33:29,538 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:29,556 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2020-10-16 01:33:29,556 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 01:33:29,556 INFO L80 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 18 events. 0/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 21 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 01:33:29,557 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 1 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2020-10-16 01:33:29,557 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 18 transitions, 50 flow [2020-10-16 01:33:29,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:33:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:33:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2020-10-16 01:33:29,560 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8842592592592593 [2020-10-16 01:33:29,560 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2020-10-16 01:33:29,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2020-10-16 01:33:29,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:29,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2020-10-16 01:33:29,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:33:29,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:33:29,563 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:33:29,563 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 44 flow. Second operand 3 states and 382 transitions. [2020-10-16 01:33:29,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 18 transitions, 50 flow [2020-10-16 01:33:29,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 18 transitions, 46 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:33:29,564 INFO L241 Difference]: Finished difference. Result has 26 places, 18 transitions, 48 flow [2020-10-16 01:33:29,565 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=48, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2020-10-16 01:33:29,565 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2020-10-16 01:33:29,565 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 48 flow [2020-10-16 01:33:29,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:33:29,566 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:29,566 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:29,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 01:33:29,566 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:33:29,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:29,566 INFO L82 PathProgramCache]: Analyzing trace with hash 372689921, now seen corresponding path program 1 times [2020-10-16 01:33:29,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:29,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015382005] [2020-10-16 01:33:29,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:29,658 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:29,658 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015382005] [2020-10-16 01:33:29,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:29,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 01:33:29,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493255580] [2020-10-16 01:33:29,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 01:33:29,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:29,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 01:33:29,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 01:33:29,661 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 144 [2020-10-16 01:33:29,662 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states. [2020-10-16 01:33:29,662 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:29,662 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 144 [2020-10-16 01:33:29,662 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:29,681 INFO L129 PetriNetUnfolder]: 0/18 cut-off events. [2020-10-16 01:33:29,681 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2020-10-16 01:33:29,681 INFO L80 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 18 events. 0/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 1/19 useless extension candidates. Maximal degree in co-relation 0. Up to 3 conditions per place. [2020-10-16 01:33:29,681 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 1 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2020-10-16 01:33:29,682 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 18 transitions, 54 flow [2020-10-16 01:33:29,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 01:33:29,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 01:33:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2020-10-16 01:33:29,684 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8842592592592593 [2020-10-16 01:33:29,684 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2020-10-16 01:33:29,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2020-10-16 01:33:29,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:29,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2020-10-16 01:33:29,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 01:33:29,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 01:33:29,687 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 01:33:29,688 INFO L185 Difference]: Start difference. First operand has 26 places, 18 transitions, 48 flow. Second operand 3 states and 382 transitions. [2020-10-16 01:33:29,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 18 transitions, 54 flow [2020-10-16 01:33:29,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 18 transitions, 50 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 01:33:29,689 INFO L241 Difference]: Finished difference. Result has 27 places, 18 transitions, 52 flow [2020-10-16 01:33:29,689 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2020-10-16 01:33:29,689 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2020-10-16 01:33:29,689 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 52 flow [2020-10-16 01:33:29,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 01:33:29,690 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:29,690 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:29,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 01:33:29,690 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:33:29,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:29,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1331514732, now seen corresponding path program 1 times [2020-10-16 01:33:29,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:29,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140800965] [2020-10-16 01:33:29,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:29,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:30,128 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:30,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140800965] [2020-10-16 01:33:30,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:30,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 01:33:30,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850628773] [2020-10-16 01:33:30,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 01:33:30,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:30,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 01:33:30,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 01:33:30,132 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 144 [2020-10-16 01:33:30,133 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 52 flow. Second operand 7 states. [2020-10-16 01:33:30,133 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:30,133 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 144 [2020-10-16 01:33:30,133 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:30,432 INFO L129 PetriNetUnfolder]: 59/131 cut-off events. [2020-10-16 01:33:30,432 INFO L130 PetriNetUnfolder]: For 22/22 co-relation queries the response was YES. [2020-10-16 01:33:30,433 INFO L80 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 131 events. 59/131 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 453 event pairs, 5 based on Foata normal form. 3/134 useless extension candidates. Maximal degree in co-relation 289. Up to 90 conditions per place. [2020-10-16 01:33:30,434 INFO L132 encePairwiseOnDemand]: 135/144 looper letters, 14 selfloop transitions, 15 changer transitions 0/37 dead transitions. [2020-10-16 01:33:30,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 37 transitions, 156 flow [2020-10-16 01:33:30,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:33:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:33:30,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 601 transitions. [2020-10-16 01:33:30,437 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6956018518518519 [2020-10-16 01:33:30,437 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 601 transitions. [2020-10-16 01:33:30,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 601 transitions. [2020-10-16 01:33:30,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:30,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 601 transitions. [2020-10-16 01:33:30,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:33:30,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:33:30,441 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:33:30,441 INFO L185 Difference]: Start difference. First operand has 27 places, 18 transitions, 52 flow. Second operand 6 states and 601 transitions. [2020-10-16 01:33:30,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 37 transitions, 156 flow [2020-10-16 01:33:30,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 142 flow, removed 1 selfloop flow, removed 3 redundant places. [2020-10-16 01:33:30,444 INFO L241 Difference]: Finished difference. Result has 32 places, 31 transitions, 138 flow [2020-10-16 01:33:30,444 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=32, PETRI_TRANSITIONS=31} [2020-10-16 01:33:30,444 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 5 predicate places. [2020-10-16 01:33:30,444 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 31 transitions, 138 flow [2020-10-16 01:33:30,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 01:33:30,444 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:30,445 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:30,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 01:33:30,445 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:33:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:30,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2049929502, now seen corresponding path program 2 times [2020-10-16 01:33:30,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:30,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879829402] [2020-10-16 01:33:30,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:30,639 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:30,640 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879829402] [2020-10-16 01:33:30,640 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:30,640 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:33:30,640 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025849592] [2020-10-16 01:33:30,641 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 01:33:30,641 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:30,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 01:33:30,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-16 01:33:30,643 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 144 [2020-10-16 01:33:30,643 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 31 transitions, 138 flow. Second operand 6 states. [2020-10-16 01:33:30,643 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:30,643 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 144 [2020-10-16 01:33:30,644 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:30,803 INFO L129 PetriNetUnfolder]: 56/130 cut-off events. [2020-10-16 01:33:30,803 INFO L130 PetriNetUnfolder]: For 84/96 co-relation queries the response was YES. [2020-10-16 01:33:30,807 INFO L80 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 130 events. 56/130 cut-off events. For 84/96 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 475 event pairs, 25 based on Foata normal form. 6/136 useless extension candidates. Maximal degree in co-relation 405. Up to 97 conditions per place. [2020-10-16 01:33:30,809 INFO L132 encePairwiseOnDemand]: 138/144 looper letters, 25 selfloop transitions, 10 changer transitions 0/43 dead transitions. [2020-10-16 01:33:30,810 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 43 transitions, 272 flow [2020-10-16 01:33:30,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:33:30,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:33:30,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2020-10-16 01:33:30,818 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2020-10-16 01:33:30,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2020-10-16 01:33:30,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2020-10-16 01:33:30,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:30,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2020-10-16 01:33:30,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:33:30,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:33:30,827 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:33:30,828 INFO L185 Difference]: Start difference. First operand has 32 places, 31 transitions, 138 flow. Second operand 5 states and 512 transitions. [2020-10-16 01:33:30,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 43 transitions, 272 flow [2020-10-16 01:33:30,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 272 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 01:33:30,834 INFO L241 Difference]: Finished difference. Result has 39 places, 38 transitions, 224 flow [2020-10-16 01:33:30,835 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=39, PETRI_TRANSITIONS=38} [2020-10-16 01:33:30,835 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 12 predicate places. [2020-10-16 01:33:30,835 INFO L481 AbstractCegarLoop]: Abstraction has has 39 places, 38 transitions, 224 flow [2020-10-16 01:33:30,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 01:33:30,835 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:30,836 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:30,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 01:33:30,836 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:33:30,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:30,836 INFO L82 PathProgramCache]: Analyzing trace with hash -471800, now seen corresponding path program 1 times [2020-10-16 01:33:30,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:30,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424306803] [2020-10-16 01:33:30,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:30,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 01:33:30,978 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424306803] [2020-10-16 01:33:30,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:30,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:33:30,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195902041] [2020-10-16 01:33:30,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:33:30,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:30,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:33:30,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:33:30,981 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2020-10-16 01:33:30,982 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 38 transitions, 224 flow. Second operand 4 states. [2020-10-16 01:33:30,982 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:30,982 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2020-10-16 01:33:30,982 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:31,018 INFO L129 PetriNetUnfolder]: 15/63 cut-off events. [2020-10-16 01:33:31,018 INFO L130 PetriNetUnfolder]: For 135/152 co-relation queries the response was YES. [2020-10-16 01:33:31,019 INFO L80 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 63 events. 15/63 cut-off events. For 135/152 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 189 event pairs, 4 based on Foata normal form. 24/86 useless extension candidates. Maximal degree in co-relation 175. Up to 24 conditions per place. [2020-10-16 01:33:31,019 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 4 selfloop transitions, 5 changer transitions 3/33 dead transitions. [2020-10-16 01:33:31,019 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 33 transitions, 176 flow [2020-10-16 01:33:31,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 01:33:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 01:33:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2020-10-16 01:33:31,023 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8319444444444445 [2020-10-16 01:33:31,023 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 599 transitions. [2020-10-16 01:33:31,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 599 transitions. [2020-10-16 01:33:31,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:31,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 599 transitions. [2020-10-16 01:33:31,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 01:33:31,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 01:33:31,026 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 01:33:31,026 INFO L185 Difference]: Start difference. First operand has 39 places, 38 transitions, 224 flow. Second operand 5 states and 599 transitions. [2020-10-16 01:33:31,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 33 transitions, 176 flow [2020-10-16 01:33:31,028 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 160 flow, removed 1 selfloop flow, removed 4 redundant places. [2020-10-16 01:33:31,029 INFO L241 Difference]: Finished difference. Result has 42 places, 30 transitions, 159 flow [2020-10-16 01:33:31,029 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2020-10-16 01:33:31,029 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 15 predicate places. [2020-10-16 01:33:31,030 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 159 flow [2020-10-16 01:33:31,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:33:31,030 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:31,030 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:31,030 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 01:33:31,030 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:33:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:31,031 INFO L82 PathProgramCache]: Analyzing trace with hash 2127509390, now seen corresponding path program 1 times [2020-10-16 01:33:31,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:31,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529082639] [2020-10-16 01:33:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:31,509 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-10-16 01:33:31,774 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:31,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529082639] [2020-10-16 01:33:31,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:31,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:33:31,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425350938] [2020-10-16 01:33:31,775 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:33:31,775 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:31,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:33:31,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:33:31,777 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 144 [2020-10-16 01:33:31,778 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 159 flow. Second operand 11 states. [2020-10-16 01:33:31,778 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:31,778 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 144 [2020-10-16 01:33:31,778 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:32,372 INFO L129 PetriNetUnfolder]: 109/240 cut-off events. [2020-10-16 01:33:32,373 INFO L130 PetriNetUnfolder]: For 406/414 co-relation queries the response was YES. [2020-10-16 01:33:32,374 INFO L80 FinitePrefix]: Finished finitePrefix Result has 880 conditions, 240 events. 109/240 cut-off events. For 406/414 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 976 event pairs, 14 based on Foata normal form. 8/247 useless extension candidates. Maximal degree in co-relation 860. Up to 149 conditions per place. [2020-10-16 01:33:32,376 INFO L132 encePairwiseOnDemand]: 132/144 looper letters, 19 selfloop transitions, 23 changer transitions 20/67 dead transitions. [2020-10-16 01:33:32,376 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 67 transitions, 470 flow [2020-10-16 01:33:32,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:33:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:33:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 978 transitions. [2020-10-16 01:33:32,382 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424 [2020-10-16 01:33:32,382 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 978 transitions. [2020-10-16 01:33:32,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 978 transitions. [2020-10-16 01:33:32,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:32,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 978 transitions. [2020-10-16 01:33:32,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:33:32,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:33:32,387 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:33:32,388 INFO L185 Difference]: Start difference. First operand has 42 places, 30 transitions, 159 flow. Second operand 11 states and 978 transitions. [2020-10-16 01:33:32,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 67 transitions, 470 flow [2020-10-16 01:33:32,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 470 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 01:33:32,393 INFO L241 Difference]: Finished difference. Result has 58 places, 43 transitions, 311 flow [2020-10-16 01:33:32,393 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=311, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2020-10-16 01:33:32,394 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 31 predicate places. [2020-10-16 01:33:32,394 INFO L481 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 311 flow [2020-10-16 01:33:32,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:33:32,394 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:32,394 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:32,394 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 01:33:32,394 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:33:32,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:32,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1201870470, now seen corresponding path program 2 times [2020-10-16 01:33:32,395 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:32,395 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158626727] [2020-10-16 01:33:32,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:32,780 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 42 [2020-10-16 01:33:32,942 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 46 [2020-10-16 01:33:33,109 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 38 [2020-10-16 01:33:33,329 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:33,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158626727] [2020-10-16 01:33:33,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:33,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 01:33:33,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111090555] [2020-10-16 01:33:33,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 01:33:33,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:33,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 01:33:33,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 01:33:33,332 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 144 [2020-10-16 01:33:33,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 311 flow. Second operand 9 states. [2020-10-16 01:33:33,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:33,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 144 [2020-10-16 01:33:33,333 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:33,480 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 36 [2020-10-16 01:33:33,764 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2020-10-16 01:33:33,900 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-10-16 01:33:34,250 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2020-10-16 01:33:34,501 INFO L129 PetriNetUnfolder]: 60/182 cut-off events. [2020-10-16 01:33:34,501 INFO L130 PetriNetUnfolder]: For 924/934 co-relation queries the response was YES. [2020-10-16 01:33:34,503 INFO L80 FinitePrefix]: Finished finitePrefix Result has 853 conditions, 182 events. 60/182 cut-off events. For 924/934 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 847 event pairs, 20 based on Foata normal form. 11/189 useless extension candidates. Maximal degree in co-relation 825. Up to 75 conditions per place. [2020-10-16 01:33:34,504 INFO L132 encePairwiseOnDemand]: 135/144 looper letters, 25 selfloop transitions, 22 changer transitions 4/64 dead transitions. [2020-10-16 01:33:34,504 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 573 flow [2020-10-16 01:33:34,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 01:33:34,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 01:33:34,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 856 transitions. [2020-10-16 01:33:34,510 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2020-10-16 01:33:34,510 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 856 transitions. [2020-10-16 01:33:34,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 856 transitions. [2020-10-16 01:33:34,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:34,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 856 transitions. [2020-10-16 01:33:34,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 01:33:34,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 01:33:34,516 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 01:33:34,516 INFO L185 Difference]: Start difference. First operand has 58 places, 43 transitions, 311 flow. Second operand 9 states and 856 transitions. [2020-10-16 01:33:34,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 573 flow [2020-10-16 01:33:34,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 64 transitions, 510 flow, removed 26 selfloop flow, removed 5 redundant places. [2020-10-16 01:33:34,523 INFO L241 Difference]: Finished difference. Result has 61 places, 54 transitions, 414 flow [2020-10-16 01:33:34,523 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=414, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2020-10-16 01:33:34,523 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 34 predicate places. [2020-10-16 01:33:34,524 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 414 flow [2020-10-16 01:33:34,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 01:33:34,524 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:34,524 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:34,524 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 01:33:34,524 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:33:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:34,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1235011310, now seen corresponding path program 3 times [2020-10-16 01:33:34,525 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:34,525 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580661799] [2020-10-16 01:33:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:34,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:34,948 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:34,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580661799] [2020-10-16 01:33:34,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:34,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:33:34,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588024183] [2020-10-16 01:33:34,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:33:34,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:34,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:33:34,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:33:34,951 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 144 [2020-10-16 01:33:34,952 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 414 flow. Second operand 8 states. [2020-10-16 01:33:34,952 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:34,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 144 [2020-10-16 01:33:34,952 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:35,258 INFO L129 PetriNetUnfolder]: 65/205 cut-off events. [2020-10-16 01:33:35,258 INFO L130 PetriNetUnfolder]: For 777/793 co-relation queries the response was YES. [2020-10-16 01:33:35,260 INFO L80 FinitePrefix]: Finished finitePrefix Result has 969 conditions, 205 events. 65/205 cut-off events. For 777/793 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 996 event pairs, 13 based on Foata normal form. 7/211 useless extension candidates. Maximal degree in co-relation 941. Up to 91 conditions per place. [2020-10-16 01:33:35,262 INFO L132 encePairwiseOnDemand]: 134/144 looper letters, 22 selfloop transitions, 36 changer transitions 2/73 dead transitions. [2020-10-16 01:33:35,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 73 transitions, 675 flow [2020-10-16 01:33:35,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:33:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:33:35,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 700 transitions. [2020-10-16 01:33:35,266 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6944444444444444 [2020-10-16 01:33:35,267 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 700 transitions. [2020-10-16 01:33:35,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 700 transitions. [2020-10-16 01:33:35,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:35,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 700 transitions. [2020-10-16 01:33:35,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:33:35,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:33:35,271 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:33:35,272 INFO L185 Difference]: Start difference. First operand has 61 places, 54 transitions, 414 flow. Second operand 7 states and 700 transitions. [2020-10-16 01:33:35,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 73 transitions, 675 flow [2020-10-16 01:33:35,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 73 transitions, 643 flow, removed 13 selfloop flow, removed 2 redundant places. [2020-10-16 01:33:35,279 INFO L241 Difference]: Finished difference. Result has 68 places, 67 transitions, 602 flow [2020-10-16 01:33:35,279 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=602, PETRI_PLACES=68, PETRI_TRANSITIONS=67} [2020-10-16 01:33:35,279 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 41 predicate places. [2020-10-16 01:33:35,279 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 67 transitions, 602 flow [2020-10-16 01:33:35,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:33:35,280 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:35,280 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:35,280 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 01:33:35,280 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:33:35,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:35,280 INFO L82 PathProgramCache]: Analyzing trace with hash 389361608, now seen corresponding path program 4 times [2020-10-16 01:33:35,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:35,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632702819] [2020-10-16 01:33:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:35,435 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:35,435 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632702819] [2020-10-16 01:33:35,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:35,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 01:33:35,436 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703055998] [2020-10-16 01:33:35,437 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 01:33:35,437 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:35,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 01:33:35,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 01:33:35,442 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 144 [2020-10-16 01:33:35,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 67 transitions, 602 flow. Second operand 5 states. [2020-10-16 01:33:35,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:35,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 144 [2020-10-16 01:33:35,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:35,543 INFO L129 PetriNetUnfolder]: 30/138 cut-off events. [2020-10-16 01:33:35,544 INFO L130 PetriNetUnfolder]: For 810/830 co-relation queries the response was YES. [2020-10-16 01:33:35,545 INFO L80 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 138 events. 30/138 cut-off events. For 810/830 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 660 event pairs, 2 based on Foata normal form. 33/171 useless extension candidates. Maximal degree in co-relation 616. Up to 45 conditions per place. [2020-10-16 01:33:35,546 INFO L132 encePairwiseOnDemand]: 139/144 looper letters, 2 selfloop transitions, 7 changer transitions 8/65 dead transitions. [2020-10-16 01:33:35,546 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 597 flow [2020-10-16 01:33:35,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 01:33:35,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 01:33:35,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 714 transitions. [2020-10-16 01:33:35,550 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8263888888888888 [2020-10-16 01:33:35,550 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 714 transitions. [2020-10-16 01:33:35,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 714 transitions. [2020-10-16 01:33:35,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:35,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 714 transitions. [2020-10-16 01:33:35,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 01:33:35,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 01:33:35,557 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 01:33:35,557 INFO L185 Difference]: Start difference. First operand has 68 places, 67 transitions, 602 flow. Second operand 6 states and 714 transitions. [2020-10-16 01:33:35,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 597 flow [2020-10-16 01:33:35,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 532 flow, removed 20 selfloop flow, removed 5 redundant places. [2020-10-16 01:33:35,566 INFO L241 Difference]: Finished difference. Result has 71 places, 57 transitions, 471 flow [2020-10-16 01:33:35,566 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=71, PETRI_TRANSITIONS=57} [2020-10-16 01:33:35,566 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 44 predicate places. [2020-10-16 01:33:35,566 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 57 transitions, 471 flow [2020-10-16 01:33:35,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 01:33:35,567 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:35,567 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:35,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 01:33:35,567 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:33:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash -944053803, now seen corresponding path program 1 times [2020-10-16 01:33:35,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:35,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282588755] [2020-10-16 01:33:35,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:35,634 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:35,635 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282588755] [2020-10-16 01:33:35,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:35,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 01:33:35,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52323957] [2020-10-16 01:33:35,636 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 01:33:35,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 01:33:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 01:33:35,637 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 144 [2020-10-16 01:33:35,638 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 57 transitions, 471 flow. Second operand 4 states. [2020-10-16 01:33:35,638 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:35,638 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 144 [2020-10-16 01:33:35,638 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:35,710 INFO L129 PetriNetUnfolder]: 27/141 cut-off events. [2020-10-16 01:33:35,711 INFO L130 PetriNetUnfolder]: For 361/363 co-relation queries the response was YES. [2020-10-16 01:33:35,712 INFO L80 FinitePrefix]: Finished finitePrefix Result has 624 conditions, 141 events. 27/141 cut-off events. For 361/363 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 706 event pairs, 1 based on Foata normal form. 2/142 useless extension candidates. Maximal degree in co-relation 592. Up to 45 conditions per place. [2020-10-16 01:33:35,713 INFO L132 encePairwiseOnDemand]: 141/144 looper letters, 3 selfloop transitions, 1 changer transitions 31/58 dead transitions. [2020-10-16 01:33:35,713 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 58 transitions, 483 flow [2020-10-16 01:33:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 01:33:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 01:33:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2020-10-16 01:33:35,717 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8506944444444444 [2020-10-16 01:33:35,717 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 490 transitions. [2020-10-16 01:33:35,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 490 transitions. [2020-10-16 01:33:35,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:35,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 490 transitions. [2020-10-16 01:33:35,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 01:33:35,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 01:33:35,722 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 01:33:35,722 INFO L185 Difference]: Start difference. First operand has 71 places, 57 transitions, 471 flow. Second operand 4 states and 490 transitions. [2020-10-16 01:33:35,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 58 transitions, 483 flow [2020-10-16 01:33:35,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 58 transitions, 456 flow, removed 6 selfloop flow, removed 7 redundant places. [2020-10-16 01:33:35,730 INFO L241 Difference]: Finished difference. Result has 68 places, 27 transitions, 188 flow [2020-10-16 01:33:35,730 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=68, PETRI_TRANSITIONS=27} [2020-10-16 01:33:35,730 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 41 predicate places. [2020-10-16 01:33:35,731 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 27 transitions, 188 flow [2020-10-16 01:33:35,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 01:33:35,731 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:35,731 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:35,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 01:33:35,732 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:33:35,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:35,732 INFO L82 PathProgramCache]: Analyzing trace with hash 163838611, now seen corresponding path program 2 times [2020-10-16 01:33:35,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:35,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443068729] [2020-10-16 01:33:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:36,545 WARN L193 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 47 [2020-10-16 01:33:36,865 WARN L193 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 46 [2020-10-16 01:33:37,094 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 49 [2020-10-16 01:33:37,220 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 34 [2020-10-16 01:33:37,360 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 35 [2020-10-16 01:33:37,501 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 36 [2020-10-16 01:33:37,648 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 31 [2020-10-16 01:33:37,771 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:37,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443068729] [2020-10-16 01:33:37,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:37,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 01:33:37,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434551032] [2020-10-16 01:33:37,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 01:33:37,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 01:33:37,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-10-16 01:33:37,775 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 144 [2020-10-16 01:33:37,776 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 27 transitions, 188 flow. Second operand 14 states. [2020-10-16 01:33:37,776 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:37,776 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 144 [2020-10-16 01:33:37,777 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:37,908 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2020-10-16 01:33:38,300 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2020-10-16 01:33:38,600 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 59 [2020-10-16 01:33:38,928 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 51 [2020-10-16 01:33:39,074 INFO L129 PetriNetUnfolder]: 11/54 cut-off events. [2020-10-16 01:33:39,074 INFO L130 PetriNetUnfolder]: For 150/153 co-relation queries the response was YES. [2020-10-16 01:33:39,074 INFO L80 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 54 events. 11/54 cut-off events. For 150/153 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 113 event pairs, 1 based on Foata normal form. 1/55 useless extension candidates. Maximal degree in co-relation 242. Up to 26 conditions per place. [2020-10-16 01:33:39,075 INFO L132 encePairwiseOnDemand]: 135/144 looper letters, 11 selfloop transitions, 13 changer transitions 9/38 dead transitions. [2020-10-16 01:33:39,075 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 38 transitions, 334 flow [2020-10-16 01:33:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:33:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:33:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 900 transitions. [2020-10-16 01:33:39,079 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5681818181818182 [2020-10-16 01:33:39,079 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 900 transitions. [2020-10-16 01:33:39,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 900 transitions. [2020-10-16 01:33:39,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:39,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 900 transitions. [2020-10-16 01:33:39,082 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:33:39,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:33:39,085 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:33:39,085 INFO L185 Difference]: Start difference. First operand has 68 places, 27 transitions, 188 flow. Second operand 11 states and 900 transitions. [2020-10-16 01:33:39,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 38 transitions, 334 flow [2020-10-16 01:33:39,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 38 transitions, 264 flow, removed 17 selfloop flow, removed 18 redundant places. [2020-10-16 01:33:39,088 INFO L241 Difference]: Finished difference. Result has 55 places, 29 transitions, 193 flow [2020-10-16 01:33:39,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=193, PETRI_PLACES=55, PETRI_TRANSITIONS=29} [2020-10-16 01:33:39,089 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 28 predicate places. [2020-10-16 01:33:39,089 INFO L481 AbstractCegarLoop]: Abstraction has has 55 places, 29 transitions, 193 flow [2020-10-16 01:33:39,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 01:33:39,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:39,089 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:39,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 01:33:39,089 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:33:39,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1334441503, now seen corresponding path program 3 times [2020-10-16 01:33:39,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:39,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045994282] [2020-10-16 01:33:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:39,714 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2020-10-16 01:33:39,843 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:39,843 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045994282] [2020-10-16 01:33:39,844 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:39,844 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:33:39,844 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672205269] [2020-10-16 01:33:39,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:33:39,844 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:39,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:33:39,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:33:39,848 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 144 [2020-10-16 01:33:39,848 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 29 transitions, 193 flow. Second operand 11 states. [2020-10-16 01:33:39,848 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:39,848 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 144 [2020-10-16 01:33:39,849 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:40,129 WARN L193 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-10-16 01:33:40,240 INFO L129 PetriNetUnfolder]: 4/40 cut-off events. [2020-10-16 01:33:40,240 INFO L130 PetriNetUnfolder]: For 67/69 co-relation queries the response was YES. [2020-10-16 01:33:40,240 INFO L80 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 40 events. 4/40 cut-off events. For 67/69 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 157. Up to 11 conditions per place. [2020-10-16 01:33:40,241 INFO L132 encePairwiseOnDemand]: 137/144 looper letters, 6 selfloop transitions, 9 changer transitions 5/32 dead transitions. [2020-10-16 01:33:40,241 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 32 transitions, 253 flow [2020-10-16 01:33:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 01:33:40,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 01:33:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 777 transitions. [2020-10-16 01:33:40,249 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6744791666666666 [2020-10-16 01:33:40,249 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 777 transitions. [2020-10-16 01:33:40,249 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 777 transitions. [2020-10-16 01:33:40,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:40,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 777 transitions. [2020-10-16 01:33:40,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 01:33:40,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 01:33:40,254 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 01:33:40,254 INFO L185 Difference]: Start difference. First operand has 55 places, 29 transitions, 193 flow. Second operand 8 states and 777 transitions. [2020-10-16 01:33:40,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 32 transitions, 253 flow [2020-10-16 01:33:40,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 32 transitions, 197 flow, removed 16 selfloop flow, removed 11 redundant places. [2020-10-16 01:33:40,256 INFO L241 Difference]: Finished difference. Result has 50 places, 27 transitions, 153 flow [2020-10-16 01:33:40,256 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=153, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2020-10-16 01:33:40,256 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 23 predicate places. [2020-10-16 01:33:40,257 INFO L481 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 153 flow [2020-10-16 01:33:40,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:33:40,257 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:40,257 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:40,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 01:33:40,257 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:33:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:40,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1280186337, now seen corresponding path program 4 times [2020-10-16 01:33:40,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:40,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337035483] [2020-10-16 01:33:40,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:40,632 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 24 [2020-10-16 01:33:40,805 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2020-10-16 01:33:40,998 WARN L193 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2020-10-16 01:33:41,173 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-10-16 01:33:41,313 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 28 [2020-10-16 01:33:41,531 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:41,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337035483] [2020-10-16 01:33:41,532 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:41,532 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 01:33:41,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533165682] [2020-10-16 01:33:41,533 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 01:33:41,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:41,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 01:33:41,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-16 01:33:41,534 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 144 [2020-10-16 01:33:41,535 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 153 flow. Second operand 11 states. [2020-10-16 01:33:41,535 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:41,535 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 144 [2020-10-16 01:33:41,535 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:42,033 INFO L129 PetriNetUnfolder]: 5/38 cut-off events. [2020-10-16 01:33:42,033 INFO L130 PetriNetUnfolder]: For 45/47 co-relation queries the response was YES. [2020-10-16 01:33:42,033 INFO L80 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 38 events. 5/38 cut-off events. For 45/47 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 51 event pairs, 0 based on Foata normal form. 2/40 useless extension candidates. Maximal degree in co-relation 143. Up to 9 conditions per place. [2020-10-16 01:33:42,034 INFO L132 encePairwiseOnDemand]: 134/144 looper letters, 12 selfloop transitions, 8 changer transitions 9/34 dead transitions. [2020-10-16 01:33:42,034 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 34 transitions, 255 flow [2020-10-16 01:33:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 01:33:42,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 01:33:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 926 transitions. [2020-10-16 01:33:42,039 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5845959595959596 [2020-10-16 01:33:42,039 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 926 transitions. [2020-10-16 01:33:42,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 926 transitions. [2020-10-16 01:33:42,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:42,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 926 transitions. [2020-10-16 01:33:42,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 01:33:42,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 01:33:42,045 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 01:33:42,045 INFO L185 Difference]: Start difference. First operand has 50 places, 27 transitions, 153 flow. Second operand 11 states and 926 transitions. [2020-10-16 01:33:42,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 34 transitions, 255 flow [2020-10-16 01:33:42,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 34 transitions, 214 flow, removed 13 selfloop flow, removed 8 redundant places. [2020-10-16 01:33:42,047 INFO L241 Difference]: Finished difference. Result has 53 places, 25 transitions, 139 flow [2020-10-16 01:33:42,047 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=139, PETRI_PLACES=53, PETRI_TRANSITIONS=25} [2020-10-16 01:33:42,047 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 26 predicate places. [2020-10-16 01:33:42,048 INFO L481 AbstractCegarLoop]: Abstraction has has 53 places, 25 transitions, 139 flow [2020-10-16 01:33:42,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 01:33:42,048 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 01:33:42,048 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 01:33:42,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 01:33:42,048 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:33:42,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 01:33:42,049 INFO L82 PathProgramCache]: Analyzing trace with hash -2068351087, now seen corresponding path program 5 times [2020-10-16 01:33:42,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 01:33:42,049 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512731084] [2020-10-16 01:33:42,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 01:33:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 01:33:42,502 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:42,502 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512731084] [2020-10-16 01:33:42,502 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 01:33:42,502 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 01:33:42,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729984732] [2020-10-16 01:33:42,503 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 01:33:42,503 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 01:33:42,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 01:33:42,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 01:33:42,505 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 144 [2020-10-16 01:33:42,505 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 25 transitions, 139 flow. Second operand 8 states. [2020-10-16 01:33:42,505 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 01:33:42,505 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 144 [2020-10-16 01:33:42,505 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 01:33:42,688 INFO L129 PetriNetUnfolder]: 3/28 cut-off events. [2020-10-16 01:33:42,689 INFO L130 PetriNetUnfolder]: For 46/48 co-relation queries the response was YES. [2020-10-16 01:33:42,689 INFO L80 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 28 events. 3/28 cut-off events. For 46/48 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 25 event pairs, 0 based on Foata normal form. 1/29 useless extension candidates. Maximal degree in co-relation 98. Up to 6 conditions per place. [2020-10-16 01:33:42,689 INFO L132 encePairwiseOnDemand]: 138/144 looper letters, 0 selfloop transitions, 0 changer transitions 24/24 dead transitions. [2020-10-16 01:33:42,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 24 transitions, 161 flow [2020-10-16 01:33:42,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 01:33:42,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 01:33:42,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 690 transitions. [2020-10-16 01:33:42,693 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6845238095238095 [2020-10-16 01:33:42,693 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 690 transitions. [2020-10-16 01:33:42,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 690 transitions. [2020-10-16 01:33:42,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 01:33:42,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 690 transitions. [2020-10-16 01:33:42,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 01:33:42,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 01:33:42,697 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 01:33:42,697 INFO L185 Difference]: Start difference. First operand has 53 places, 25 transitions, 139 flow. Second operand 7 states and 690 transitions. [2020-10-16 01:33:42,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 24 transitions, 161 flow [2020-10-16 01:33:42,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 24 transitions, 147 flow, removed 1 selfloop flow, removed 7 redundant places. [2020-10-16 01:33:42,699 INFO L241 Difference]: Finished difference. Result has 47 places, 0 transitions, 0 flow [2020-10-16 01:33:42,699 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=47, PETRI_TRANSITIONS=0} [2020-10-16 01:33:42,699 INFO L342 CegarLoopForPetriNet]: 27 programPoint places, 20 predicate places. [2020-10-16 01:33:42,699 INFO L481 AbstractCegarLoop]: Abstraction has has 47 places, 0 transitions, 0 flow [2020-10-16 01:33:42,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 01:33:42,699 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 01:33:42,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 01:33:42 BasicIcfg [2020-10-16 01:33:42,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 01:33:42,705 INFO L168 Benchmark]: Toolchain (without parser) took 26961.79 ms. Allocated memory was 251.7 MB in the beginning and 747.1 MB in the end (delta: 495.5 MB). Free memory was 206.7 MB in the beginning and 280.4 MB in the end (delta: -73.7 MB). Peak memory consumption was 421.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:42,706 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-16 01:33:42,706 INFO L168 Benchmark]: CACSL2BoogieTranslator took 861.64 ms. Allocated memory was 251.7 MB in the beginning and 313.0 MB in the end (delta: 61.3 MB). Free memory was 206.7 MB in the beginning and 261.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 30.8 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:42,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.05 ms. Allocated memory is still 313.0 MB. Free memory was 261.1 MB in the beginning and 256.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:42,708 INFO L168 Benchmark]: Boogie Preprocessor took 47.40 ms. Allocated memory is still 313.0 MB. Free memory was 256.8 MB in the beginning and 253.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:42,708 INFO L168 Benchmark]: RCFGBuilder took 3442.17 ms. Allocated memory was 313.0 MB in the beginning and 369.1 MB in the end (delta: 56.1 MB). Free memory was 253.5 MB in the beginning and 156.9 MB in the end (delta: 96.6 MB). Peak memory consumption was 152.7 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:42,709 INFO L168 Benchmark]: TraceAbstraction took 22532.13 ms. Allocated memory was 369.1 MB in the beginning and 747.1 MB in the end (delta: 378.0 MB). Free memory was 156.9 MB in the beginning and 280.4 MB in the end (delta: -123.5 MB). Peak memory consumption was 254.5 MB. Max. memory is 14.2 GB. [2020-10-16 01:33:42,712 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.36 ms. Allocated memory is still 251.7 MB. Free memory was 229.7 MB in the beginning and 228.9 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 861.64 ms. Allocated memory was 251.7 MB in the beginning and 313.0 MB in the end (delta: 61.3 MB). Free memory was 206.7 MB in the beginning and 261.1 MB in the end (delta: -54.3 MB). Peak memory consumption was 30.8 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 73.05 ms. Allocated memory is still 313.0 MB. Free memory was 261.1 MB in the beginning and 256.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.40 ms. Allocated memory is still 313.0 MB. Free memory was 256.8 MB in the beginning and 253.5 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3442.17 ms. Allocated memory was 313.0 MB in the beginning and 369.1 MB in the end (delta: 56.1 MB). Free memory was 253.5 MB in the beginning and 156.9 MB in the end (delta: 96.6 MB). Peak memory consumption was 152.7 MB. Max. memory is 14.2 GB. * TraceAbstraction took 22532.13 ms. Allocated memory was 369.1 MB in the beginning and 747.1 MB in the end (delta: 378.0 MB). Free memory was 156.9 MB in the beginning and 280.4 MB in the end (delta: -123.5 MB). Peak memory consumption was 254.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 642 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 43 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 83 PlacesBefore, 27 PlacesAfterwards, 78 TransitionsBefore, 20 TransitionsAfterwards, 1088 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 64 TotalNumberOfCompositions, 3121 MoverChecksTotal - PositiveResult [Line: 7]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 7]: 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: 22.2s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.5s, HoareTripleCheckerStatistics: 60 SDtfs, 50 SDslu, 32 SDs, 0 SdLazy, 916 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=602occurred in iteration=9, 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.7s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 203 NumberOfCodeBlocks, 203 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 56366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...