/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:09:41,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:09:41,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:09:41,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:09:41,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:09:41,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:09:41,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:09:41,246 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:09:41,247 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:09:41,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:09:41,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:09:41,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:09:41,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:09:41,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:09:41,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:09:41,260 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:09:41,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:09:41,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:09:41,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:09:41,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:09:41,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:09:41,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:09:41,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:09:41,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:09:41,292 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:09:41,292 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:09:41,292 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:09:41,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:09:41,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:09:41,296 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:09:41,296 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:09:41,297 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:09:41,298 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:09:41,302 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:09:41,303 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:09:41,303 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:09:41,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:09:41,307 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:09:41,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:09:41,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:09:41,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:09:41,312 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe-SemanticLooper.epf [2020-10-16 05:09:41,350 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:09:41,351 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:09:41,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:09:41,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:09:41,354 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:09:41,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:09:41,354 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:09:41,355 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:09:41,355 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:09:41,355 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:09:41,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:09:41,356 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:09:41,356 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:09:41,357 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:09:41,357 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:09:41,357 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:09:41,357 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:09:41,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:09:41,358 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:09:41,358 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:09:41,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:09:41,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:09:41,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:09:41,359 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:09:41,359 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:09:41,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:09:41,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:09:41,360 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:09:41,360 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:09:41,663 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:09:41,679 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:09:41,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:09:41,685 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:09:41,685 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:09:41,686 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2020-10-16 05:09:41,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8a65df0/ee2b11a52f974fa590cf3bb2113bbb97/FLAG27c2b35df [2020-10-16 05:09:42,327 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:09:42,327 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2020-10-16 05:09:42,348 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8a65df0/ee2b11a52f974fa590cf3bb2113bbb97/FLAG27c2b35df [2020-10-16 05:09:42,602 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e8a65df0/ee2b11a52f974fa590cf3bb2113bbb97 [2020-10-16 05:09:42,612 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:09:42,614 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:09:42,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:09:42,615 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:09:42,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:09:42,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:09:42" (1/1) ... [2020-10-16 05:09:42,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120f1139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:42, skipping insertion in model container [2020-10-16 05:09:42,624 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:09:42" (1/1) ... [2020-10-16 05:09:42,633 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:09:42,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:09:43,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:09:43,219 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:09:43,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:09:43,383 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:09:43,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43 WrapperNode [2020-10-16 05:09:43,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:09:43,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:09:43,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:09:43,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:09:43,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:09:43,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:09:43,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:09:43,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:09:43,506 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,522 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,526 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (1/1) ... [2020-10-16 05:09:43,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:09:43,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:09:43,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:09:43,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:09:43,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (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 05:09:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:09:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:09:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:09:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:09:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:09:43,617 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:09:43,618 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:09:43,618 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:09:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:09:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:09:43,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:09:43,623 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 05:09:45,626 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:09:45,626 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:09:45,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:09:45 BoogieIcfgContainer [2020-10-16 05:09:45,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:09:45,630 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:09:45,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:09:45,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:09:45,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:09:42" (1/3) ... [2020-10-16 05:09:45,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74afb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:09:45, skipping insertion in model container [2020-10-16 05:09:45,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:09:43" (2/3) ... [2020-10-16 05:09:45,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74afb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:09:45, skipping insertion in model container [2020-10-16 05:09:45,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:09:45" (3/3) ... [2020-10-16 05:09:45,637 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2020-10-16 05:09:45,650 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:09:45,658 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:09:45,659 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:09:45,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,686 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,687 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,687 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,688 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,688 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,689 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,690 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,690 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,691 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,691 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,692 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,697 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,698 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,698 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,699 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,699 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,699 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,701 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,702 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,703 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:09:45,720 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-16 05:09:45,742 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:09:45,743 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:09:45,743 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:09:45,743 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:09:45,743 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:09:45,743 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:09:45,743 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:09:45,743 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:09:45,757 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 05:09:45,796 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 05:09:45,796 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:09:45,801 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 05:09:45,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 74 transitions, 158 flow [2020-10-16 05:09:45,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 72 transitions, 150 flow [2020-10-16 05:09:45,813 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:09:45,816 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 77 places, 72 transitions, 150 flow [2020-10-16 05:09:45,819 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 77 places, 72 transitions, 150 flow [2020-10-16 05:09:45,819 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 77 places, 72 transitions, 150 flow [2020-10-16 05:09:45,838 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-16 05:09:45,838 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:09:45,839 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-16 05:09:45,841 INFO L117 LiptonReduction]: Number of co-enabled transitions 896 [2020-10-16 05:09:45,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:45,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:45,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:45,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:45,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:45,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:45,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:45,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:46,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,129 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:46,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:09:46,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:46,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:46,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:09:46,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:46,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:09:46,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:46,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,568 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:46,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:09:46,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:46,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:46,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:46,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,629 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,632 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:46,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,639 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:46,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:46,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:46,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:46,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:09:46,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:46,768 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:46,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:46,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,781 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,785 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,786 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:46,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:46,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:46,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,843 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:09:46,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,845 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:46,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:46,848 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:46,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:09:46,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:09:46,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:47,213 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:09:47,347 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 05:09:47,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:47,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:47,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 05:09:47,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:47,401 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:09:47,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:47,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:47,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:48,473 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-16 05:09:48,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 05:09:48,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:48,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-16 05:09:48,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:49,420 WARN L193 SmtUtils]: Spent 926.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-16 05:09:49,586 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:09:49,750 WARN L193 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:09:49,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:49,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:49,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:49,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:49,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:49,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:49,815 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:49,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:49,846 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:49,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:49,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:49,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:49,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:49,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:49,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:49,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:50,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:50,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:50,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,266 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:50,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:50,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:09:50,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,506 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:50,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,512 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,517 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:50,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:50,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:50,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:50,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:50,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:50,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:50,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,673 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,675 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,677 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:50,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,683 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:50,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,686 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:50,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:50,703 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:50,703 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:09:50,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:09:50,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:09:51,182 WARN L193 SmtUtils]: Spent 381.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 05:09:51,529 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 05:09:52,190 WARN L193 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-16 05:09:52,463 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-16 05:09:52,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:09:52,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:53,631 WARN L193 SmtUtils]: Spent 919.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 124 [2020-10-16 05:09:53,932 WARN L193 SmtUtils]: Spent 297.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-16 05:09:54,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:54,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:54,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:54,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:54,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:54,131 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:54,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:54,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:54,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:54,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:54,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:54,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:54,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:54,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:54,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:54,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:54,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:54,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:54,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:09:54,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:09:54,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:54,188 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:09:54,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:09:54,464 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-16 05:09:54,577 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2020-10-16 05:09:54,583 INFO L132 LiptonReduction]: Checked pairs total: 2125 [2020-10-16 05:09:54,584 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-16 05:09:54,587 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 8776 [2020-10-16 05:09:54,593 INFO L129 PetriNetUnfolder]: 0/2 cut-off events. [2020-10-16 05:09:54,593 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:09:54,593 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:54,594 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2020-10-16 05:09:54,594 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:54,601 INFO L82 PathProgramCache]: Analyzing trace with hash 895506, now seen corresponding path program 1 times [2020-10-16 05:09:54,611 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:54,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938240569] [2020-10-16 05:09:54,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:54,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:54,859 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 05:09:54,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938240569] [2020-10-16 05:09:54,861 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:54,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:09:54,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551378355] [2020-10-16 05:09:54,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:09:54,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:54,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:09:54,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:09:54,896 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 140 [2020-10-16 05:09:54,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states. [2020-10-16 05:09:54,901 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:54,901 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 140 [2020-10-16 05:09:54,905 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:55,002 INFO L129 PetriNetUnfolder]: 23/59 cut-off events. [2020-10-16 05:09:55,002 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:09:55,004 INFO L80 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 59 events. 23/59 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 194 event pairs, 16 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 105. Up to 37 conditions per place. [2020-10-16 05:09:55,007 INFO L132 encePairwiseOnDemand]: 137/140 looper letters, 7 selfloop transitions, 2 changer transitions 2/20 dead transitions. [2020-10-16 05:09:55,007 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 68 flow [2020-10-16 05:09:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:09:55,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:09:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2020-10-16 05:09:55,031 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7928571428571428 [2020-10-16 05:09:55,032 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2020-10-16 05:09:55,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2020-10-16 05:09:55,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:55,040 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2020-10-16 05:09:55,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:09:55,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:09:55,056 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:09:55,058 INFO L185 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 333 transitions. [2020-10-16 05:09:55,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 68 flow [2020-10-16 05:09:55,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 66 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:55,065 INFO L241 Difference]: Finished difference. Result has 23 places, 15 transitions, 38 flow [2020-10-16 05:09:55,068 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=15} [2020-10-16 05:09:55,068 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 05:09:55,069 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 15 transitions, 38 flow [2020-10-16 05:09:55,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:09:55,069 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:55,069 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:55,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:09:55,070 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:55,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:55,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1851001785, now seen corresponding path program 1 times [2020-10-16 05:09:55,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:55,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651979154] [2020-10-16 05:09:55,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:55,232 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 05:09:55,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651979154] [2020-10-16 05:09:55,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:55,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:09:55,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299164768] [2020-10-16 05:09:55,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:09:55,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:09:55,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:09:55,237 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 140 [2020-10-16 05:09:55,238 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states. [2020-10-16 05:09:55,238 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:55,238 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 140 [2020-10-16 05:09:55,238 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:55,287 INFO L129 PetriNetUnfolder]: 38/91 cut-off events. [2020-10-16 05:09:55,287 INFO L130 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2020-10-16 05:09:55,288 INFO L80 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 91 events. 38/91 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 339 event pairs, 30 based on Foata normal form. 1/87 useless extension candidates. Maximal degree in co-relation 171. Up to 72 conditions per place. [2020-10-16 05:09:55,289 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 8 selfloop transitions, 3 changer transitions 0/18 dead transitions. [2020-10-16 05:09:55,289 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 18 transitions, 68 flow [2020-10-16 05:09:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:09:55,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:09:55,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 312 transitions. [2020-10-16 05:09:55,292 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7428571428571429 [2020-10-16 05:09:55,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 312 transitions. [2020-10-16 05:09:55,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 312 transitions. [2020-10-16 05:09:55,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:55,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 312 transitions. [2020-10-16 05:09:55,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:09:55,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:09:55,295 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:09:55,295 INFO L185 Difference]: Start difference. First operand has 23 places, 15 transitions, 38 flow. Second operand 3 states and 312 transitions. [2020-10-16 05:09:55,295 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 18 transitions, 68 flow [2020-10-16 05:09:55,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 18 transitions, 62 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:55,297 INFO L241 Difference]: Finished difference. Result has 23 places, 17 transitions, 53 flow [2020-10-16 05:09:55,297 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2020-10-16 05:09:55,298 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, -1 predicate places. [2020-10-16 05:09:55,298 INFO L481 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 53 flow [2020-10-16 05:09:55,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:09:55,298 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:55,298 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:55,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:09:55,299 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:55,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:55,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1546524851, now seen corresponding path program 1 times [2020-10-16 05:09:55,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:55,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401009146] [2020-10-16 05:09:55,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:55,463 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 05:09:55,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401009146] [2020-10-16 05:09:55,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:55,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:09:55,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998142305] [2020-10-16 05:09:55,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:09:55,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:55,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:09:55,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:09:55,467 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 140 [2020-10-16 05:09:55,467 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 53 flow. Second operand 5 states. [2020-10-16 05:09:55,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:55,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 140 [2020-10-16 05:09:55,468 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:55,582 INFO L129 PetriNetUnfolder]: 53/113 cut-off events. [2020-10-16 05:09:55,582 INFO L130 PetriNetUnfolder]: For 23/26 co-relation queries the response was YES. [2020-10-16 05:09:55,583 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 113 events. 53/113 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 397 event pairs, 20 based on Foata normal form. 4/116 useless extension candidates. Maximal degree in co-relation 250. Up to 95 conditions per place. [2020-10-16 05:09:55,584 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 10 selfloop transitions, 5 changer transitions 0/21 dead transitions. [2020-10-16 05:09:55,584 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 21 transitions, 93 flow [2020-10-16 05:09:55,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:09:55,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:09:55,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 372 transitions. [2020-10-16 05:09:55,586 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6642857142857143 [2020-10-16 05:09:55,587 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 372 transitions. [2020-10-16 05:09:55,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 372 transitions. [2020-10-16 05:09:55,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:55,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 372 transitions. [2020-10-16 05:09:55,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:09:55,589 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:09:55,589 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:09:55,590 INFO L185 Difference]: Start difference. First operand has 23 places, 17 transitions, 53 flow. Second operand 4 states and 372 transitions. [2020-10-16 05:09:55,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 21 transitions, 93 flow [2020-10-16 05:09:55,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:09:55,591 INFO L241 Difference]: Finished difference. Result has 26 places, 19 transitions, 75 flow [2020-10-16 05:09:55,591 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=75, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2020-10-16 05:09:55,592 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2020-10-16 05:09:55,592 INFO L481 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 75 flow [2020-10-16 05:09:55,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:09:55,592 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:55,592 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:55,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:09:55,592 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:55,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:55,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1546480800, now seen corresponding path program 1 times [2020-10-16 05:09:55,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:55,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253975313] [2020-10-16 05:09:55,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:55,727 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 05:09:55,727 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253975313] [2020-10-16 05:09:55,727 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:55,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:09:55,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527022214] [2020-10-16 05:09:55,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:09:55,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:55,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:09:55,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:09:55,730 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 140 [2020-10-16 05:09:55,731 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 75 flow. Second operand 4 states. [2020-10-16 05:09:55,731 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:55,731 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 140 [2020-10-16 05:09:55,731 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:55,800 INFO L129 PetriNetUnfolder]: 42/102 cut-off events. [2020-10-16 05:09:55,800 INFO L130 PetriNetUnfolder]: For 60/69 co-relation queries the response was YES. [2020-10-16 05:09:55,801 INFO L80 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 102 events. 42/102 cut-off events. For 60/69 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 360 event pairs, 24 based on Foata normal form. 1/97 useless extension candidates. Maximal degree in co-relation 236. Up to 72 conditions per place. [2020-10-16 05:09:55,802 INFO L132 encePairwiseOnDemand]: 136/140 looper letters, 7 selfloop transitions, 4 changer transitions 0/22 dead transitions. [2020-10-16 05:09:55,802 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 22 transitions, 105 flow [2020-10-16 05:09:55,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:09:55,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:09:55,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2020-10-16 05:09:55,805 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2020-10-16 05:09:55,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 308 transitions. [2020-10-16 05:09:55,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 308 transitions. [2020-10-16 05:09:55,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:55,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 308 transitions. [2020-10-16 05:09:55,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:09:55,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:09:55,807 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:09:55,807 INFO L185 Difference]: Start difference. First operand has 26 places, 19 transitions, 75 flow. Second operand 3 states and 308 transitions. [2020-10-16 05:09:55,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 22 transitions, 105 flow [2020-10-16 05:09:55,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 22 transitions, 96 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:55,809 INFO L241 Difference]: Finished difference. Result has 27 places, 21 transitions, 90 flow [2020-10-16 05:09:55,809 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=66, 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=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2020-10-16 05:09:55,809 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 3 predicate places. [2020-10-16 05:09:55,810 INFO L481 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 90 flow [2020-10-16 05:09:55,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:09:55,810 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:55,810 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:55,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:09:55,810 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:55,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:55,811 INFO L82 PathProgramCache]: Analyzing trace with hash -721433788, now seen corresponding path program 1 times [2020-10-16 05:09:55,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:55,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316933604] [2020-10-16 05:09:55,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:55,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:56,036 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 05:09:56,037 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316933604] [2020-10-16 05:09:56,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:56,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:09:56,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140900212] [2020-10-16 05:09:56,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:09:56,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:56,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:09:56,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:09:56,039 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 140 [2020-10-16 05:09:56,040 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 90 flow. Second operand 5 states. [2020-10-16 05:09:56,040 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:56,040 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 140 [2020-10-16 05:09:56,040 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:56,154 INFO L129 PetriNetUnfolder]: 34/88 cut-off events. [2020-10-16 05:09:56,154 INFO L130 PetriNetUnfolder]: For 97/98 co-relation queries the response was YES. [2020-10-16 05:09:56,155 INFO L80 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 88 events. 34/88 cut-off events. For 97/98 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 310 event pairs, 6 based on Foata normal form. 3/91 useless extension candidates. Maximal degree in co-relation 230. Up to 55 conditions per place. [2020-10-16 05:09:56,156 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 8 selfloop transitions, 6 changer transitions 0/25 dead transitions. [2020-10-16 05:09:56,156 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 25 transitions, 128 flow [2020-10-16 05:09:56,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:09:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:09:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2020-10-16 05:09:56,159 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.675 [2020-10-16 05:09:56,159 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2020-10-16 05:09:56,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2020-10-16 05:09:56,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:56,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2020-10-16 05:09:56,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:09:56,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:09:56,162 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:09:56,162 INFO L185 Difference]: Start difference. First operand has 27 places, 21 transitions, 90 flow. Second operand 4 states and 378 transitions. [2020-10-16 05:09:56,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 25 transitions, 128 flow [2020-10-16 05:09:56,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 124 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 05:09:56,164 INFO L241 Difference]: Finished difference. Result has 30 places, 23 transitions, 114 flow [2020-10-16 05:09:56,164 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2020-10-16 05:09:56,164 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 6 predicate places. [2020-10-16 05:09:56,164 INFO L481 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 114 flow [2020-10-16 05:09:56,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:09:56,165 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:56,165 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:56,165 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:09:56,165 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:56,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:56,166 INFO L82 PathProgramCache]: Analyzing trace with hash -721434284, now seen corresponding path program 1 times [2020-10-16 05:09:56,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:56,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944964928] [2020-10-16 05:09:56,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:56,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:56,216 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 05:09:56,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944964928] [2020-10-16 05:09:56,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:56,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:09:56,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834788117] [2020-10-16 05:09:56,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:09:56,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:56,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:09:56,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:09:56,219 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 140 [2020-10-16 05:09:56,220 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 114 flow. Second operand 4 states. [2020-10-16 05:09:56,220 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:56,220 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 140 [2020-10-16 05:09:56,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:56,276 INFO L129 PetriNetUnfolder]: 36/92 cut-off events. [2020-10-16 05:09:56,276 INFO L130 PetriNetUnfolder]: For 172/177 co-relation queries the response was YES. [2020-10-16 05:09:56,276 INFO L80 FinitePrefix]: Finished finitePrefix Result has 295 conditions, 92 events. 36/92 cut-off events. For 172/177 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 319 event pairs, 13 based on Foata normal form. 1/90 useless extension candidates. Maximal degree in co-relation 280. Up to 56 conditions per place. [2020-10-16 05:09:56,277 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 10 selfloop transitions, 8 changer transitions 0/29 dead transitions. [2020-10-16 05:09:56,278 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 29 transitions, 174 flow [2020-10-16 05:09:56,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:09:56,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:09:56,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 415 transitions. [2020-10-16 05:09:56,280 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7410714285714286 [2020-10-16 05:09:56,280 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 415 transitions. [2020-10-16 05:09:56,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 415 transitions. [2020-10-16 05:09:56,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:56,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 415 transitions. [2020-10-16 05:09:56,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:09:56,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:09:56,283 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:09:56,283 INFO L185 Difference]: Start difference. First operand has 30 places, 23 transitions, 114 flow. Second operand 4 states and 415 transitions. [2020-10-16 05:09:56,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 29 transitions, 174 flow [2020-10-16 05:09:56,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 29 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:56,285 INFO L241 Difference]: Finished difference. Result has 32 places, 26 transitions, 140 flow [2020-10-16 05:09:56,285 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=32, PETRI_TRANSITIONS=26} [2020-10-16 05:09:56,286 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 8 predicate places. [2020-10-16 05:09:56,286 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 26 transitions, 140 flow [2020-10-16 05:09:56,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:09:56,286 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:56,286 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:56,286 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:09:56,287 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash -723049694, now seen corresponding path program 2 times [2020-10-16 05:09:56,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:56,287 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231012491] [2020-10-16 05:09:56,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:56,355 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 05:09:56,356 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231012491] [2020-10-16 05:09:56,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:56,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:09:56,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659449901] [2020-10-16 05:09:56,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:09:56,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:56,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:09:56,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:09:56,358 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 140 [2020-10-16 05:09:56,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 140 flow. Second operand 5 states. [2020-10-16 05:09:56,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:56,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 140 [2020-10-16 05:09:56,359 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:56,430 INFO L129 PetriNetUnfolder]: 33/87 cut-off events. [2020-10-16 05:09:56,430 INFO L130 PetriNetUnfolder]: For 197/202 co-relation queries the response was YES. [2020-10-16 05:09:56,431 INFO L80 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 87 events. 33/87 cut-off events. For 197/202 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 293 event pairs, 13 based on Foata normal form. 2/86 useless extension candidates. Maximal degree in co-relation 291. Up to 54 conditions per place. [2020-10-16 05:09:56,432 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 9 selfloop transitions, 8 changer transitions 0/28 dead transitions. [2020-10-16 05:09:56,432 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 182 flow [2020-10-16 05:09:56,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 05:09:56,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 05:09:56,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2020-10-16 05:09:56,435 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7392857142857143 [2020-10-16 05:09:56,435 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2020-10-16 05:09:56,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2020-10-16 05:09:56,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:56,436 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2020-10-16 05:09:56,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 05:09:56,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 05:09:56,438 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 05:09:56,438 INFO L185 Difference]: Start difference. First operand has 32 places, 26 transitions, 140 flow. Second operand 4 states and 414 transitions. [2020-10-16 05:09:56,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 182 flow [2020-10-16 05:09:56,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 173 flow, removed 2 selfloop flow, removed 1 redundant places. [2020-10-16 05:09:56,441 INFO L241 Difference]: Finished difference. Result has 35 places, 26 transitions, 156 flow [2020-10-16 05:09:56,441 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2020-10-16 05:09:56,441 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 11 predicate places. [2020-10-16 05:09:56,441 INFO L481 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 156 flow [2020-10-16 05:09:56,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:09:56,441 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:56,442 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:56,442 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:09:56,442 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:56,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:56,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1039095626, now seen corresponding path program 1 times [2020-10-16 05:09:56,443 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:56,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417009323] [2020-10-16 05:09:56,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:56,491 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 05:09:56,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417009323] [2020-10-16 05:09:56,492 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:56,492 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:09:56,492 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128089357] [2020-10-16 05:09:56,492 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:09:56,492 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:56,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:09:56,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:09:56,494 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 140 [2020-10-16 05:09:56,494 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 156 flow. Second operand 5 states. [2020-10-16 05:09:56,494 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:56,494 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 140 [2020-10-16 05:09:56,494 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:56,583 INFO L129 PetriNetUnfolder]: 43/117 cut-off events. [2020-10-16 05:09:56,584 INFO L130 PetriNetUnfolder]: For 345/353 co-relation queries the response was YES. [2020-10-16 05:09:56,585 INFO L80 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 117 events. 43/117 cut-off events. For 345/353 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 486 event pairs, 12 based on Foata normal form. 12/129 useless extension candidates. Maximal degree in co-relation 383. Up to 46 conditions per place. [2020-10-16 05:09:56,586 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 15 selfloop transitions, 8 changer transitions 0/32 dead transitions. [2020-10-16 05:09:56,586 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 32 transitions, 226 flow [2020-10-16 05:09:56,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:09:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:09:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 506 transitions. [2020-10-16 05:09:56,589 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7228571428571429 [2020-10-16 05:09:56,589 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 506 transitions. [2020-10-16 05:09:56,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 506 transitions. [2020-10-16 05:09:56,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:56,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 506 transitions. [2020-10-16 05:09:56,591 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:09:56,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:09:56,593 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:09:56,593 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 156 flow. Second operand 5 states and 506 transitions. [2020-10-16 05:09:56,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 32 transitions, 226 flow [2020-10-16 05:09:56,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 210 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:09:56,600 INFO L241 Difference]: Finished difference. Result has 37 places, 26 transitions, 161 flow [2020-10-16 05:09:56,601 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=37, PETRI_TRANSITIONS=26} [2020-10-16 05:09:56,601 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 13 predicate places. [2020-10-16 05:09:56,601 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 26 transitions, 161 flow [2020-10-16 05:09:56,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:09:56,601 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:56,601 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:56,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:09:56,602 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:56,602 INFO L82 PathProgramCache]: Analyzing trace with hash 645238284, now seen corresponding path program 1 times [2020-10-16 05:09:56,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:56,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164231555] [2020-10-16 05:09:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:56,779 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 05:09:56,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164231555] [2020-10-16 05:09:56,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:56,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:09:56,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824192695] [2020-10-16 05:09:56,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:09:56,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:56,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:09:56,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:09:56,783 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140 [2020-10-16 05:09:56,783 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 26 transitions, 161 flow. Second operand 6 states. [2020-10-16 05:09:56,784 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:56,784 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140 [2020-10-16 05:09:56,784 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:56,928 INFO L129 PetriNetUnfolder]: 39/117 cut-off events. [2020-10-16 05:09:56,928 INFO L130 PetriNetUnfolder]: For 350/362 co-relation queries the response was YES. [2020-10-16 05:09:56,929 INFO L80 FinitePrefix]: Finished finitePrefix Result has 408 conditions, 117 events. 39/117 cut-off events. For 350/362 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 503 event pairs, 2 based on Foata normal form. 7/123 useless extension candidates. Maximal degree in co-relation 389. Up to 64 conditions per place. [2020-10-16 05:09:56,930 INFO L132 encePairwiseOnDemand]: 133/140 looper letters, 7 selfloop transitions, 13 changer transitions 0/31 dead transitions. [2020-10-16 05:09:56,930 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 31 transitions, 221 flow [2020-10-16 05:09:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:09:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:09:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2020-10-16 05:09:56,934 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.705952380952381 [2020-10-16 05:09:56,934 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2020-10-16 05:09:56,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2020-10-16 05:09:56,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:56,935 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2020-10-16 05:09:56,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:09:56,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:09:56,938 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:09:56,938 INFO L185 Difference]: Start difference. First operand has 37 places, 26 transitions, 161 flow. Second operand 6 states and 593 transitions. [2020-10-16 05:09:56,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 31 transitions, 221 flow [2020-10-16 05:09:56,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 31 transitions, 204 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 05:09:56,942 INFO L241 Difference]: Finished difference. Result has 40 places, 29 transitions, 196 flow [2020-10-16 05:09:56,942 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2020-10-16 05:09:56,943 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 16 predicate places. [2020-10-16 05:09:56,943 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 196 flow [2020-10-16 05:09:56,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:09:56,943 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:56,943 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:56,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:09:56,943 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:56,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash 618454284, now seen corresponding path program 2 times [2020-10-16 05:09:56,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:56,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013715847] [2020-10-16 05:09:56,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:57,191 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 05:09:57,192 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013715847] [2020-10-16 05:09:57,192 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:57,192 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:09:57,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774114157] [2020-10-16 05:09:57,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:09:57,193 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:09:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:09:57,194 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 140 [2020-10-16 05:09:57,194 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 196 flow. Second operand 6 states. [2020-10-16 05:09:57,194 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:57,194 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 140 [2020-10-16 05:09:57,194 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:57,344 INFO L129 PetriNetUnfolder]: 37/115 cut-off events. [2020-10-16 05:09:57,345 INFO L130 PetriNetUnfolder]: For 385/393 co-relation queries the response was YES. [2020-10-16 05:09:57,345 INFO L80 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 115 events. 37/115 cut-off events. For 385/393 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 511 event pairs, 9 based on Foata normal form. 8/120 useless extension candidates. Maximal degree in co-relation 453. Up to 55 conditions per place. [2020-10-16 05:09:57,346 INFO L132 encePairwiseOnDemand]: 134/140 looper letters, 8 selfloop transitions, 12 changer transitions 4/35 dead transitions. [2020-10-16 05:09:57,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 35 transitions, 280 flow [2020-10-16 05:09:57,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:09:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:09:57,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2020-10-16 05:09:57,350 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6904761904761905 [2020-10-16 05:09:57,350 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 580 transitions. [2020-10-16 05:09:57,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 580 transitions. [2020-10-16 05:09:57,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:57,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 580 transitions. [2020-10-16 05:09:57,352 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:09:57,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:09:57,354 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:09:57,354 INFO L185 Difference]: Start difference. First operand has 40 places, 29 transitions, 196 flow. Second operand 6 states and 580 transitions. [2020-10-16 05:09:57,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 35 transitions, 280 flow [2020-10-16 05:09:57,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 258 flow, removed 5 selfloop flow, removed 3 redundant places. [2020-10-16 05:09:57,360 INFO L241 Difference]: Finished difference. Result has 43 places, 30 transitions, 218 flow [2020-10-16 05:09:57,361 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=218, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2020-10-16 05:09:57,361 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 19 predicate places. [2020-10-16 05:09:57,361 INFO L481 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 218 flow [2020-10-16 05:09:57,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:09:57,361 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:57,361 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:57,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:09:57,362 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:57,362 INFO L82 PathProgramCache]: Analyzing trace with hash -409007365, now seen corresponding path program 1 times [2020-10-16 05:09:57,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:57,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818673370] [2020-10-16 05:09:57,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:57,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:57,477 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 05:09:57,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818673370] [2020-10-16 05:09:57,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:57,477 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:09:57,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099452688] [2020-10-16 05:09:57,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:09:57,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:57,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:09:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:09:57,481 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 140 [2020-10-16 05:09:57,481 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 218 flow. Second operand 4 states. [2020-10-16 05:09:57,482 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:57,482 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 140 [2020-10-16 05:09:57,482 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:57,525 INFO L129 PetriNetUnfolder]: 29/109 cut-off events. [2020-10-16 05:09:57,525 INFO L130 PetriNetUnfolder]: For 325/353 co-relation queries the response was YES. [2020-10-16 05:09:57,525 INFO L80 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 109 events. 29/109 cut-off events. For 325/353 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 503 event pairs, 7 based on Foata normal form. 41/148 useless extension candidates. Maximal degree in co-relation 377. Up to 46 conditions per place. [2020-10-16 05:09:57,526 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 5 selfloop transitions, 6 changer transitions 2/34 dead transitions. [2020-10-16 05:09:57,526 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 233 flow [2020-10-16 05:09:57,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:09:57,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:09:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 564 transitions. [2020-10-16 05:09:57,531 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8057142857142857 [2020-10-16 05:09:57,531 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 564 transitions. [2020-10-16 05:09:57,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 564 transitions. [2020-10-16 05:09:57,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:57,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 564 transitions. [2020-10-16 05:09:57,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:09:57,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:09:57,536 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:09:57,536 INFO L185 Difference]: Start difference. First operand has 43 places, 30 transitions, 218 flow. Second operand 5 states and 564 transitions. [2020-10-16 05:09:57,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 233 flow [2020-10-16 05:09:57,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 34 transitions, 207 flow, removed 2 selfloop flow, removed 6 redundant places. [2020-10-16 05:09:57,540 INFO L241 Difference]: Finished difference. Result has 44 places, 32 transitions, 212 flow [2020-10-16 05:09:57,540 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2020-10-16 05:09:57,540 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 20 predicate places. [2020-10-16 05:09:57,540 INFO L481 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 212 flow [2020-10-16 05:09:57,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:09:57,540 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:57,541 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:57,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:09:57,541 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:57,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:57,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1835042812, now seen corresponding path program 1 times [2020-10-16 05:09:57,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:57,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593071620] [2020-10-16 05:09:57,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:57,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:57,635 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 05:09:57,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593071620] [2020-10-16 05:09:57,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:57,636 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:09:57,636 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48339803] [2020-10-16 05:09:57,637 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:09:57,637 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:57,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:09:57,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:09:57,638 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 140 [2020-10-16 05:09:57,639 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 212 flow. Second operand 5 states. [2020-10-16 05:09:57,639 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:57,639 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 140 [2020-10-16 05:09:57,639 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:57,703 INFO L129 PetriNetUnfolder]: 10/67 cut-off events. [2020-10-16 05:09:57,703 INFO L130 PetriNetUnfolder]: For 289/369 co-relation queries the response was YES. [2020-10-16 05:09:57,703 INFO L80 FinitePrefix]: Finished finitePrefix Result has 260 conditions, 67 events. 10/67 cut-off events. For 289/369 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 261 event pairs, 0 based on Foata normal form. 66/133 useless extension candidates. Maximal degree in co-relation 238. Up to 20 conditions per place. [2020-10-16 05:09:57,704 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 2 selfloop transitions, 9 changer transitions 8/33 dead transitions. [2020-10-16 05:09:57,704 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 33 transitions, 235 flow [2020-10-16 05:09:57,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:09:57,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:09:57,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 785 transitions. [2020-10-16 05:09:57,708 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8010204081632653 [2020-10-16 05:09:57,708 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 785 transitions. [2020-10-16 05:09:57,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 785 transitions. [2020-10-16 05:09:57,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:57,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 785 transitions. [2020-10-16 05:09:57,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:09:57,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:09:57,712 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:09:57,712 INFO L185 Difference]: Start difference. First operand has 44 places, 32 transitions, 212 flow. Second operand 7 states and 785 transitions. [2020-10-16 05:09:57,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 33 transitions, 235 flow [2020-10-16 05:09:57,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 33 transitions, 209 flow, removed 8 selfloop flow, removed 2 redundant places. [2020-10-16 05:09:57,716 INFO L241 Difference]: Finished difference. Result has 51 places, 25 transitions, 172 flow [2020-10-16 05:09:57,717 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=172, PETRI_PLACES=51, PETRI_TRANSITIONS=25} [2020-10-16 05:09:57,717 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 27 predicate places. [2020-10-16 05:09:57,717 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 25 transitions, 172 flow [2020-10-16 05:09:57,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:09:57,717 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:57,717 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:57,718 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:09:57,718 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:57,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:57,718 INFO L82 PathProgramCache]: Analyzing trace with hash 343065242, now seen corresponding path program 1 times [2020-10-16 05:09:57,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:57,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900628754] [2020-10-16 05:09:57,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:57,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:09:58,385 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2020-10-16 05:09:58,430 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 05:09:58,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900628754] [2020-10-16 05:09:58,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:09:58,432 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:09:58,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127898043] [2020-10-16 05:09:58,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:09:58,433 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:09:58,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:09:58,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:09:58,437 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 140 [2020-10-16 05:09:58,438 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 25 transitions, 172 flow. Second operand 8 states. [2020-10-16 05:09:58,438 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:09:58,438 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 140 [2020-10-16 05:09:58,438 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:09:58,608 INFO L129 PetriNetUnfolder]: 3/40 cut-off events. [2020-10-16 05:09:58,608 INFO L130 PetriNetUnfolder]: For 169/178 co-relation queries the response was YES. [2020-10-16 05:09:58,610 INFO L80 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 40 events. 3/40 cut-off events. For 169/178 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 105 event pairs, 0 based on Foata normal form. 7/47 useless extension candidates. Maximal degree in co-relation 153. Up to 14 conditions per place. [2020-10-16 05:09:58,611 INFO L132 encePairwiseOnDemand]: 135/140 looper letters, 5 selfloop transitions, 4 changer transitions 5/27 dead transitions. [2020-10-16 05:09:58,611 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 27 transitions, 217 flow [2020-10-16 05:09:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:09:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:09:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions. [2020-10-16 05:09:58,614 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.65 [2020-10-16 05:09:58,614 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 546 transitions. [2020-10-16 05:09:58,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions. [2020-10-16 05:09:58,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:09:58,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions. [2020-10-16 05:09:58,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:09:58,617 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:09:58,617 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:09:58,617 INFO L185 Difference]: Start difference. First operand has 51 places, 25 transitions, 172 flow. Second operand 6 states and 546 transitions. [2020-10-16 05:09:58,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 27 transitions, 217 flow [2020-10-16 05:09:58,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 27 transitions, 158 flow, removed 12 selfloop flow, removed 15 redundant places. [2020-10-16 05:09:58,620 INFO L241 Difference]: Finished difference. Result has 40 places, 22 transitions, 113 flow [2020-10-16 05:09:58,620 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=113, PETRI_PLACES=40, PETRI_TRANSITIONS=22} [2020-10-16 05:09:58,620 INFO L342 CegarLoopForPetriNet]: 24 programPoint places, 16 predicate places. [2020-10-16 05:09:58,620 INFO L481 AbstractCegarLoop]: Abstraction has has 40 places, 22 transitions, 113 flow [2020-10-16 05:09:58,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:09:58,620 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:09:58,620 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:09:58,621 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:09:58,621 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:09:58,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:09:58,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1567428856, now seen corresponding path program 2 times [2020-10-16 05:09:58,621 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:09:58,621 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693173352] [2020-10-16 05:09:58,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:09:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:09:58,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:09:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:09:58,714 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:09:58,757 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:09:58,757 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:09:58,757 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:09:58,759 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 05:09:58,768 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L786-->L793: Formula: (let ((.cse6 (= 0 (mod ~y$w_buff0_used~0_In-1854316749 256))) (.cse7 (= (mod ~y$r_buff0_thd0~0_In-1854316749 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-1854316749 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-1854316749 256) 0))) (let ((.cse0 (or .cse9 .cse8)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse4 (not .cse7)) (.cse5 (not .cse6)) (.cse3 (or .cse6 .cse7))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1854316749| ULTIMATE.start_assume_abort_if_not_~cond_Out-1854316749) (or (and (or (and .cse0 (= ~y~0_Out-1854316749 ~y~0_In-1854316749)) (and .cse1 (= ~y$w_buff1~0_In-1854316749 ~y~0_Out-1854316749) .cse2)) .cse3) (and .cse4 (= ~y~0_Out-1854316749 ~y$w_buff0~0_In-1854316749) .cse5)) (= ~y$r_buff1_thd0~0_In-1854316749 ~y$r_buff1_thd0~0_Out-1854316749) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1854316749 0)) (or (and .cse0 (= ~y$w_buff1_used~0_Out-1854316749 ~y$w_buff1_used~0_In-1854316749)) (and (= ~y$w_buff1_used~0_Out-1854316749 0) .cse1 .cse2)) (or (and .cse4 .cse5 (= ~y$w_buff0_used~0_Out-1854316749 0)) (and .cse3 (= ~y$w_buff0_used~0_Out-1854316749 ~y$w_buff0_used~0_In-1854316749))) (= ~y$r_buff0_thd0~0_Out-1854316749 ~y$r_buff0_thd0~0_In-1854316749)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1854316749|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1854316749, ~y$w_buff1~0=~y$w_buff1~0_In-1854316749, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1854316749, ~y$w_buff0~0=~y$w_buff0~0_In-1854316749, ~y~0=~y~0_In-1854316749, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1854316749, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1854316749} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-1854316749, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-1854316749|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1854316749|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1854316749|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out-1854316749|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1854316749|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1854316749|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1854316749|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1854316749, ~y$w_buff1~0=~y$w_buff1~0_In-1854316749, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-1854316749, ~y$w_buff0~0=~y$w_buff0~0_In-1854316749, ~y~0=~y~0_Out-1854316749, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1854316749, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-1854316749} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-16 05:09:58,773 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,778 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,778 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,778 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,779 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,779 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,780 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,780 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,781 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,782 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,782 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,783 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,783 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,786 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,787 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,787 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,788 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,788 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,789 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,789 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,794 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,794 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,795 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,795 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 05:09:58,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:09:58,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:09:58 BasicIcfg [2020-10-16 05:09:58,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:09:58,883 INFO L168 Benchmark]: Toolchain (without parser) took 16266.89 ms. Allocated memory was 245.4 MB in the beginning and 568.3 MB in the end (delta: 323.0 MB). Free memory was 197.8 MB in the beginning and 308.1 MB in the end (delta: -110.3 MB). Peak memory consumption was 212.6 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:58,883 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 245.4 MB. Free memory is still 219.2 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:09:58,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.39 ms. Allocated memory was 245.4 MB in the beginning and 298.3 MB in the end (delta: 53.0 MB). Free memory was 197.8 MB in the beginning and 250.7 MB in the end (delta: -52.9 MB). Peak memory consumption was 34.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:58,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.81 ms. Allocated memory is still 298.3 MB. Free memory was 250.7 MB in the beginning and 245.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:58,885 INFO L168 Benchmark]: Boogie Preprocessor took 37.92 ms. Allocated memory is still 298.3 MB. Free memory was 245.6 MB in the beginning and 243.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:58,886 INFO L168 Benchmark]: RCFGBuilder took 2097.66 ms. Allocated memory was 298.3 MB in the beginning and 350.2 MB in the end (delta: 51.9 MB). Free memory was 243.1 MB in the beginning and 207.3 MB in the end (delta: 35.8 MB). Peak memory consumption was 98.9 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:58,887 INFO L168 Benchmark]: TraceAbstraction took 13248.47 ms. Allocated memory was 350.2 MB in the beginning and 568.3 MB in the end (delta: 218.1 MB). Free memory was 207.3 MB in the beginning and 308.1 MB in the end (delta: -100.8 MB). Peak memory consumption was 117.3 MB. Max. memory is 14.2 GB. [2020-10-16 05:09:58,890 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.48 ms. Allocated memory is still 245.4 MB. Free memory is still 219.2 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 771.39 ms. Allocated memory was 245.4 MB in the beginning and 298.3 MB in the end (delta: 53.0 MB). Free memory was 197.8 MB in the beginning and 250.7 MB in the end (delta: -52.9 MB). Peak memory consumption was 34.2 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 105.81 ms. Allocated memory is still 298.3 MB. Free memory was 250.7 MB in the beginning and 245.6 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 37.92 ms. Allocated memory is still 298.3 MB. Free memory was 245.6 MB in the beginning and 243.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2097.66 ms. Allocated memory was 298.3 MB in the beginning and 350.2 MB in the end (delta: 51.9 MB). Free memory was 243.1 MB in the beginning and 207.3 MB in the end (delta: 35.8 MB). Peak memory consumption was 98.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 13248.47 ms. Allocated memory was 350.2 MB in the beginning and 568.3 MB in the end (delta: 218.1 MB). Free memory was 207.3 MB in the beginning and 308.1 MB in the end (delta: -100.8 MB). Peak memory consumption was 117.3 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 582 VarBasedMoverChecksPositive, 46 VarBasedMoverChecksNegative, 6 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 47 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.7s, 77 PlacesBefore, 24 PlacesAfterwards, 72 TransitionsBefore, 17 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2125 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L703] 0 int y = 0; [L704] 0 _Bool y$flush_delayed; [L705] 0 int y$mem_tmp; [L706] 0 _Bool y$r_buff0_thd0; [L707] 0 _Bool y$r_buff0_thd1; [L708] 0 _Bool y$r_buff0_thd2; [L709] 0 _Bool y$r_buff1_thd0; [L710] 0 _Bool y$r_buff1_thd1; [L711] 0 _Bool y$r_buff1_thd2; [L712] 0 _Bool y$read_delayed; [L713] 0 int *y$read_delayed_var; [L714] 0 int y$w_buff0; [L715] 0 _Bool y$w_buff0_used; [L716] 0 int y$w_buff1; [L717] 0 _Bool y$w_buff1_used; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2481; [L780] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 1 y$w_buff1 = y$w_buff0 [L724] 1 y$w_buff0 = 2 [L725] 1 y$w_buff1_used = y$w_buff0_used [L726] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L728] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 pthread_t t2482; [L782] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 y$flush_delayed = weak$$choice2 [L798] 0 y$mem_tmp = y [L799] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L800] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L802] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L807] 0 y = y$flush_delayed ? y$mem_tmp : y [L808] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: VerificationResult: UNSAFE, OverallTime: 13.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 56 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 265 SolverSat, 76 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=10, 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.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 15138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...