/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/safe023_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:07:26,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:07:26,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:07:26,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:07:26,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:07:26,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:07:26,238 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:07:26,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:07:26,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:07:26,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:07:26,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:07:26,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:07:26,251 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:07:26,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:07:26,255 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:07:26,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:07:26,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:07:26,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:07:26,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:07:26,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:07:26,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:07:26,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:07:26,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:07:26,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:07:26,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:07:26,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:07:26,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:07:26,276 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:07:26,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:07:26,277 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:07:26,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:07:26,278 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:07:26,279 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:07:26,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:07:26,280 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:07:26,281 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:07:26,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:07:26,281 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:07:26,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:07:26,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:07:26,283 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:07:26,284 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:07:26,308 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:07:26,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:07:26,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:07:26,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:07:26,310 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:07:26,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:07:26,311 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:07:26,311 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:07:26,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:07:26,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:07:26,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:07:26,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:07:26,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:07:26,312 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:07:26,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:07:26,315 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:07:26,315 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:07:26,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:07:26,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:07:26,316 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:07:26,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:07:26,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:07:26,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:07:26,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:07:26,317 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:07:26,317 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:07:26,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:07:26,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:07:26,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:07:26,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:07:26,634 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:07:26,638 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:07:26,640 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:07:26,640 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:07:26,641 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i [2020-10-16 05:07:26,705 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c68d66e/98ffad2a0cc74d2c89931ab5fff82dcf/FLAGe92e8f0a0 [2020-10-16 05:07:27,289 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:07:27,289 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_power.opt.i [2020-10-16 05:07:27,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c68d66e/98ffad2a0cc74d2c89931ab5fff82dcf/FLAGe92e8f0a0 [2020-10-16 05:07:27,587 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90c68d66e/98ffad2a0cc74d2c89931ab5fff82dcf [2020-10-16 05:07:27,595 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:07:27,597 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:07:27,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:07:27,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:07:27,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:07:27,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:07:27" (1/1) ... [2020-10-16 05:07:27,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dcbca41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:27, skipping insertion in model container [2020-10-16 05:07:27,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:07:27" (1/1) ... [2020-10-16 05:07:27,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:07:27,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:07:28,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:07:28,254 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:07:28,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:07:28,422 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:07:28,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28 WrapperNode [2020-10-16 05:07:28,423 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:07:28,424 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:07:28,424 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:07:28,424 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:07:28,433 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:07:28" (1/1) ... [2020-10-16 05:07:28,456 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:07:28" (1/1) ... [2020-10-16 05:07:28,492 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:07:28,493 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:07:28,493 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:07:28,493 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:07:28,502 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (1/1) ... [2020-10-16 05:07:28,503 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (1/1) ... [2020-10-16 05:07:28,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (1/1) ... [2020-10-16 05:07:28,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (1/1) ... [2020-10-16 05:07:28,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (1/1) ... [2020-10-16 05:07:28,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (1/1) ... [2020-10-16 05:07:28,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (1/1) ... [2020-10-16 05:07:28,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:07:28,543 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:07:28,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:07:28,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:07:28,544 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:07:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:07:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:07:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:07:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:07:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:07:28,640 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:07:28,641 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:07:28,641 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:07:28,642 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:07:28,642 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:07:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:07:28,645 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:07:28,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:07:28,648 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:07:32,325 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:07:32,325 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:07:32,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:07:32 BoogieIcfgContainer [2020-10-16 05:07:32,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:07:32,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:07:32,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:07:32,335 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:07:32,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:07:27" (1/3) ... [2020-10-16 05:07:32,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303afaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:07:32, skipping insertion in model container [2020-10-16 05:07:32,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:28" (2/3) ... [2020-10-16 05:07:32,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303afaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:07:32, skipping insertion in model container [2020-10-16 05:07:32,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:07:32" (3/3) ... [2020-10-16 05:07:32,340 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_power.opt.i [2020-10-16 05:07:32,359 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:07:32,370 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:07:32,372 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:07:32,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,422 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,422 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,423 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,427 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,428 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,429 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,435 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,436 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,439 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,439 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,439 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,440 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,442 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,443 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,443 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,443 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,444 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,445 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,446 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,455 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,456 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,460 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,461 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,461 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,462 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,463 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,464 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,468 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,469 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,470 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,471 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,472 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,472 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,473 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,473 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,477 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,482 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,483 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,487 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,488 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,489 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:32,518 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:07:32,551 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:07:32,551 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:07:32,551 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:07:32,552 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:07:32,552 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:07:32,552 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:07:32,552 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:07:32,553 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:07:32,569 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 05:07:32,629 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 05:07:32,629 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:32,635 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 05:07:32,636 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 05:07:32,645 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:32,648 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:07:32,652 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:32,657 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:32,658 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:32,687 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 05:07:32,688 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:32,689 INFO L80 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 91 events. 2/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2020-10-16 05:07:32,692 INFO L117 LiptonReduction]: Number of co-enabled transitions 1740 [2020-10-16 05:07:32,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:32,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:32,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:32,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:32,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:32,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:32,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:32,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:32,925 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:32,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:32,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:32,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:32,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:32,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:32,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:32,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:32,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:32,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:32,992 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:32,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:32,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:32,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:32,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:32,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:33,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:33,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:33,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:33,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:33,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:33,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:33,144 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:33,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:33,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:33,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:33,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:33,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:33,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:33,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:33,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:33,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:33,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:33,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:33,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:33,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,325 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,330 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:33,330 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:33,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,353 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:33,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:33,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:33,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:33,822 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:07:34,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:34,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:34,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:34,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:34,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:34,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:34,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:34,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:34,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:34,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,317 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,319 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:34,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:34,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:34,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:34,447 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:34,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:34,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:34,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:34,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:34,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:34,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:34,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:34,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:34,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:34,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:34,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:34,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:34,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:34,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:34,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:34,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,558 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,559 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:34,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:34,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,795 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:07:34,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:34,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,950 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,951 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:34,953 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:34,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:34,955 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:34,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:35,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:35,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:35,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:35,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:35,311 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:35,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:35,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:35,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,482 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:35,503 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:35,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:07:35,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:07:35,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:07:35,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:35,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:07:35,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:35,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:07:35,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:07:35,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-16 05:07:35,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:35,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:35,726 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:35,729 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:35,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:35,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:35,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:36,558 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 05:07:36,673 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 05:07:36,681 INFO L132 LiptonReduction]: Checked pairs total: 5549 [2020-10-16 05:07:36,681 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 05:07:36,685 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4040 [2020-10-16 05:07:36,691 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2020-10-16 05:07:36,692 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:36,692 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:36,693 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 05:07:36,693 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1712567520, now seen corresponding path program 1 times [2020-10-16 05:07:36,706 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:36,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722005049] [2020-10-16 05:07:36,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:36,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:36,953 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:07:36,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722005049] [2020-10-16 05:07:36,955 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:36,955 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:07:36,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697298982] [2020-10-16 05:07:36,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:07:36,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:36,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:07:36,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:07:36,986 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:36,988 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states. [2020-10-16 05:07:36,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:36,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:36,990 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:37,211 INFO L129 PetriNetUnfolder]: 190/405 cut-off events. [2020-10-16 05:07:37,211 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:37,214 INFO L80 FinitePrefix]: Finished finitePrefix Result has 714 conditions, 405 events. 190/405 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2152 event pairs, 104 based on Foata normal form. 33/403 useless extension candidates. Maximal degree in co-relation 704. Up to 223 conditions per place. [2020-10-16 05:07:37,218 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 05:07:37,218 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 105 flow [2020-10-16 05:07:37,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:07:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:07:37,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2020-10-16 05:07:37,237 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8576998050682261 [2020-10-16 05:07:37,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2020-10-16 05:07:37,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2020-10-16 05:07:37,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:37,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2020-10-16 05:07:37,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:07:37,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:07:37,256 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:07:37,258 INFO L185 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 440 transitions. [2020-10-16 05:07:37,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 105 flow [2020-10-16 05:07:37,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 05:07:37,264 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2020-10-16 05:07:37,267 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2020-10-16 05:07:37,268 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2020-10-16 05:07:37,269 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2020-10-16 05:07:37,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:07:37,269 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:37,269 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:37,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:07:37,270 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:37,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:37,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1739866846, now seen corresponding path program 1 times [2020-10-16 05:07:37,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:37,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949160441] [2020-10-16 05:07:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:37,457 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:07:37,458 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949160441] [2020-10-16 05:07:37,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:37,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:07:37,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484036541] [2020-10-16 05:07:37,460 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:07:37,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:37,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:07:37,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:07:37,462 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 171 [2020-10-16 05:07:37,462 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand 4 states. [2020-10-16 05:07:37,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:37,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 171 [2020-10-16 05:07:37,463 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:37,511 INFO L129 PetriNetUnfolder]: 1/35 cut-off events. [2020-10-16 05:07:37,511 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:37,512 INFO L80 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 35 events. 1/35 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 65 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 47. Up to 5 conditions per place. [2020-10-16 05:07:37,512 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2020-10-16 05:07:37,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 84 flow [2020-10-16 05:07:37,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:07:37,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:07:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2020-10-16 05:07:37,517 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8198830409356725 [2020-10-16 05:07:37,517 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2020-10-16 05:07:37,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2020-10-16 05:07:37,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:37,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2020-10-16 05:07:37,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:07:37,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:07:37,522 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:07:37,522 INFO L185 Difference]: Start difference. First operand has 33 places, 24 transitions, 58 flow. Second operand 5 states and 701 transitions. [2020-10-16 05:07:37,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 84 flow [2020-10-16 05:07:37,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 28 transitions, 80 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 05:07:37,524 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 64 flow [2020-10-16 05:07:37,524 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2020-10-16 05:07:37,525 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2020-10-16 05:07:37,525 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 64 flow [2020-10-16 05:07:37,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:07:37,525 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:37,525 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:37,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:07:37,526 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:37,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:37,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1859395228, now seen corresponding path program 1 times [2020-10-16 05:07:37,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:37,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513411559] [2020-10-16 05:07:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:37,675 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:07:37,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513411559] [2020-10-16 05:07:37,676 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:37,676 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:07:37,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234469689] [2020-10-16 05:07:37,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:07:37,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:37,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:07:37,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:07:37,679 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 171 [2020-10-16 05:07:37,680 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 64 flow. Second operand 5 states. [2020-10-16 05:07:37,680 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:37,680 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 171 [2020-10-16 05:07:37,680 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:37,801 INFO L129 PetriNetUnfolder]: 65/141 cut-off events. [2020-10-16 05:07:37,801 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2020-10-16 05:07:37,802 INFO L80 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 141 events. 65/141 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 594 event pairs, 42 based on Foata normal form. 12/150 useless extension candidates. Maximal degree in co-relation 289. Up to 81 conditions per place. [2020-10-16 05:07:37,803 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 5 changer transitions 11/41 dead transitions. [2020-10-16 05:07:37,803 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 156 flow [2020-10-16 05:07:37,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:37,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2020-10-16 05:07:37,807 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7669172932330827 [2020-10-16 05:07:37,807 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2020-10-16 05:07:37,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2020-10-16 05:07:37,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:37,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2020-10-16 05:07:37,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:37,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:37,812 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:37,812 INFO L185 Difference]: Start difference. First operand has 38 places, 23 transitions, 64 flow. Second operand 7 states and 918 transitions. [2020-10-16 05:07:37,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 156 flow [2020-10-16 05:07:37,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 148 flow, removed 2 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:37,815 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 97 flow [2020-10-16 05:07:37,815 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=42, PETRI_TRANSITIONS=26} [2020-10-16 05:07:37,815 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2020-10-16 05:07:37,815 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 97 flow [2020-10-16 05:07:37,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:07:37,816 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:37,816 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:37,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:07:37,816 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:37,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:37,817 INFO L82 PathProgramCache]: Analyzing trace with hash -447025861, now seen corresponding path program 1 times [2020-10-16 05:07:37,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:37,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810489644] [2020-10-16 05:07:37,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:37,974 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:07:37,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810489644] [2020-10-16 05:07:37,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:37,975 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:07:37,975 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969689291] [2020-10-16 05:07:37,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:07:37,976 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:37,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:07:37,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:07:37,978 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 171 [2020-10-16 05:07:37,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 97 flow. Second operand 5 states. [2020-10-16 05:07:37,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:37,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 171 [2020-10-16 05:07:37,979 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:38,058 INFO L129 PetriNetUnfolder]: 23/73 cut-off events. [2020-10-16 05:07:38,059 INFO L130 PetriNetUnfolder]: For 120/128 co-relation queries the response was YES. [2020-10-16 05:07:38,060 INFO L80 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 73 events. 23/73 cut-off events. For 120/128 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 247 event pairs, 15 based on Foata normal form. 8/79 useless extension candidates. Maximal degree in co-relation 207. Up to 41 conditions per place. [2020-10-16 05:07:38,060 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 2 selfloop transitions, 3 changer transitions 4/30 dead transitions. [2020-10-16 05:07:38,060 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 136 flow [2020-10-16 05:07:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:07:38,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:07:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2020-10-16 05:07:38,064 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8060428849902534 [2020-10-16 05:07:38,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2020-10-16 05:07:38,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2020-10-16 05:07:38,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:38,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2020-10-16 05:07:38,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:07:38,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:07:38,069 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:07:38,070 INFO L185 Difference]: Start difference. First operand has 42 places, 26 transitions, 97 flow. Second operand 6 states and 827 transitions. [2020-10-16 05:07:38,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 136 flow [2020-10-16 05:07:38,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 30 transitions, 129 flow, removed 2 selfloop flow, removed 3 redundant places. [2020-10-16 05:07:38,072 INFO L241 Difference]: Finished difference. Result has 45 places, 26 transitions, 108 flow [2020-10-16 05:07:38,073 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=108, PETRI_PLACES=45, PETRI_TRANSITIONS=26} [2020-10-16 05:07:38,073 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2020-10-16 05:07:38,073 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 108 flow [2020-10-16 05:07:38,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:07:38,073 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:38,073 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:38,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:07:38,074 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:38,074 INFO L82 PathProgramCache]: Analyzing trace with hash -833723287, now seen corresponding path program 1 times [2020-10-16 05:07:38,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:38,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66262939] [2020-10-16 05:07:38,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:38,504 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:07:38,504 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66262939] [2020-10-16 05:07:38,505 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:38,505 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:38,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035967413] [2020-10-16 05:07:38,506 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:38,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:38,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:38,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:38,509 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 171 [2020-10-16 05:07:38,510 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 108 flow. Second operand 9 states. [2020-10-16 05:07:38,510 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:38,510 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 171 [2020-10-16 05:07:38,510 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:39,323 INFO L129 PetriNetUnfolder]: 399/776 cut-off events. [2020-10-16 05:07:39,324 INFO L130 PetriNetUnfolder]: For 1733/1760 co-relation queries the response was YES. [2020-10-16 05:07:39,328 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 776 events. 399/776 cut-off events. For 1733/1760 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4350 event pairs, 78 based on Foata normal form. 82/831 useless extension candidates. Maximal degree in co-relation 2175. Up to 293 conditions per place. [2020-10-16 05:07:39,341 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 20 selfloop transitions, 14 changer transitions 14/61 dead transitions. [2020-10-16 05:07:39,342 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 300 flow [2020-10-16 05:07:39,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:07:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:07:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1139 transitions. [2020-10-16 05:07:39,347 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6660818713450293 [2020-10-16 05:07:39,347 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1139 transitions. [2020-10-16 05:07:39,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1139 transitions. [2020-10-16 05:07:39,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:39,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1139 transitions. [2020-10-16 05:07:39,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:07:39,354 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:07:39,354 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:07:39,354 INFO L185 Difference]: Start difference. First operand has 45 places, 26 transitions, 108 flow. Second operand 10 states and 1139 transitions. [2020-10-16 05:07:39,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 300 flow [2020-10-16 05:07:39,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 61 transitions, 276 flow, removed 8 selfloop flow, removed 6 redundant places. [2020-10-16 05:07:39,363 INFO L241 Difference]: Finished difference. Result has 52 places, 37 transitions, 188 flow [2020-10-16 05:07:39,363 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=188, PETRI_PLACES=52, PETRI_TRANSITIONS=37} [2020-10-16 05:07:39,363 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2020-10-16 05:07:39,364 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 188 flow [2020-10-16 05:07:39,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:39,364 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:39,364 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:39,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:07:39,364 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:39,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1829453121, now seen corresponding path program 1 times [2020-10-16 05:07:39,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:39,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793801977] [2020-10-16 05:07:39,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:39,526 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:07:39,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793801977] [2020-10-16 05:07:39,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:39,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:07:39,528 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020844636] [2020-10-16 05:07:39,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:07:39,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:39,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:07:39,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:07:39,531 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:39,532 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 188 flow. Second operand 4 states. [2020-10-16 05:07:39,532 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:39,533 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:39,533 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:39,682 INFO L129 PetriNetUnfolder]: 202/496 cut-off events. [2020-10-16 05:07:39,683 INFO L130 PetriNetUnfolder]: For 705/796 co-relation queries the response was YES. [2020-10-16 05:07:39,686 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1486 conditions, 496 events. 202/496 cut-off events. For 705/796 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 3273 event pairs, 66 based on Foata normal form. 62/530 useless extension candidates. Maximal degree in co-relation 1466. Up to 281 conditions per place. [2020-10-16 05:07:39,689 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 8 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2020-10-16 05:07:39,689 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 284 flow [2020-10-16 05:07:39,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:07:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:07:39,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2020-10-16 05:07:39,692 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.839766081871345 [2020-10-16 05:07:39,693 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2020-10-16 05:07:39,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2020-10-16 05:07:39,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:39,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2020-10-16 05:07:39,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:07:39,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:07:39,697 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:07:39,697 INFO L185 Difference]: Start difference. First operand has 52 places, 37 transitions, 188 flow. Second operand 5 states and 718 transitions. [2020-10-16 05:07:39,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 284 flow [2020-10-16 05:07:39,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 49 transitions, 277 flow, removed 3 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:39,707 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 283 flow [2020-10-16 05:07:39,708 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=283, PETRI_PLACES=52, PETRI_TRANSITIONS=46} [2020-10-16 05:07:39,708 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2020-10-16 05:07:39,708 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 283 flow [2020-10-16 05:07:39,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:07:39,708 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:39,708 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:39,709 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:07:39,709 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:39,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1415080601, now seen corresponding path program 1 times [2020-10-16 05:07:39,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:39,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882983140] [2020-10-16 05:07:39,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:39,894 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:07:39,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882983140] [2020-10-16 05:07:39,894 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:39,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:07:39,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299898753] [2020-10-16 05:07:39,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:07:39,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:07:39,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:07:39,897 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:39,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 283 flow. Second operand 5 states. [2020-10-16 05:07:39,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:39,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:39,898 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:40,038 INFO L129 PetriNetUnfolder]: 143/417 cut-off events. [2020-10-16 05:07:40,039 INFO L130 PetriNetUnfolder]: For 1375/1780 co-relation queries the response was YES. [2020-10-16 05:07:40,041 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1743 conditions, 417 events. 143/417 cut-off events. For 1375/1780 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2802 event pairs, 8 based on Foata normal form. 196/597 useless extension candidates. Maximal degree in co-relation 1722. Up to 242 conditions per place. [2020-10-16 05:07:40,043 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 5 selfloop transitions, 19 changer transitions 3/56 dead transitions. [2020-10-16 05:07:40,044 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 419 flow [2020-10-16 05:07:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:40,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2020-10-16 05:07:40,048 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8395989974937343 [2020-10-16 05:07:40,048 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2020-10-16 05:07:40,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2020-10-16 05:07:40,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:40,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2020-10-16 05:07:40,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:40,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:40,054 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:40,054 INFO L185 Difference]: Start difference. First operand has 52 places, 46 transitions, 283 flow. Second operand 7 states and 1005 transitions. [2020-10-16 05:07:40,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 419 flow [2020-10-16 05:07:40,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 405 flow, removed 4 selfloop flow, removed 1 redundant places. [2020-10-16 05:07:40,061 INFO L241 Difference]: Finished difference. Result has 60 places, 53 transitions, 396 flow [2020-10-16 05:07:40,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2020-10-16 05:07:40,061 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2020-10-16 05:07:40,061 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 396 flow [2020-10-16 05:07:40,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:07:40,062 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:40,062 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:40,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:07:40,062 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:40,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash 625146234, now seen corresponding path program 1 times [2020-10-16 05:07:40,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:40,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774846797] [2020-10-16 05:07:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:40,325 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:07:40,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774846797] [2020-10-16 05:07:40,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:40,326 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:40,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204266062] [2020-10-16 05:07:40,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:07:40,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:40,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:07:40,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:07:40,329 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:40,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 396 flow. Second operand 6 states. [2020-10-16 05:07:40,330 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:40,330 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:40,330 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:40,489 INFO L129 PetriNetUnfolder]: 112/357 cut-off events. [2020-10-16 05:07:40,489 INFO L130 PetriNetUnfolder]: For 2183/2654 co-relation queries the response was YES. [2020-10-16 05:07:40,492 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1785 conditions, 357 events. 112/357 cut-off events. For 2183/2654 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 2415 event pairs, 0 based on Foata normal form. 163/505 useless extension candidates. Maximal degree in co-relation 1760. Up to 208 conditions per place. [2020-10-16 05:07:40,494 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 2 selfloop transitions, 23 changer transitions 3/57 dead transitions. [2020-10-16 05:07:40,494 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 490 flow [2020-10-16 05:07:40,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:07:40,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:07:40,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2020-10-16 05:07:40,499 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356075373619233 [2020-10-16 05:07:40,499 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2020-10-16 05:07:40,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2020-10-16 05:07:40,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:40,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2020-10-16 05:07:40,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:07:40,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:07:40,507 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:07:40,507 INFO L185 Difference]: Start difference. First operand has 60 places, 53 transitions, 396 flow. Second operand 9 states and 1286 transitions. [2020-10-16 05:07:40,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 490 flow [2020-10-16 05:07:40,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 419 flow, removed 25 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:40,522 INFO L241 Difference]: Finished difference. Result has 67 places, 54 transitions, 394 flow [2020-10-16 05:07:40,522 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=394, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2020-10-16 05:07:40,522 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2020-10-16 05:07:40,523 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 394 flow [2020-10-16 05:07:40,523 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:07:40,523 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:40,523 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:40,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:07:40,523 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:40,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash -114906297, now seen corresponding path program 1 times [2020-10-16 05:07:40,524 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:40,524 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52136701] [2020-10-16 05:07:40,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:41,837 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:07:41,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52136701] [2020-10-16 05:07:41,838 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:41,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-10-16 05:07:41,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336982889] [2020-10-16 05:07:41,839 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-16 05:07:41,839 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-16 05:07:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2020-10-16 05:07:41,842 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 171 [2020-10-16 05:07:41,843 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 394 flow. Second operand 16 states. [2020-10-16 05:07:41,843 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:41,843 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 171 [2020-10-16 05:07:41,843 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:42,912 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 24 [2020-10-16 05:07:43,489 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-10-16 05:07:45,406 INFO L129 PetriNetUnfolder]: 1234/2408 cut-off events. [2020-10-16 05:07:45,406 INFO L130 PetriNetUnfolder]: For 8389/8474 co-relation queries the response was YES. [2020-10-16 05:07:45,416 INFO L80 FinitePrefix]: Finished finitePrefix Result has 10459 conditions, 2408 events. 1234/2408 cut-off events. For 8389/8474 co-relation queries the response was YES. Maximal size of possible extension queue 249. Compared 17220 event pairs, 43 based on Foata normal form. 33/2434 useless extension candidates. Maximal degree in co-relation 10432. Up to 905 conditions per place. [2020-10-16 05:07:45,424 INFO L132 encePairwiseOnDemand]: 156/171 looper letters, 87 selfloop transitions, 90 changer transitions 131/315 dead transitions. [2020-10-16 05:07:45,424 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 315 transitions, 3054 flow [2020-10-16 05:07:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-10-16 05:07:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-16 05:07:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2209 transitions. [2020-10-16 05:07:45,433 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5382553606237817 [2020-10-16 05:07:45,433 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2209 transitions. [2020-10-16 05:07:45,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2209 transitions. [2020-10-16 05:07:45,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:45,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2209 transitions. [2020-10-16 05:07:45,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 25 states. [2020-10-16 05:07:45,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 25 states. [2020-10-16 05:07:45,448 INFO L81 ComplementDD]: Finished complementDD. Result 25 states. [2020-10-16 05:07:45,448 INFO L185 Difference]: Start difference. First operand has 67 places, 54 transitions, 394 flow. Second operand 24 states and 2209 transitions. [2020-10-16 05:07:45,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 315 transitions, 3054 flow [2020-10-16 05:07:45,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 315 transitions, 2513 flow, removed 120 selfloop flow, removed 9 redundant places. [2020-10-16 05:07:45,561 INFO L241 Difference]: Finished difference. Result has 95 places, 136 transitions, 1136 flow [2020-10-16 05:07:45,561 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1136, PETRI_PLACES=95, PETRI_TRANSITIONS=136} [2020-10-16 05:07:45,562 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 60 predicate places. [2020-10-16 05:07:45,562 INFO L481 AbstractCegarLoop]: Abstraction has has 95 places, 136 transitions, 1136 flow [2020-10-16 05:07:45,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-16 05:07:45,562 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:45,563 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:45,563 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:07:45,563 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:45,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1212707765, now seen corresponding path program 2 times [2020-10-16 05:07:45,564 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:45,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622196858] [2020-10-16 05:07:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:45,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:45,946 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:07:45,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622196858] [2020-10-16 05:07:45,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:45,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:07:45,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739129771] [2020-10-16 05:07:45,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:07:45,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:45,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:07:45,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:07:45,950 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 171 [2020-10-16 05:07:45,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 136 transitions, 1136 flow. Second operand 10 states. [2020-10-16 05:07:45,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:45,952 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 171 [2020-10-16 05:07:45,952 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:46,451 INFO L129 PetriNetUnfolder]: 302/752 cut-off events. [2020-10-16 05:07:46,451 INFO L130 PetriNetUnfolder]: For 4566/4738 co-relation queries the response was YES. [2020-10-16 05:07:46,456 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3933 conditions, 752 events. 302/752 cut-off events. For 4566/4738 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 4901 event pairs, 15 based on Foata normal form. 47/795 useless extension candidates. Maximal degree in co-relation 3901. Up to 302 conditions per place. [2020-10-16 05:07:46,461 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 79 selfloop transitions, 31 changer transitions 18/181 dead transitions. [2020-10-16 05:07:46,461 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 181 transitions, 1784 flow [2020-10-16 05:07:46,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:07:46,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:07:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 983 transitions. [2020-10-16 05:07:46,465 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6387264457439896 [2020-10-16 05:07:46,465 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 983 transitions. [2020-10-16 05:07:46,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 983 transitions. [2020-10-16 05:07:46,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:46,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 983 transitions. [2020-10-16 05:07:46,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:07:46,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:07:46,471 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:07:46,471 INFO L185 Difference]: Start difference. First operand has 95 places, 136 transitions, 1136 flow. Second operand 9 states and 983 transitions. [2020-10-16 05:07:46,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 181 transitions, 1784 flow [2020-10-16 05:07:46,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 181 transitions, 1705 flow, removed 38 selfloop flow, removed 8 redundant places. [2020-10-16 05:07:46,502 INFO L241 Difference]: Finished difference. Result has 91 places, 154 transitions, 1400 flow [2020-10-16 05:07:46,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1083, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1400, PETRI_PLACES=91, PETRI_TRANSITIONS=154} [2020-10-16 05:07:46,503 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 56 predicate places. [2020-10-16 05:07:46,503 INFO L481 AbstractCegarLoop]: Abstraction has has 91 places, 154 transitions, 1400 flow [2020-10-16 05:07:46,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:07:46,503 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:46,503 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:46,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:07:46,503 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash 880645565, now seen corresponding path program 3 times [2020-10-16 05:07:46,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:46,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701997843] [2020-10-16 05:07:46,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:46,945 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:07:46,946 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701997843] [2020-10-16 05:07:46,946 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:46,946 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:07:46,946 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197103281] [2020-10-16 05:07:46,947 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:07:46,947 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:46,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:07:46,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:07:46,949 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 171 [2020-10-16 05:07:46,950 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 154 transitions, 1400 flow. Second operand 12 states. [2020-10-16 05:07:46,950 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:46,950 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 171 [2020-10-16 05:07:46,950 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:47,925 INFO L129 PetriNetUnfolder]: 389/870 cut-off events. [2020-10-16 05:07:47,925 INFO L130 PetriNetUnfolder]: For 5984/6363 co-relation queries the response was YES. [2020-10-16 05:07:47,930 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5133 conditions, 870 events. 389/870 cut-off events. For 5984/6363 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 5384 event pairs, 41 based on Foata normal form. 82/950 useless extension candidates. Maximal degree in co-relation 5103. Up to 634 conditions per place. [2020-10-16 05:07:47,935 INFO L132 encePairwiseOnDemand]: 159/171 looper letters, 129 selfloop transitions, 42 changer transitions 62/240 dead transitions. [2020-10-16 05:07:47,935 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 240 transitions, 2718 flow [2020-10-16 05:07:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 05:07:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-16 05:07:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1469 transitions. [2020-10-16 05:07:47,940 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5727095516569201 [2020-10-16 05:07:47,941 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1469 transitions. [2020-10-16 05:07:47,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1469 transitions. [2020-10-16 05:07:47,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:47,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1469 transitions. [2020-10-16 05:07:47,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-16 05:07:47,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-16 05:07:47,949 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-16 05:07:47,949 INFO L185 Difference]: Start difference. First operand has 91 places, 154 transitions, 1400 flow. Second operand 15 states and 1469 transitions. [2020-10-16 05:07:47,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 240 transitions, 2718 flow [2020-10-16 05:07:47,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 240 transitions, 2668 flow, removed 21 selfloop flow, removed 3 redundant places. [2020-10-16 05:07:47,984 INFO L241 Difference]: Finished difference. Result has 109 places, 167 transitions, 1768 flow [2020-10-16 05:07:47,984 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1768, PETRI_PLACES=109, PETRI_TRANSITIONS=167} [2020-10-16 05:07:47,984 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2020-10-16 05:07:47,985 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 167 transitions, 1768 flow [2020-10-16 05:07:47,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:07:47,985 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:47,985 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:47,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:07:47,985 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:47,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:47,986 INFO L82 PathProgramCache]: Analyzing trace with hash 2000207935, now seen corresponding path program 4 times [2020-10-16 05:07:47,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:47,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204337156] [2020-10-16 05:07:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:48,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:48,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204337156] [2020-10-16 05:07:48,329 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:48,329 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:07:48,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170025813] [2020-10-16 05:07:48,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:07:48,330 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:48,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:07:48,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:07:48,332 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 171 [2020-10-16 05:07:48,333 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 167 transitions, 1768 flow. Second operand 10 states. [2020-10-16 05:07:48,333 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:48,333 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 171 [2020-10-16 05:07:48,333 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:48,938 INFO L129 PetriNetUnfolder]: 273/692 cut-off events. [2020-10-16 05:07:48,938 INFO L130 PetriNetUnfolder]: For 5871/6293 co-relation queries the response was YES. [2020-10-16 05:07:48,943 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4144 conditions, 692 events. 273/692 cut-off events. For 5871/6293 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4480 event pairs, 28 based on Foata normal form. 60/748 useless extension candidates. Maximal degree in co-relation 4106. Up to 256 conditions per place. [2020-10-16 05:07:48,947 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 74 selfloop transitions, 37 changer transitions 23/183 dead transitions. [2020-10-16 05:07:48,948 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 183 transitions, 2160 flow [2020-10-16 05:07:48,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:07:48,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:07:48,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 965 transitions. [2020-10-16 05:07:48,951 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6270305393112411 [2020-10-16 05:07:48,952 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 965 transitions. [2020-10-16 05:07:48,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 965 transitions. [2020-10-16 05:07:48,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:48,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 965 transitions. [2020-10-16 05:07:48,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:07:48,957 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:07:48,957 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:07:48,957 INFO L185 Difference]: Start difference. First operand has 109 places, 167 transitions, 1768 flow. Second operand 9 states and 965 transitions. [2020-10-16 05:07:48,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 183 transitions, 2160 flow [2020-10-16 05:07:48,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 183 transitions, 2102 flow, removed 23 selfloop flow, removed 5 redundant places. [2020-10-16 05:07:48,997 INFO L241 Difference]: Finished difference. Result has 113 places, 157 transitions, 1733 flow [2020-10-16 05:07:48,997 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1714, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1733, PETRI_PLACES=113, PETRI_TRANSITIONS=157} [2020-10-16 05:07:48,998 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 78 predicate places. [2020-10-16 05:07:48,998 INFO L481 AbstractCegarLoop]: Abstraction has has 113 places, 157 transitions, 1733 flow [2020-10-16 05:07:48,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:07:48,998 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:48,998 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:48,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:07:48,999 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:48,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:48,999 INFO L82 PathProgramCache]: Analyzing trace with hash -484907019, now seen corresponding path program 5 times [2020-10-16 05:07:48,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:48,999 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207308295] [2020-10-16 05:07:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:49,341 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:07:49,342 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207308295] [2020-10-16 05:07:49,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:49,342 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:07:49,342 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970223032] [2020-10-16 05:07:49,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:07:49,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:49,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:07:49,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:07:49,346 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 171 [2020-10-16 05:07:49,347 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 157 transitions, 1733 flow. Second operand 8 states. [2020-10-16 05:07:49,348 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:49,348 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 171 [2020-10-16 05:07:49,348 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:50,105 INFO L129 PetriNetUnfolder]: 321/784 cut-off events. [2020-10-16 05:07:50,105 INFO L130 PetriNetUnfolder]: For 6858/7314 co-relation queries the response was YES. [2020-10-16 05:07:50,110 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4793 conditions, 784 events. 321/784 cut-off events. For 6858/7314 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 5171 event pairs, 9 based on Foata normal form. 144/927 useless extension candidates. Maximal degree in co-relation 4752. Up to 289 conditions per place. [2020-10-16 05:07:50,115 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 73 selfloop transitions, 70 changer transitions 23/215 dead transitions. [2020-10-16 05:07:50,115 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 215 transitions, 2580 flow [2020-10-16 05:07:50,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:07:50,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:07:50,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1479 transitions. [2020-10-16 05:07:50,125 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6177944862155389 [2020-10-16 05:07:50,125 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1479 transitions. [2020-10-16 05:07:50,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1479 transitions. [2020-10-16 05:07:50,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:50,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1479 transitions. [2020-10-16 05:07:50,129 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:07:50,131 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:07:50,132 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:07:50,132 INFO L185 Difference]: Start difference. First operand has 113 places, 157 transitions, 1733 flow. Second operand 14 states and 1479 transitions. [2020-10-16 05:07:50,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 215 transitions, 2580 flow [2020-10-16 05:07:50,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 215 transitions, 2449 flow, removed 26 selfloop flow, removed 10 redundant places. [2020-10-16 05:07:50,170 INFO L241 Difference]: Finished difference. Result has 117 places, 183 transitions, 2187 flow [2020-10-16 05:07:50,170 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1626, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2187, PETRI_PLACES=117, PETRI_TRANSITIONS=183} [2020-10-16 05:07:50,171 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 82 predicate places. [2020-10-16 05:07:50,171 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 183 transitions, 2187 flow [2020-10-16 05:07:50,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:07:50,171 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:50,171 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:50,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:07:50,171 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:50,172 INFO L82 PathProgramCache]: Analyzing trace with hash 583046173, now seen corresponding path program 6 times [2020-10-16 05:07:50,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:50,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103640925] [2020-10-16 05:07:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:50,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:50,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103640925] [2020-10-16 05:07:50,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:50,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 05:07:50,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164185013] [2020-10-16 05:07:50,659 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 05:07:50,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:50,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 05:07:50,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-16 05:07:50,661 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 171 [2020-10-16 05:07:50,661 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 183 transitions, 2187 flow. Second operand 11 states. [2020-10-16 05:07:50,661 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:50,661 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 171 [2020-10-16 05:07:50,662 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:51,330 INFO L129 PetriNetUnfolder]: 306/759 cut-off events. [2020-10-16 05:07:51,331 INFO L130 PetriNetUnfolder]: For 7530/8157 co-relation queries the response was YES. [2020-10-16 05:07:51,335 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4760 conditions, 759 events. 306/759 cut-off events. For 7530/8157 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5047 event pairs, 27 based on Foata normal form. 174/929 useless extension candidates. Maximal degree in co-relation 4719. Up to 279 conditions per place. [2020-10-16 05:07:51,340 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 87 selfloop transitions, 49 changer transitions 24/208 dead transitions. [2020-10-16 05:07:51,340 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 208 transitions, 2744 flow [2020-10-16 05:07:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 05:07:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 05:07:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1250 transitions. [2020-10-16 05:07:51,343 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6091617933723197 [2020-10-16 05:07:51,343 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1250 transitions. [2020-10-16 05:07:51,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1250 transitions. [2020-10-16 05:07:51,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:51,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1250 transitions. [2020-10-16 05:07:51,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 05:07:51,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 05:07:51,348 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 05:07:51,348 INFO L185 Difference]: Start difference. First operand has 117 places, 183 transitions, 2187 flow. Second operand 12 states and 1250 transitions. [2020-10-16 05:07:51,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 208 transitions, 2744 flow [2020-10-16 05:07:51,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 208 transitions, 2685 flow, removed 20 selfloop flow, removed 7 redundant places. [2020-10-16 05:07:51,383 INFO L241 Difference]: Finished difference. Result has 124 places, 182 transitions, 2311 flow [2020-10-16 05:07:51,383 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2311, PETRI_PLACES=124, PETRI_TRANSITIONS=182} [2020-10-16 05:07:51,383 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 89 predicate places. [2020-10-16 05:07:51,383 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 182 transitions, 2311 flow [2020-10-16 05:07:51,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 05:07:51,383 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:51,384 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:51,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:07:51,384 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:51,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:51,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1516435021, now seen corresponding path program 7 times [2020-10-16 05:07:51,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:51,385 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966391973] [2020-10-16 05:07:51,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:51,546 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:07:51,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966391973] [2020-10-16 05:07:51,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:51,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:51,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629294001] [2020-10-16 05:07:51,549 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:07:51,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:51,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:07:51,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:07:51,554 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 171 [2020-10-16 05:07:51,555 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 182 transitions, 2311 flow. Second operand 6 states. [2020-10-16 05:07:51,555 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:51,555 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 171 [2020-10-16 05:07:51,555 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:51,996 INFO L129 PetriNetUnfolder]: 302/747 cut-off events. [2020-10-16 05:07:51,996 INFO L130 PetriNetUnfolder]: For 7639/8157 co-relation queries the response was YES. [2020-10-16 05:07:52,000 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4847 conditions, 747 events. 302/747 cut-off events. For 7639/8157 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 4982 event pairs, 22 based on Foata normal form. 152/895 useless extension candidates. Maximal degree in co-relation 4803. Up to 277 conditions per place. [2020-10-16 05:07:52,004 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 83 selfloop transitions, 57 changer transitions 32/220 dead transitions. [2020-10-16 05:07:52,004 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 220 transitions, 3044 flow [2020-10-16 05:07:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:07:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:07:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2020-10-16 05:07:52,014 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6783625730994152 [2020-10-16 05:07:52,014 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2020-10-16 05:07:52,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2020-10-16 05:07:52,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:52,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2020-10-16 05:07:52,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:07:52,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:07:52,017 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:07:52,017 INFO L185 Difference]: Start difference. First operand has 124 places, 182 transitions, 2311 flow. Second operand 6 states and 696 transitions. [2020-10-16 05:07:52,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 220 transitions, 3044 flow [2020-10-16 05:07:52,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 220 transitions, 2853 flow, removed 20 selfloop flow, removed 10 redundant places. [2020-10-16 05:07:52,061 INFO L241 Difference]: Finished difference. Result has 113 places, 186 transitions, 2375 flow [2020-10-16 05:07:52,061 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2375, PETRI_PLACES=113, PETRI_TRANSITIONS=186} [2020-10-16 05:07:52,061 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 78 predicate places. [2020-10-16 05:07:52,062 INFO L481 AbstractCegarLoop]: Abstraction has has 113 places, 186 transitions, 2375 flow [2020-10-16 05:07:52,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:07:52,128 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:52,128 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:52,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:07:52,128 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:52,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:52,129 INFO L82 PathProgramCache]: Analyzing trace with hash 607092017, now seen corresponding path program 8 times [2020-10-16 05:07:52,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:52,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577003916] [2020-10-16 05:07:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:52,449 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:07:52,452 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577003916] [2020-10-16 05:07:52,452 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:52,453 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:07:52,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485369128] [2020-10-16 05:07:52,455 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:07:52,456 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:52,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:07:52,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:07:52,461 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 171 [2020-10-16 05:07:52,463 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 186 transitions, 2375 flow. Second operand 12 states. [2020-10-16 05:07:52,463 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:52,463 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 171 [2020-10-16 05:07:52,463 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:53,177 INFO L129 PetriNetUnfolder]: 433/942 cut-off events. [2020-10-16 05:07:53,177 INFO L130 PetriNetUnfolder]: For 9228/9644 co-relation queries the response was YES. [2020-10-16 05:07:53,182 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6617 conditions, 942 events. 433/942 cut-off events. For 9228/9644 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5860 event pairs, 51 based on Foata normal form. 34/975 useless extension candidates. Maximal degree in co-relation 6575. Up to 680 conditions per place. [2020-10-16 05:07:53,188 INFO L132 encePairwiseOnDemand]: 159/171 looper letters, 152 selfloop transitions, 6 changer transitions 89/254 dead transitions. [2020-10-16 05:07:53,188 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 254 transitions, 3647 flow [2020-10-16 05:07:53,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:07:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:07:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1100 transitions. [2020-10-16 05:07:53,190 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5847953216374269 [2020-10-16 05:07:53,191 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1100 transitions. [2020-10-16 05:07:53,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1100 transitions. [2020-10-16 05:07:53,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:53,191 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1100 transitions. [2020-10-16 05:07:53,193 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:07:53,194 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:07:53,195 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:07:53,195 INFO L185 Difference]: Start difference. First operand has 113 places, 186 transitions, 2375 flow. Second operand 11 states and 1100 transitions. [2020-10-16 05:07:53,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 254 transitions, 3647 flow [2020-10-16 05:07:53,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 254 transitions, 3512 flow, removed 9 selfloop flow, removed 4 redundant places. [2020-10-16 05:07:53,234 INFO L241 Difference]: Finished difference. Result has 124 places, 165 transitions, 2073 flow [2020-10-16 05:07:53,234 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2262, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2073, PETRI_PLACES=124, PETRI_TRANSITIONS=165} [2020-10-16 05:07:53,234 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 89 predicate places. [2020-10-16 05:07:53,234 INFO L481 AbstractCegarLoop]: Abstraction has has 124 places, 165 transitions, 2073 flow [2020-10-16 05:07:53,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:07:53,235 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:53,235 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:53,235 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:07:53,235 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:53,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:53,235 INFO L82 PathProgramCache]: Analyzing trace with hash -81578273, now seen corresponding path program 9 times [2020-10-16 05:07:53,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:53,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397081376] [2020-10-16 05:07:53,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:53,537 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2020-10-16 05:07:53,698 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:07:53,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397081376] [2020-10-16 05:07:53,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:53,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:07:53,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493487472] [2020-10-16 05:07:53,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:07:53,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:53,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:07:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:07:53,702 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 171 [2020-10-16 05:07:53,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 165 transitions, 2073 flow. Second operand 10 states. [2020-10-16 05:07:53,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:53,703 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 171 [2020-10-16 05:07:53,704 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:54,494 INFO L129 PetriNetUnfolder]: 357/884 cut-off events. [2020-10-16 05:07:54,494 INFO L130 PetriNetUnfolder]: For 9655/10391 co-relation queries the response was YES. [2020-10-16 05:07:54,501 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5853 conditions, 884 events. 357/884 cut-off events. For 9655/10391 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 6133 event pairs, 11 based on Foata normal form. 123/1001 useless extension candidates. Maximal degree in co-relation 5810. Up to 309 conditions per place. [2020-10-16 05:07:54,511 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 90 selfloop transitions, 77 changer transitions 23/238 dead transitions. [2020-10-16 05:07:54,512 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 238 transitions, 3249 flow [2020-10-16 05:07:54,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:07:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:07:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1159 transitions. [2020-10-16 05:07:54,514 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6161616161616161 [2020-10-16 05:07:54,514 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1159 transitions. [2020-10-16 05:07:54,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1159 transitions. [2020-10-16 05:07:54,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:54,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1159 transitions. [2020-10-16 05:07:54,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:07:54,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:07:54,517 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:07:54,517 INFO L185 Difference]: Start difference. First operand has 124 places, 165 transitions, 2073 flow. Second operand 11 states and 1159 transitions. [2020-10-16 05:07:54,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 238 transitions, 3249 flow [2020-10-16 05:07:54,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 238 transitions, 3024 flow, removed 53 selfloop flow, removed 13 redundant places. [2020-10-16 05:07:54,560 INFO L241 Difference]: Finished difference. Result has 116 places, 202 transitions, 2704 flow [2020-10-16 05:07:54,560 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1914, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2704, PETRI_PLACES=116, PETRI_TRANSITIONS=202} [2020-10-16 05:07:54,561 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 81 predicate places. [2020-10-16 05:07:54,561 INFO L481 AbstractCegarLoop]: Abstraction has has 116 places, 202 transitions, 2704 flow [2020-10-16 05:07:54,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:07:54,561 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:54,561 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:54,561 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:07:54,561 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:54,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:54,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1012236407, now seen corresponding path program 10 times [2020-10-16 05:07:54,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:54,562 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486142211] [2020-10-16 05:07:54,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:55,015 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:07:55,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486142211] [2020-10-16 05:07:55,015 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:55,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:07:55,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567340712] [2020-10-16 05:07:55,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:07:55,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:55,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:07:55,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:07:55,022 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 171 [2020-10-16 05:07:55,024 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 202 transitions, 2704 flow. Second operand 10 states. [2020-10-16 05:07:55,024 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:55,024 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 171 [2020-10-16 05:07:55,024 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:55,459 WARN L193 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 27 [2020-10-16 05:07:55,935 INFO L129 PetriNetUnfolder]: 335/854 cut-off events. [2020-10-16 05:07:55,935 INFO L130 PetriNetUnfolder]: For 9315/10235 co-relation queries the response was YES. [2020-10-16 05:07:55,940 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5646 conditions, 854 events. 335/854 cut-off events. For 9315/10235 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 5991 event pairs, 15 based on Foata normal form. 117/967 useless extension candidates. Maximal degree in co-relation 5605. Up to 226 conditions per place. [2020-10-16 05:07:55,944 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 77 selfloop transitions, 78 changer transitions 25/224 dead transitions. [2020-10-16 05:07:55,944 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 224 transitions, 3254 flow [2020-10-16 05:07:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:07:55,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:07:55,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 950 transitions. [2020-10-16 05:07:55,946 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6172839506172839 [2020-10-16 05:07:55,946 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 950 transitions. [2020-10-16 05:07:55,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 950 transitions. [2020-10-16 05:07:55,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:55,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 950 transitions. [2020-10-16 05:07:55,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:07:55,949 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:07:55,949 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:07:55,950 INFO L185 Difference]: Start difference. First operand has 116 places, 202 transitions, 2704 flow. Second operand 9 states and 950 transitions. [2020-10-16 05:07:55,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 224 transitions, 3254 flow [2020-10-16 05:07:55,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 224 transitions, 3178 flow, removed 26 selfloop flow, removed 5 redundant places. [2020-10-16 05:07:55,987 INFO L241 Difference]: Finished difference. Result has 122 places, 188 transitions, 2743 flow [2020-10-16 05:07:55,988 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2650, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2743, PETRI_PLACES=122, PETRI_TRANSITIONS=188} [2020-10-16 05:07:55,988 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 87 predicate places. [2020-10-16 05:07:55,988 INFO L481 AbstractCegarLoop]: Abstraction has has 122 places, 188 transitions, 2743 flow [2020-10-16 05:07:55,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:07:55,988 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:55,988 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:55,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:07:55,989 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:55,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:55,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1858184865, now seen corresponding path program 11 times [2020-10-16 05:07:55,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:55,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965090835] [2020-10-16 05:07:55,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:57,023 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:07:57,023 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965090835] [2020-10-16 05:07:57,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:57,024 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:07:57,024 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788120681] [2020-10-16 05:07:57,024 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:07:57,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:57,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:07:57,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:07:57,027 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 171 [2020-10-16 05:07:57,027 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 188 transitions, 2743 flow. Second operand 14 states. [2020-10-16 05:07:57,028 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:57,028 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 171 [2020-10-16 05:07:57,028 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:58,552 INFO L129 PetriNetUnfolder]: 409/923 cut-off events. [2020-10-16 05:07:58,552 INFO L130 PetriNetUnfolder]: For 11746/12432 co-relation queries the response was YES. [2020-10-16 05:07:58,560 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6847 conditions, 923 events. 409/923 cut-off events. For 11746/12432 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5927 event pairs, 21 based on Foata normal form. 49/972 useless extension candidates. Maximal degree in co-relation 6803. Up to 312 conditions per place. [2020-10-16 05:07:58,566 INFO L132 encePairwiseOnDemand]: 156/171 looper letters, 144 selfloop transitions, 88 changer transitions 41/280 dead transitions. [2020-10-16 05:07:58,566 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 280 transitions, 4487 flow [2020-10-16 05:07:58,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-16 05:07:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-16 05:07:58,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1318 transitions. [2020-10-16 05:07:58,569 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5505430242272348 [2020-10-16 05:07:58,569 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1318 transitions. [2020-10-16 05:07:58,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1318 transitions. [2020-10-16 05:07:58,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:58,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1318 transitions. [2020-10-16 05:07:58,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 15 states. [2020-10-16 05:07:58,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 15 states. [2020-10-16 05:07:58,574 INFO L81 ComplementDD]: Finished complementDD. Result 15 states. [2020-10-16 05:07:58,574 INFO L185 Difference]: Start difference. First operand has 122 places, 188 transitions, 2743 flow. Second operand 14 states and 1318 transitions. [2020-10-16 05:07:58,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 280 transitions, 4487 flow [2020-10-16 05:07:58,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 280 transitions, 4335 flow, removed 29 selfloop flow, removed 7 redundant places. [2020-10-16 05:07:58,641 INFO L241 Difference]: Finished difference. Result has 130 places, 208 transitions, 3233 flow [2020-10-16 05:07:58,641 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3233, PETRI_PLACES=130, PETRI_TRANSITIONS=208} [2020-10-16 05:07:58,642 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 95 predicate places. [2020-10-16 05:07:58,642 INFO L481 AbstractCegarLoop]: Abstraction has has 130 places, 208 transitions, 3233 flow [2020-10-16 05:07:58,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:07:58,642 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:58,642 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:58,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 05:07:58,643 INFO L429 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:07:58,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:58,644 INFO L82 PathProgramCache]: Analyzing trace with hash 282847543, now seen corresponding path program 12 times [2020-10-16 05:07:58,644 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:58,644 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397992317] [2020-10-16 05:07:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:59,862 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-10-16 05:08:00,009 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 27 [2020-10-16 05:08:00,171 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-10-16 05:08:00,386 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:08:00,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397992317] [2020-10-16 05:08:00,386 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:00,386 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-10-16 05:08:00,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452185093] [2020-10-16 05:08:00,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-16 05:08:00,387 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:00,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-16 05:08:00,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2020-10-16 05:08:00,390 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 171 [2020-10-16 05:08:00,391 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 208 transitions, 3233 flow. Second operand 17 states. [2020-10-16 05:08:00,391 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:00,391 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 171 [2020-10-16 05:08:00,392 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:02,062 INFO L129 PetriNetUnfolder]: 483/1086 cut-off events. [2020-10-16 05:08:02,062 INFO L130 PetriNetUnfolder]: For 15642/16328 co-relation queries the response was YES. [2020-10-16 05:08:02,068 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8595 conditions, 1086 events. 483/1086 cut-off events. For 15642/16328 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 7338 event pairs, 54 based on Foata normal form. 78/1164 useless extension candidates. Maximal degree in co-relation 8550. Up to 816 conditions per place. [2020-10-16 05:08:02,073 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 203 selfloop transitions, 64 changer transitions 13/287 dead transitions. [2020-10-16 05:08:02,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 287 transitions, 4837 flow [2020-10-16 05:08:02,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-16 05:08:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-10-16 05:08:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1371 transitions. [2020-10-16 05:08:02,076 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5345029239766081 [2020-10-16 05:08:02,076 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1371 transitions. [2020-10-16 05:08:02,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1371 transitions. [2020-10-16 05:08:02,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:02,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1371 transitions. [2020-10-16 05:08:02,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 16 states. [2020-10-16 05:08:02,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 16 states. [2020-10-16 05:08:02,081 INFO L81 ComplementDD]: Finished complementDD. Result 16 states. [2020-10-16 05:08:02,081 INFO L185 Difference]: Start difference. First operand has 130 places, 208 transitions, 3233 flow. Second operand 15 states and 1371 transitions. [2020-10-16 05:08:02,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 287 transitions, 4837 flow [2020-10-16 05:08:02,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 287 transitions, 4536 flow, removed 62 selfloop flow, removed 9 redundant places. [2020-10-16 05:08:02,142 INFO L241 Difference]: Finished difference. Result has 140 places, 242 transitions, 3724 flow [2020-10-16 05:08:02,143 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=3029, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3724, PETRI_PLACES=140, PETRI_TRANSITIONS=242} [2020-10-16 05:08:02,143 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2020-10-16 05:08:02,143 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 242 transitions, 3724 flow [2020-10-16 05:08:02,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-16 05:08:02,143 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:02,143 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:08:02,143 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 05:08:02,143 INFO L429 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:02,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:02,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1845418511, now seen corresponding path program 13 times [2020-10-16 05:08:02,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:02,144 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226856968] [2020-10-16 05:08:02,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:02,346 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:08:02,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226856968] [2020-10-16 05:08:02,347 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:02,347 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:08:02,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978896929] [2020-10-16 05:08:02,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:08:02,348 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:02,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:08:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:08:02,350 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 171 [2020-10-16 05:08:02,350 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 242 transitions, 3724 flow. Second operand 8 states. [2020-10-16 05:08:02,350 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:02,351 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 171 [2020-10-16 05:08:02,351 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:03,125 INFO L129 PetriNetUnfolder]: 437/1129 cut-off events. [2020-10-16 05:08:03,126 INFO L130 PetriNetUnfolder]: For 16437/17167 co-relation queries the response was YES. [2020-10-16 05:08:03,137 INFO L80 FinitePrefix]: Finished finitePrefix Result has 8419 conditions, 1129 events. 437/1129 cut-off events. For 16437/17167 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 8646 event pairs, 26 based on Foata normal form. 113/1232 useless extension candidates. Maximal degree in co-relation 8369. Up to 301 conditions per place. [2020-10-16 05:08:03,147 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 89 selfloop transitions, 69 changer transitions 56/283 dead transitions. [2020-10-16 05:08:03,148 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 283 transitions, 4708 flow [2020-10-16 05:08:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:08:03,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:08:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 884 transitions. [2020-10-16 05:08:03,226 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6461988304093568 [2020-10-16 05:08:03,226 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 884 transitions. [2020-10-16 05:08:03,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 884 transitions. [2020-10-16 05:08:03,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:03,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 884 transitions. [2020-10-16 05:08:03,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:08:03,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:08:03,230 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:08:03,230 INFO L185 Difference]: Start difference. First operand has 140 places, 242 transitions, 3724 flow. Second operand 8 states and 884 transitions. [2020-10-16 05:08:03,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 283 transitions, 4708 flow [2020-10-16 05:08:03,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 283 transitions, 4619 flow, removed 27 selfloop flow, removed 8 redundant places. [2020-10-16 05:08:03,343 INFO L241 Difference]: Finished difference. Result has 140 places, 221 transitions, 3528 flow [2020-10-16 05:08:03,343 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=3651, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3528, PETRI_PLACES=140, PETRI_TRANSITIONS=221} [2020-10-16 05:08:03,343 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 105 predicate places. [2020-10-16 05:08:03,344 INFO L481 AbstractCegarLoop]: Abstraction has has 140 places, 221 transitions, 3528 flow [2020-10-16 05:08:03,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:08:03,344 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:03,344 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:08:03,344 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 05:08:03,344 INFO L429 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:03,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:03,345 INFO L82 PathProgramCache]: Analyzing trace with hash -118688511, now seen corresponding path program 14 times [2020-10-16 05:08:03,345 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:03,348 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198897754] [2020-10-16 05:08:03,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:03,571 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:08:03,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198897754] [2020-10-16 05:08:03,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:03,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:08:03,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000150474] [2020-10-16 05:08:03,573 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:08:03,574 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:03,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:08:03,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:08:03,575 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 171 [2020-10-16 05:08:03,576 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 221 transitions, 3528 flow. Second operand 7 states. [2020-10-16 05:08:03,576 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:03,577 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 171 [2020-10-16 05:08:03,577 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:04,090 INFO L129 PetriNetUnfolder]: 363/937 cut-off events. [2020-10-16 05:08:04,090 INFO L130 PetriNetUnfolder]: For 15058/15497 co-relation queries the response was YES. [2020-10-16 05:08:04,096 INFO L80 FinitePrefix]: Finished finitePrefix Result has 7118 conditions, 937 events. 363/937 cut-off events. For 15058/15497 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 6801 event pairs, 21 based on Foata normal form. 67/995 useless extension candidates. Maximal degree in co-relation 7067. Up to 249 conditions per place. [2020-10-16 05:08:04,100 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 60 selfloop transitions, 89 changer transitions 15/233 dead transitions. [2020-10-16 05:08:04,100 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 233 transitions, 4023 flow [2020-10-16 05:08:04,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:08:04,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:08:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 784 transitions. [2020-10-16 05:08:04,103 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6549707602339181 [2020-10-16 05:08:04,103 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 784 transitions. [2020-10-16 05:08:04,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 784 transitions. [2020-10-16 05:08:04,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:04,104 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 784 transitions. [2020-10-16 05:08:04,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:08:04,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:08:04,107 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:08:04,107 INFO L185 Difference]: Start difference. First operand has 140 places, 221 transitions, 3528 flow. Second operand 7 states and 784 transitions. [2020-10-16 05:08:04,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 233 transitions, 4023 flow [2020-10-16 05:08:04,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 233 transitions, 3890 flow, removed 19 selfloop flow, removed 9 redundant places. [2020-10-16 05:08:04,182 INFO L241 Difference]: Finished difference. Result has 134 places, 216 transitions, 3547 flow [2020-10-16 05:08:04,182 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=3400, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3547, PETRI_PLACES=134, PETRI_TRANSITIONS=216} [2020-10-16 05:08:04,182 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 99 predicate places. [2020-10-16 05:08:04,182 INFO L481 AbstractCegarLoop]: Abstraction has has 134 places, 216 transitions, 3547 flow [2020-10-16 05:08:04,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:08:04,183 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:04,183 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:08:04,183 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 05:08:04,183 INFO L429 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:04,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1619962499, now seen corresponding path program 15 times [2020-10-16 05:08:04,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:04,184 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221222956] [2020-10-16 05:08:04,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:04,396 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:08:04,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221222956] [2020-10-16 05:08:04,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:04,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:08:04,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371812195] [2020-10-16 05:08:04,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:08:04,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:08:04,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:08:04,403 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 171 [2020-10-16 05:08:04,403 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 216 transitions, 3547 flow. Second operand 8 states. [2020-10-16 05:08:04,404 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:04,404 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 171 [2020-10-16 05:08:04,404 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:04,876 INFO L129 PetriNetUnfolder]: 325/884 cut-off events. [2020-10-16 05:08:04,876 INFO L130 PetriNetUnfolder]: For 14421/14706 co-relation queries the response was YES. [2020-10-16 05:08:04,882 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6757 conditions, 884 events. 325/884 cut-off events. For 14421/14706 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 6396 event pairs, 34 based on Foata normal form. 59/938 useless extension candidates. Maximal degree in co-relation 6710. Up to 341 conditions per place. [2020-10-16 05:08:04,885 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 105 selfloop transitions, 24 changer transitions 53/238 dead transitions. [2020-10-16 05:08:04,885 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 238 transitions, 4123 flow [2020-10-16 05:08:04,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:08:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:08:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 886 transitions. [2020-10-16 05:08:04,888 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6476608187134503 [2020-10-16 05:08:04,888 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 886 transitions. [2020-10-16 05:08:04,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 886 transitions. [2020-10-16 05:08:04,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:04,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 886 transitions. [2020-10-16 05:08:04,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:08:04,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:08:04,891 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:08:04,892 INFO L185 Difference]: Start difference. First operand has 134 places, 216 transitions, 3547 flow. Second operand 8 states and 886 transitions. [2020-10-16 05:08:04,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 238 transitions, 4123 flow [2020-10-16 05:08:04,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 238 transitions, 4009 flow, removed 14 selfloop flow, removed 6 redundant places. [2020-10-16 05:08:04,962 INFO L241 Difference]: Finished difference. Result has 138 places, 185 transitions, 2991 flow [2020-10-16 05:08:04,963 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=3441, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2991, PETRI_PLACES=138, PETRI_TRANSITIONS=185} [2020-10-16 05:08:04,963 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 103 predicate places. [2020-10-16 05:08:04,963 INFO L481 AbstractCegarLoop]: Abstraction has has 138 places, 185 transitions, 2991 flow [2020-10-16 05:08:04,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:08:04,963 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:04,963 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:08:04,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 05:08:04,964 INFO L429 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash -526565481, now seen corresponding path program 16 times [2020-10-16 05:08:04,964 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:04,964 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040267631] [2020-10-16 05:08:04,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:05,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:05,298 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:08:05,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040267631] [2020-10-16 05:08:05,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:05,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:08:05,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774099594] [2020-10-16 05:08:05,299 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:08:05,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:08:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:08:05,301 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 171 [2020-10-16 05:08:05,301 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 185 transitions, 2991 flow. Second operand 9 states. [2020-10-16 05:08:05,302 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:05,302 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 171 [2020-10-16 05:08:05,302 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:06,139 INFO L129 PetriNetUnfolder]: 300/818 cut-off events. [2020-10-16 05:08:06,139 INFO L130 PetriNetUnfolder]: For 12626/12851 co-relation queries the response was YES. [2020-10-16 05:08:06,144 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6208 conditions, 818 events. 300/818 cut-off events. For 12626/12851 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 5754 event pairs, 20 based on Foata normal form. 47/860 useless extension candidates. Maximal degree in co-relation 6162. Up to 220 conditions per place. [2020-10-16 05:08:06,147 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 48 selfloop transitions, 43 changer transitions 100/228 dead transitions. [2020-10-16 05:08:06,147 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 228 transitions, 3882 flow [2020-10-16 05:08:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 05:08:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 05:08:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1293 transitions. [2020-10-16 05:08:06,151 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6301169590643275 [2020-10-16 05:08:06,151 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1293 transitions. [2020-10-16 05:08:06,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1293 transitions. [2020-10-16 05:08:06,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:06,152 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1293 transitions. [2020-10-16 05:08:06,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 05:08:06,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 05:08:06,156 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 05:08:06,156 INFO L185 Difference]: Start difference. First operand has 138 places, 185 transitions, 2991 flow. Second operand 12 states and 1293 transitions. [2020-10-16 05:08:06,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 228 transitions, 3882 flow [2020-10-16 05:08:06,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 228 transitions, 3721 flow, removed 65 selfloop flow, removed 9 redundant places. [2020-10-16 05:08:06,236 INFO L241 Difference]: Finished difference. Result has 139 places, 121 transitions, 1904 flow [2020-10-16 05:08:06,236 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2873, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1904, PETRI_PLACES=139, PETRI_TRANSITIONS=121} [2020-10-16 05:08:06,237 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 104 predicate places. [2020-10-16 05:08:06,237 INFO L481 AbstractCegarLoop]: Abstraction has has 139 places, 121 transitions, 1904 flow [2020-10-16 05:08:06,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:08:06,237 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:06,237 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:08:06,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 05:08:06,238 INFO L429 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:06,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1795141687, now seen corresponding path program 17 times [2020-10-16 05:08:06,238 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:06,239 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281519880] [2020-10-16 05:08:06,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:06,470 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:08:06,471 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281519880] [2020-10-16 05:08:06,471 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:06,471 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:08:06,471 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430588283] [2020-10-16 05:08:06,471 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:08:06,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:06,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:08:06,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:08:06,473 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 171 [2020-10-16 05:08:06,474 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 121 transitions, 1904 flow. Second operand 8 states. [2020-10-16 05:08:06,474 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:06,474 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 171 [2020-10-16 05:08:06,474 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:06,858 INFO L129 PetriNetUnfolder]: 182/521 cut-off events. [2020-10-16 05:08:06,858 INFO L130 PetriNetUnfolder]: For 7880/7968 co-relation queries the response was YES. [2020-10-16 05:08:06,861 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3876 conditions, 521 events. 182/521 cut-off events. For 7880/7968 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3304 event pairs, 26 based on Foata normal form. 20/536 useless extension candidates. Maximal degree in co-relation 3831. Up to 148 conditions per place. [2020-10-16 05:08:06,862 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 50 selfloop transitions, 24 changer transitions 27/137 dead transitions. [2020-10-16 05:08:06,862 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 137 transitions, 2279 flow [2020-10-16 05:08:06,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:08:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:08:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 792 transitions. [2020-10-16 05:08:06,864 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6616541353383458 [2020-10-16 05:08:06,864 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 792 transitions. [2020-10-16 05:08:06,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 792 transitions. [2020-10-16 05:08:06,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:06,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 792 transitions. [2020-10-16 05:08:06,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:08:06,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:08:06,866 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:08:06,866 INFO L185 Difference]: Start difference. First operand has 139 places, 121 transitions, 1904 flow. Second operand 7 states and 792 transitions. [2020-10-16 05:08:06,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 137 transitions, 2279 flow [2020-10-16 05:08:06,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 137 transitions, 1943 flow, removed 41 selfloop flow, removed 26 redundant places. [2020-10-16 05:08:06,890 INFO L241 Difference]: Finished difference. Result has 109 places, 108 transitions, 1439 flow [2020-10-16 05:08:06,890 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1598, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1439, PETRI_PLACES=109, PETRI_TRANSITIONS=108} [2020-10-16 05:08:06,891 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 74 predicate places. [2020-10-16 05:08:06,891 INFO L481 AbstractCegarLoop]: Abstraction has has 109 places, 108 transitions, 1439 flow [2020-10-16 05:08:06,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:08:06,891 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:06,892 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:08:06,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-10-16 05:08:06,892 INFO L429 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:06,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:06,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1458733955, now seen corresponding path program 18 times [2020-10-16 05:08:06,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:06,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017396167] [2020-10-16 05:08:06,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:06,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:07,170 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:08:07,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017396167] [2020-10-16 05:08:07,171 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:07,171 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:08:07,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429781966] [2020-10-16 05:08:07,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:08:07,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:07,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:08:07,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:08:07,173 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 171 [2020-10-16 05:08:07,174 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 108 transitions, 1439 flow. Second operand 9 states. [2020-10-16 05:08:07,174 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:07,174 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 171 [2020-10-16 05:08:07,174 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:07,643 INFO L129 PetriNetUnfolder]: 160/446 cut-off events. [2020-10-16 05:08:07,643 INFO L130 PetriNetUnfolder]: For 4439/4481 co-relation queries the response was YES. [2020-10-16 05:08:07,645 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 446 events. 160/446 cut-off events. For 4439/4481 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 2758 event pairs, 7 based on Foata normal form. 7/452 useless extension candidates. Maximal degree in co-relation 2840. Up to 136 conditions per place. [2020-10-16 05:08:07,647 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 29 selfloop transitions, 38 changer transitions 40/142 dead transitions. [2020-10-16 05:08:07,647 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 142 transitions, 2058 flow [2020-10-16 05:08:07,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:08:07,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:08:07,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1065 transitions. [2020-10-16 05:08:07,655 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6228070175438597 [2020-10-16 05:08:07,655 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1065 transitions. [2020-10-16 05:08:07,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1065 transitions. [2020-10-16 05:08:07,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:07,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1065 transitions. [2020-10-16 05:08:07,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:08:07,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:08:07,659 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:08:07,659 INFO L185 Difference]: Start difference. First operand has 109 places, 108 transitions, 1439 flow. Second operand 10 states and 1065 transitions. [2020-10-16 05:08:07,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 142 transitions, 2058 flow [2020-10-16 05:08:07,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 142 transitions, 1872 flow, removed 15 selfloop flow, removed 13 redundant places. [2020-10-16 05:08:07,681 INFO L241 Difference]: Finished difference. Result has 105 places, 97 transitions, 1237 flow [2020-10-16 05:08:07,682 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1291, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1237, PETRI_PLACES=105, PETRI_TRANSITIONS=97} [2020-10-16 05:08:07,682 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 70 predicate places. [2020-10-16 05:08:07,682 INFO L481 AbstractCegarLoop]: Abstraction has has 105 places, 97 transitions, 1237 flow [2020-10-16 05:08:07,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:08:07,682 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:07,682 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:08:07,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-10-16 05:08:07,683 INFO L429 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 05:08:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash -983282967, now seen corresponding path program 19 times [2020-10-16 05:08:07,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:07,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020586363] [2020-10-16 05:08:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:08:07,769 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:08:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:08:07,877 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:08:07,961 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:08:07,961 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:08:07,961 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-10-16 05:08:08,005 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:08:08,005 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,014 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:08:08,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,015 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:08:08,015 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,015 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:08:08,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,016 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:08:08,016 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,017 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:08:08,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,017 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:08:08,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,017 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:08:08,017 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,018 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:08:08,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,018 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:08:08,018 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,019 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:08:08,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,019 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:08:08,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,019 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:08:08,019 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,019 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:08:08,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,020 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:08:08,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,020 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:08:08,020 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,021 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:08:08,021 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,028 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:08:08,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,028 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:08:08,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,029 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:08:08,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,029 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:08:08,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,030 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:08:08,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,031 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:08:08,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,031 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:08:08,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,032 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:08:08,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,032 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:08:08,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,033 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:08:08,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,033 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:08:08,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,034 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:08:08,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,034 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:08:08,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,035 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:08:08,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,036 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:08:08,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,036 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:08:08,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,037 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:08:08,037 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,037 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:08:08,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,038 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:08:08,038 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,038 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:08:08,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,039 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:08:08,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,039 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:08:08,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,040 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:08:08,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,040 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:08:08,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,041 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:08:08,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,041 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:08:08,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,042 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:08:08,042 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,043 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:08:08,043 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,044 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:08:08,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,044 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:08:08,044 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,045 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:08:08,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,045 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:08:08,045 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,046 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:08:08,046 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,046 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:08:08,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,047 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:08:08,047 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,047 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:08:08,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,048 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:08:08,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,048 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:08:08,048 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,049 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:08:08,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,049 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:08:08,049 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,050 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:08:08,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,050 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:08:08,050 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,051 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:08:08,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,051 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:08:08,051 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,052 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:08:08,052 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:08,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:08:08 BasicIcfg [2020-10-16 05:08:08,207 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:08:08,212 INFO L168 Benchmark]: Toolchain (without parser) took 40612.27 ms. Allocated memory was 253.2 MB in the beginning and 1.1 GB in the end (delta: 858.8 MB). Free memory was 206.5 MB in the beginning and 667.1 MB in the end (delta: -460.6 MB). Peak memory consumption was 398.2 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:08,212 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:08:08,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 825.50 ms. Allocated memory was 253.2 MB in the beginning and 319.3 MB in the end (delta: 66.1 MB). Free memory was 206.5 MB in the beginning and 262.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:08,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.50 ms. Allocated memory is still 319.3 MB. Free memory was 262.5 MB in the beginning and 259.9 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:08:08,214 INFO L168 Benchmark]: Boogie Preprocessor took 49.65 ms. Allocated memory is still 319.3 MB. Free memory was 259.9 MB in the beginning and 257.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:08,215 INFO L168 Benchmark]: RCFGBuilder took 3786.41 ms. Allocated memory was 319.3 MB in the beginning and 428.9 MB in the end (delta: 109.6 MB). Free memory was 257.4 MB in the beginning and 354.0 MB in the end (delta: -96.6 MB). Peak memory consumption was 151.3 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:08,216 INFO L168 Benchmark]: TraceAbstraction took 35876.20 ms. Allocated memory was 428.9 MB in the beginning and 1.1 GB in the end (delta: 683.1 MB). Free memory was 354.0 MB in the beginning and 667.1 MB in the end (delta: -313.1 MB). Peak memory consumption was 370.1 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:08,223 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.19 ms. Allocated memory is still 253.2 MB. Free memory is still 227.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 825.50 ms. Allocated memory was 253.2 MB in the beginning and 319.3 MB in the end (delta: 66.1 MB). Free memory was 206.5 MB in the beginning and 262.5 MB in the end (delta: -56.0 MB). Peak memory consumption was 30.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.50 ms. Allocated memory is still 319.3 MB. Free memory was 262.5 MB in the beginning and 259.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 49.65 ms. Allocated memory is still 319.3 MB. Free memory was 259.9 MB in the beginning and 257.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3786.41 ms. Allocated memory was 319.3 MB in the beginning and 428.9 MB in the end (delta: 109.6 MB). Free memory was 257.4 MB in the beginning and 354.0 MB in the end (delta: -96.6 MB). Peak memory consumption was 151.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 35876.20 ms. Allocated memory was 428.9 MB in the beginning and 1.1 GB in the end (delta: 683.1 MB). Free memory was 354.0 MB in the beginning and 667.1 MB in the end (delta: -313.1 MB). Peak memory consumption was 370.1 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 972 VarBasedMoverChecksPositive, 65 VarBasedMoverChecksNegative, 24 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 94 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.0s, 99 PlacesBefore, 35 PlacesAfterwards, 91 TransitionsBefore, 26 TransitionsAfterwards, 1740 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 77 TotalNumberOfCompositions, 5549 MoverChecksTotal - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L712] 0 _Bool y$flush_delayed; [L713] 0 int y$mem_tmp; [L714] 0 _Bool y$r_buff0_thd0; [L715] 0 _Bool y$r_buff0_thd1; [L716] 0 _Bool y$r_buff0_thd2; [L717] 0 _Bool y$r_buff0_thd3; [L718] 0 _Bool y$r_buff1_thd0; [L719] 0 _Bool y$r_buff1_thd1; [L720] 0 _Bool y$r_buff1_thd2; [L721] 0 _Bool y$r_buff1_thd3; [L722] 0 _Bool y$read_delayed; [L723] 0 int *y$read_delayed_var; [L724] 0 int y$w_buff0; [L725] 0 _Bool y$w_buff0_used; [L726] 0 int y$w_buff1; [L727] 0 _Bool y$w_buff1_used; [L728] 0 _Bool weak$$choice0; [L729] 0 _Bool weak$$choice2; [L843] 0 pthread_t t2324; [L844] FCALL, FORK 0 pthread_create(&t2324, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L845] 0 pthread_t t2325; [L846] FCALL, FORK 0 pthread_create(&t2325, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L773] 2 y$w_buff1 = y$w_buff0 [L774] 2 y$w_buff0 = 2 [L775] 2 y$w_buff1_used = y$w_buff0_used [L776] 2 y$w_buff0_used = (_Bool)1 [L8] COND FALSE 2 !(!expression) [L778] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L779] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L780] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L781] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L782] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L785] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L847] 0 pthread_t t2326; [L848] FCALL, FORK 0 pthread_create(&t2326, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0: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=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L802] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 y$flush_delayed = weak$$choice2 [L808] 3 y$mem_tmp = y [L809] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L809] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L810] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L810] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L811] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L811] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L812] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L814] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = y [L817] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L817] 3 y = y$flush_delayed ? y$mem_tmp : y [L818] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L821] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L821] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L821] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L822] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L823] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L824] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L825] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L733] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L736] 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) [L736] 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) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L738] 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 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L740] 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 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L743] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L744] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L745] 1 y$flush_delayed = weak$$choice2 [L746] 1 y$mem_tmp = y [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L747] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L748] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L749] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used) [L750] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L751] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L752] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L753] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] 1 __unbuffered_p0_EAX = y [L755] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L755] 1 y = y$flush_delayed ? y$mem_tmp : y [L756] 1 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L759] 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) [L759] 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) [L760] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L761] 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 [L762] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L762] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L763] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L763] 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 [L788] 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) [L788] 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) [L789] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L790] 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 [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L792] 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 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L854] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L854] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L856] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L858] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 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) [L865] 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) [L866] 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)) [L866] 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)) [L867] 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)) [L867] 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)) [L868] 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)) [L868] EXPR 0 !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) [L868] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] EXPR 0 !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) [L868] 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)) [L868] 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)) [L869] 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)) [L869] 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_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L869] 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_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L869] 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)) [L869] 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)) [L870] 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)) [L870] 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) [L870] 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)) [L870] 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)) [L871] 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)) [L871] 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)) [L872] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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 4 procedures, 93 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: 35.4s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 20.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 159 SDtfs, 240 SDslu, 430 SDs, 0 SdLazy, 3720 SolverSat, 887 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 299 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 613 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3724occurred in iteration=20, 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.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 499 ConstructedInterpolants, 0 QuantifiedInterpolants, 152522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...