/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_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 05:07:32,302 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 05:07:32,303 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 05:07:32,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 05:07:32,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 05:07:32,329 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 05:07:32,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 05:07:32,332 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 05:07:32,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 05:07:32,334 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 05:07:32,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 05:07:32,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 05:07:32,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 05:07:32,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 05:07:32,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 05:07:32,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 05:07:32,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 05:07:32,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 05:07:32,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 05:07:32,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 05:07:32,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 05:07:32,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 05:07:32,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 05:07:32,350 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 05:07:32,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 05:07:32,353 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 05:07:32,353 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 05:07:32,354 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 05:07:32,354 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 05:07:32,355 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 05:07:32,355 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 05:07:32,356 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 05:07:32,357 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 05:07:32,357 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 05:07:32,364 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 05:07:32,364 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 05:07:32,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 05:07:32,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 05:07:32,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 05:07:32,366 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 05:07:32,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 05:07:32,367 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:32,390 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 05:07:32,390 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 05:07:32,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 05:07:32,392 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 05:07:32,392 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 05:07:32,392 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 05:07:32,392 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 05:07:32,393 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 05:07:32,393 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 05:07:32,393 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 05:07:32,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 05:07:32,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 05:07:32,394 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 05:07:32,394 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 05:07:32,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 05:07:32,394 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 05:07:32,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 05:07:32,395 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 05:07:32,395 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 05:07:32,395 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 05:07:32,395 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 05:07:32,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 05:07:32,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 05:07:32,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 05:07:32,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 05:07:32,396 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 05:07:32,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 05:07:32,397 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 05:07:32,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 05:07:32,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 05:07:32,684 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 05:07:32,688 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 05:07:32,690 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 05:07:32,690 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 05:07:32,691 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2020-10-16 05:07:32,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09aec2f4/a30bc475b97545c48a70e90c5353aee5/FLAG033aee190 [2020-10-16 05:07:33,354 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 05:07:33,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe023_rmo.opt.i [2020-10-16 05:07:33,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09aec2f4/a30bc475b97545c48a70e90c5353aee5/FLAG033aee190 [2020-10-16 05:07:33,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f09aec2f4/a30bc475b97545c48a70e90c5353aee5 [2020-10-16 05:07:33,679 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 05:07:33,682 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 05:07:33,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 05:07:33,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 05:07:33,686 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 05:07:33,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:07:33" (1/1) ... [2020-10-16 05:07:33,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d189d44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:33, skipping insertion in model container [2020-10-16 05:07:33,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 05:07:33" (1/1) ... [2020-10-16 05:07:33,699 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 05:07:33,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 05:07:34,274 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:07:34,300 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 05:07:34,401 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 05:07:34,479 INFO L208 MainTranslator]: Completed translation [2020-10-16 05:07:34,479 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:34 WrapperNode [2020-10-16 05:07:34,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 05:07:34,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 05:07:34,481 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 05:07:34,481 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 05:07:34,490 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:34" (1/1) ... [2020-10-16 05:07:34,513 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:34" (1/1) ... [2020-10-16 05:07:34,557 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 05:07:34,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 05:07:34,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 05:07:34,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 05:07:34,568 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:34" (1/1) ... [2020-10-16 05:07:34,569 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:34" (1/1) ... [2020-10-16 05:07:34,575 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:34" (1/1) ... [2020-10-16 05:07:34,575 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:34" (1/1) ... [2020-10-16 05:07:34,591 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:34" (1/1) ... [2020-10-16 05:07:34,597 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:34" (1/1) ... [2020-10-16 05:07:34,603 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:34" (1/1) ... [2020-10-16 05:07:34,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 05:07:34,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 05:07:34,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 05:07:34,618 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 05:07:34,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:34" (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:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 05:07:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 05:07:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 05:07:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 05:07:34,718 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 05:07:34,720 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 05:07:34,720 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 05:07:34,721 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 05:07:34,722 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 05:07:34,722 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 05:07:34,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 05:07:34,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 05:07:34,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 05:07:34,728 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:38,537 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 05:07:38,538 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 05:07:38,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:07:38 BoogieIcfgContainer [2020-10-16 05:07:38,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 05:07:38,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 05:07:38,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 05:07:38,547 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 05:07:38,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 05:07:33" (1/3) ... [2020-10-16 05:07:38,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277cdff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:07:38, skipping insertion in model container [2020-10-16 05:07:38,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 05:07:34" (2/3) ... [2020-10-16 05:07:38,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@277cdff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 05:07:38, skipping insertion in model container [2020-10-16 05:07:38,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 05:07:38" (3/3) ... [2020-10-16 05:07:38,552 INFO L111 eAbstractionObserver]: Analyzing ICFG safe023_rmo.opt.i [2020-10-16 05:07:38,570 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 05:07:38,581 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 05:07:38,583 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 05:07:38,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,644 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,644 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,645 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,645 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,646 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,647 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,647 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,648 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,649 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,650 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,651 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,652 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,656 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,657 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,659 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,660 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,661 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,662 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,662 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,663 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,663 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,664 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:38,664 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,665 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:38,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,665 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,666 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,667 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,668 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,668 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,669 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,669 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,670 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,671 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,672 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,673 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,674 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,675 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,676 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,677 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,678 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,679 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,683 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,684 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,684 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,684 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:38,684 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,693 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,694 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,695 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,696 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,696 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,697 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,698 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,698 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,699 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,700 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,701 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,702 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,707 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,708 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,709 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,709 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,710 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,710 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,711 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,712 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,713 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,714 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,715 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,716 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,717 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,718 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 05:07:38,746 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 05:07:38,779 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 05:07:38,779 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 05:07:38,780 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 05:07:38,780 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 05:07:38,780 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 05:07:38,780 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 05:07:38,781 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 05:07:38,781 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 05:07:38,800 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 05:07:38,858 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 05:07:38,858 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:38,864 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:38,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 94 transitions, 203 flow [2020-10-16 05:07:38,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:38,876 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 05:07:38,880 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:38,883 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:38,883 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 99 places, 91 transitions, 191 flow [2020-10-16 05:07:38,911 INFO L129 PetriNetUnfolder]: 2/91 cut-off events. [2020-10-16 05:07:38,911 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:38,912 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:38,915 INFO L117 LiptonReduction]: Number of co-enabled transitions 1740 [2020-10-16 05:07:39,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:39,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:39,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:39,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,196 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,202 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:39,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,205 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,231 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:39,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:39,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:39,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,380 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:39,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,382 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:39,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:39,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:39,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:39,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:39,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,470 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:39,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,474 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,494 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,497 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:39,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,587 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:39,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:39,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:39,613 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:39,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:39,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:39,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:39,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,091 WARN L193 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 05:07:40,198 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 05:07:40,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:40,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:40,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:40,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,397 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,662 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 05:07:40,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,675 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:40,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,712 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,715 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:40,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,864 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:40,871 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:40,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,873 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:40,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,875 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:40,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:40,931 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:40,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:40,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:40,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:40,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:40,991 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:40,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:40,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:40,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:41,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:41,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:41,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,026 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:41,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:41,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:41,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:41,139 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 05:07:41,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,329 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:07:41,453 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 05:07:41,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:41,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:41,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,493 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:41,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:41,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:41,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:41,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:41,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,516 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:41,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,518 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:41,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:41,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:41,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:41,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:41,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:41,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:41,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:41,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:41,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:41,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:41,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:41,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:41,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:41,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:41,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:41,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:41,860 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:41,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:41,862 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:41,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:41,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:41,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:41,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-16 05:07:41,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:41,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:41,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:41,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:41,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:41,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-16 05:07:41,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:41,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-16 05:07:41,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:41,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-16 05:07:41,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:41,981 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:41,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:41,983 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:41,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:42,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:42,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,125 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:42,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:42,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,142 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:42,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:42,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,146 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:42,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:42,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:42,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:42,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 05:07:42,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 05:07:42,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-16 05:07:42,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-16 05:07:42,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:07:42,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:42,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:42,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-10-16 05:07:42,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,263 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:42,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:42,265 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:42,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:42,267 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:42,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 05:07:42,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 4, 5, 3, 3, 2, 1] term [2020-10-16 05:07:42,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,271 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:42,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,274 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:42,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:42,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:42,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,385 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:42,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:42,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:42,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 05:07:42,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:42,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,399 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 05:07:42,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 05:07:42,401 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:42,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:42,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-16 05:07:42,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 05:07:43,150 WARN L193 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 05:07:43,258 WARN L193 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 05:07:43,266 INFO L132 LiptonReduction]: Checked pairs total: 5549 [2020-10-16 05:07:43,267 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 05:07:43,282 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 4409 [2020-10-16 05:07:43,344 INFO L129 PetriNetUnfolder]: 0/9 cut-off events. [2020-10-16 05:07:43,345 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:43,345 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:43,346 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 05:07:43,346 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:43,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1712567520, now seen corresponding path program 1 times [2020-10-16 05:07:43,363 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:43,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884232800] [2020-10-16 05:07:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:43,585 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:43,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884232800] [2020-10-16 05:07:43,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:43,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 05:07:43,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898725030] [2020-10-16 05:07:43,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 05:07:43,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:43,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 05:07:43,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 05:07:43,615 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:43,617 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states. [2020-10-16 05:07:43,617 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:43,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:43,619 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:43,840 INFO L129 PetriNetUnfolder]: 190/405 cut-off events. [2020-10-16 05:07:43,840 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:43,842 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:43,848 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 15 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2020-10-16 05:07:43,848 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 105 flow [2020-10-16 05:07:43,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 05:07:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 05:07:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2020-10-16 05:07:43,868 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8576998050682261 [2020-10-16 05:07:43,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2020-10-16 05:07:43,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2020-10-16 05:07:43,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:43,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2020-10-16 05:07:43,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 05:07:43,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 05:07:43,887 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 05:07:43,890 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:43,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 105 flow [2020-10-16 05:07:43,894 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:43,896 INFO L241 Difference]: Finished difference. Result has 33 places, 24 transitions, 58 flow [2020-10-16 05:07:43,899 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:43,900 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2020-10-16 05:07:43,901 INFO L481 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 58 flow [2020-10-16 05:07:43,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 05:07:43,901 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:43,901 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:43,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 05:07:43,902 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:43,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:43,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1739866846, now seen corresponding path program 1 times [2020-10-16 05:07:43,902 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:43,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287866137] [2020-10-16 05:07:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:44,073 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:44,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287866137] [2020-10-16 05:07:44,073 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:44,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 05:07:44,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412745838] [2020-10-16 05:07:44,075 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:07:44,076 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:07:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:07:44,078 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 171 [2020-10-16 05:07:44,079 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 58 flow. Second operand 4 states. [2020-10-16 05:07:44,079 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:44,079 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 171 [2020-10-16 05:07:44,079 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:44,129 INFO L129 PetriNetUnfolder]: 1/35 cut-off events. [2020-10-16 05:07:44,129 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 05:07:44,129 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:44,130 INFO L132 encePairwiseOnDemand]: 167/171 looper letters, 2 selfloop transitions, 2 changer transitions 5/28 dead transitions. [2020-10-16 05:07:44,130 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 28 transitions, 84 flow [2020-10-16 05:07:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:07:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:07:44,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 701 transitions. [2020-10-16 05:07:44,135 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8198830409356725 [2020-10-16 05:07:44,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 701 transitions. [2020-10-16 05:07:44,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 701 transitions. [2020-10-16 05:07:44,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:44,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 701 transitions. [2020-10-16 05:07:44,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:07:44,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:07:44,140 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:07:44,140 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:44,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 28 transitions, 84 flow [2020-10-16 05:07:44,141 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:44,142 INFO L241 Difference]: Finished difference. Result has 38 places, 23 transitions, 64 flow [2020-10-16 05:07:44,142 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:44,143 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2020-10-16 05:07:44,143 INFO L481 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 64 flow [2020-10-16 05:07:44,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:07:44,143 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:44,144 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:44,144 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 05:07:44,144 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:44,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:44,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1859395228, now seen corresponding path program 1 times [2020-10-16 05:07:44,145 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:44,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901828251] [2020-10-16 05:07:44,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:44,259 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:44,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901828251] [2020-10-16 05:07:44,259 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:44,260 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:07:44,260 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3797609] [2020-10-16 05:07:44,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:07:44,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:44,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:07:44,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:07:44,263 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 171 [2020-10-16 05:07:44,263 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 64 flow. Second operand 5 states. [2020-10-16 05:07:44,264 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:44,264 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 171 [2020-10-16 05:07:44,264 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:44,394 INFO L129 PetriNetUnfolder]: 65/141 cut-off events. [2020-10-16 05:07:44,395 INFO L130 PetriNetUnfolder]: For 54/54 co-relation queries the response was YES. [2020-10-16 05:07:44,395 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:44,397 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 10 selfloop transitions, 5 changer transitions 11/41 dead transitions. [2020-10-16 05:07:44,397 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 41 transitions, 156 flow [2020-10-16 05:07:44,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:44,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2020-10-16 05:07:44,401 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7669172932330827 [2020-10-16 05:07:44,401 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2020-10-16 05:07:44,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2020-10-16 05:07:44,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:44,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2020-10-16 05:07:44,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:44,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:44,406 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:44,407 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:44,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 41 transitions, 156 flow [2020-10-16 05:07:44,408 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:44,409 INFO L241 Difference]: Finished difference. Result has 42 places, 26 transitions, 97 flow [2020-10-16 05:07:44,409 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:44,409 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2020-10-16 05:07:44,409 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 26 transitions, 97 flow [2020-10-16 05:07:44,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:07:44,410 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:44,410 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 05:07:44,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 05:07:44,410 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:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:44,411 INFO L82 PathProgramCache]: Analyzing trace with hash -447025861, now seen corresponding path program 1 times [2020-10-16 05:07:44,411 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:44,411 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567294290] [2020-10-16 05:07:44,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:44,582 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:44,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567294290] [2020-10-16 05:07:44,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:44,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:07:44,583 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088832851] [2020-10-16 05:07:44,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:07:44,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:07:44,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:07:44,587 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 171 [2020-10-16 05:07:44,588 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 26 transitions, 97 flow. Second operand 5 states. [2020-10-16 05:07:44,588 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:44,588 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 171 [2020-10-16 05:07:44,588 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:44,676 INFO L129 PetriNetUnfolder]: 23/73 cut-off events. [2020-10-16 05:07:44,676 INFO L130 PetriNetUnfolder]: For 120/128 co-relation queries the response was YES. [2020-10-16 05:07:44,677 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:44,678 INFO L132 encePairwiseOnDemand]: 166/171 looper letters, 2 selfloop transitions, 3 changer transitions 4/30 dead transitions. [2020-10-16 05:07:44,678 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 136 flow [2020-10-16 05:07:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 05:07:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 05:07:44,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 827 transitions. [2020-10-16 05:07:44,681 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8060428849902534 [2020-10-16 05:07:44,681 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 827 transitions. [2020-10-16 05:07:44,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 827 transitions. [2020-10-16 05:07:44,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:44,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 827 transitions. [2020-10-16 05:07:44,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 05:07:44,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 05:07:44,686 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 05:07:44,686 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:44,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 136 flow [2020-10-16 05:07:44,688 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:44,689 INFO L241 Difference]: Finished difference. Result has 45 places, 26 transitions, 108 flow [2020-10-16 05:07:44,689 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:44,690 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2020-10-16 05:07:44,690 INFO L481 AbstractCegarLoop]: Abstraction has has 45 places, 26 transitions, 108 flow [2020-10-16 05:07:44,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:07:44,690 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:44,690 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:44,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 05:07:44,690 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:44,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:44,691 INFO L82 PathProgramCache]: Analyzing trace with hash -833723287, now seen corresponding path program 1 times [2020-10-16 05:07:44,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:44,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132041783] [2020-10-16 05:07:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:45,017 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,017 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132041783] [2020-10-16 05:07:45,017 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:45,018 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:45,018 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570874273] [2020-10-16 05:07:45,018 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:45,018 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:45,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:45,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:45,022 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 171 [2020-10-16 05:07:45,023 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 26 transitions, 108 flow. Second operand 9 states. [2020-10-16 05:07:45,023 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:45,023 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 171 [2020-10-16 05:07:45,023 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:45,740 INFO L129 PetriNetUnfolder]: 399/776 cut-off events. [2020-10-16 05:07:45,741 INFO L130 PetriNetUnfolder]: For 1733/1760 co-relation queries the response was YES. [2020-10-16 05:07:45,745 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:45,750 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 20 selfloop transitions, 14 changer transitions 14/61 dead transitions. [2020-10-16 05:07:45,750 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 300 flow [2020-10-16 05:07:45,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:07:45,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:07:45,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1129 transitions. [2020-10-16 05:07:45,755 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.660233918128655 [2020-10-16 05:07:45,755 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1129 transitions. [2020-10-16 05:07:45,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1129 transitions. [2020-10-16 05:07:45,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:45,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1129 transitions. [2020-10-16 05:07:45,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:07:45,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:07:45,763 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:07:45,763 INFO L185 Difference]: Start difference. First operand has 45 places, 26 transitions, 108 flow. Second operand 10 states and 1129 transitions. [2020-10-16 05:07:45,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 300 flow [2020-10-16 05:07:45,770 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:45,771 INFO L241 Difference]: Finished difference. Result has 52 places, 37 transitions, 188 flow [2020-10-16 05:07:45,772 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:45,772 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2020-10-16 05:07:45,772 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 37 transitions, 188 flow [2020-10-16 05:07:45,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:45,773 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:45,773 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:45,773 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 05:07:45,773 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:45,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:45,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1829453121, now seen corresponding path program 1 times [2020-10-16 05:07:45,774 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:45,774 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001501433] [2020-10-16 05:07:45,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:45,892 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,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001501433] [2020-10-16 05:07:45,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:45,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 05:07:45,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282021171] [2020-10-16 05:07:45,894 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 05:07:45,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:45,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 05:07:45,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 05:07:45,897 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:45,898 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 37 transitions, 188 flow. Second operand 4 states. [2020-10-16 05:07:45,898 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:45,898 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:45,898 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:46,016 INFO L129 PetriNetUnfolder]: 202/496 cut-off events. [2020-10-16 05:07:46,016 INFO L130 PetriNetUnfolder]: For 705/796 co-relation queries the response was YES. [2020-10-16 05:07:46,020 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:46,022 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 8 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2020-10-16 05:07:46,023 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 49 transitions, 284 flow [2020-10-16 05:07:46,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 05:07:46,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 05:07:46,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2020-10-16 05:07:46,026 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.839766081871345 [2020-10-16 05:07:46,026 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2020-10-16 05:07:46,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2020-10-16 05:07:46,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:46,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2020-10-16 05:07:46,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 05:07:46,030 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 05:07:46,031 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 05:07:46,031 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:46,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 49 transitions, 284 flow [2020-10-16 05:07:46,037 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:46,038 INFO L241 Difference]: Finished difference. Result has 52 places, 46 transitions, 283 flow [2020-10-16 05:07:46,038 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:46,039 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 17 predicate places. [2020-10-16 05:07:46,039 INFO L481 AbstractCegarLoop]: Abstraction has has 52 places, 46 transitions, 283 flow [2020-10-16 05:07:46,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 05:07:46,039 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:46,039 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:46,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 05:07:46,040 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:46,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:46,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1415080601, now seen corresponding path program 1 times [2020-10-16 05:07:46,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:46,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541168658] [2020-10-16 05:07:46,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:46,172 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,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541168658] [2020-10-16 05:07:46,173 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:46,173 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 05:07:46,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646605475] [2020-10-16 05:07:46,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 05:07:46,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:46,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 05:07:46,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 05:07:46,176 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:46,176 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 46 transitions, 283 flow. Second operand 5 states. [2020-10-16 05:07:46,177 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:46,177 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:46,177 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:46,304 INFO L129 PetriNetUnfolder]: 143/417 cut-off events. [2020-10-16 05:07:46,304 INFO L130 PetriNetUnfolder]: For 1375/1780 co-relation queries the response was YES. [2020-10-16 05:07:46,307 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:46,309 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 5 selfloop transitions, 19 changer transitions 3/56 dead transitions. [2020-10-16 05:07:46,310 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 419 flow [2020-10-16 05:07:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:46,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1005 transitions. [2020-10-16 05:07:46,313 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8395989974937343 [2020-10-16 05:07:46,314 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1005 transitions. [2020-10-16 05:07:46,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1005 transitions. [2020-10-16 05:07:46,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:46,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1005 transitions. [2020-10-16 05:07:46,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:46,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:46,319 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:46,319 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:46,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 419 flow [2020-10-16 05:07:46,323 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:46,325 INFO L241 Difference]: Finished difference. Result has 60 places, 53 transitions, 396 flow [2020-10-16 05:07:46,325 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:46,325 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 25 predicate places. [2020-10-16 05:07:46,325 INFO L481 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 396 flow [2020-10-16 05:07:46,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 05:07:46,325 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:46,326 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:46,326 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 05:07:46,326 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:46,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:46,326 INFO L82 PathProgramCache]: Analyzing trace with hash 625146234, now seen corresponding path program 1 times [2020-10-16 05:07:46,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:46,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980399899] [2020-10-16 05:07:46,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:46,460 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,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980399899] [2020-10-16 05:07:46,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:46,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:46,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484547114] [2020-10-16 05:07:46,462 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:07:46,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:46,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:07:46,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:07:46,464 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 171 [2020-10-16 05:07:46,465 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 396 flow. Second operand 6 states. [2020-10-16 05:07:46,465 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:46,465 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 171 [2020-10-16 05:07:46,465 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:46,636 INFO L129 PetriNetUnfolder]: 112/357 cut-off events. [2020-10-16 05:07:46,636 INFO L130 PetriNetUnfolder]: For 2183/2654 co-relation queries the response was YES. [2020-10-16 05:07:46,639 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:46,641 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 2 selfloop transitions, 23 changer transitions 3/57 dead transitions. [2020-10-16 05:07:46,642 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 490 flow [2020-10-16 05:07:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:07:46,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:07:46,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2020-10-16 05:07:46,648 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8356075373619233 [2020-10-16 05:07:46,648 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2020-10-16 05:07:46,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2020-10-16 05:07:46,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:46,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2020-10-16 05:07:46,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:07:46,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:07:46,657 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:07:46,657 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:46,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 490 flow [2020-10-16 05:07:46,670 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:46,675 INFO L241 Difference]: Finished difference. Result has 67 places, 54 transitions, 394 flow [2020-10-16 05:07:46,675 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:46,676 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 32 predicate places. [2020-10-16 05:07:46,676 INFO L481 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 394 flow [2020-10-16 05:07:46,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:07:46,676 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:46,676 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,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 05:07:46,677 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:46,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:46,677 INFO L82 PathProgramCache]: Analyzing trace with hash -114906297, now seen corresponding path program 1 times [2020-10-16 05:07:46,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:46,678 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258310955] [2020-10-16 05:07:46,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:47,507 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:47,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258310955] [2020-10-16 05:07:47,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:47,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:07:47,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566619154] [2020-10-16 05:07:47,508 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:07:47,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:47,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:07:47,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:07:47,512 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 171 [2020-10-16 05:07:47,513 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 394 flow. Second operand 10 states. [2020-10-16 05:07:47,513 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:47,513 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 171 [2020-10-16 05:07:47,513 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:48,320 INFO L129 PetriNetUnfolder]: 200/590 cut-off events. [2020-10-16 05:07:48,321 INFO L130 PetriNetUnfolder]: For 3460/3741 co-relation queries the response was YES. [2020-10-16 05:07:48,324 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2416 conditions, 590 events. 200/590 cut-off events. For 3460/3741 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 4313 event pairs, 7 based on Foata normal form. 117/687 useless extension candidates. Maximal degree in co-relation 2389. Up to 145 conditions per place. [2020-10-16 05:07:48,328 INFO L132 encePairwiseOnDemand]: 163/171 looper letters, 31 selfloop transitions, 21 changer transitions 9/91 dead transitions. [2020-10-16 05:07:48,328 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 91 transitions, 709 flow [2020-10-16 05:07:48,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-16 05:07:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-10-16 05:07:48,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1130 transitions. [2020-10-16 05:07:48,332 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6007442849548112 [2020-10-16 05:07:48,333 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1130 transitions. [2020-10-16 05:07:48,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1130 transitions. [2020-10-16 05:07:48,334 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:48,334 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1130 transitions. [2020-10-16 05:07:48,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 12 states. [2020-10-16 05:07:48,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 12 states. [2020-10-16 05:07:48,340 INFO L81 ComplementDD]: Finished complementDD. Result 12 states. [2020-10-16 05:07:48,340 INFO L185 Difference]: Start difference. First operand has 67 places, 54 transitions, 394 flow. Second operand 11 states and 1130 transitions. [2020-10-16 05:07:48,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 91 transitions, 709 flow [2020-10-16 05:07:48,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 91 transitions, 625 flow, removed 21 selfloop flow, removed 9 redundant places. [2020-10-16 05:07:48,364 INFO L241 Difference]: Finished difference. Result has 72 places, 65 transitions, 458 flow [2020-10-16 05:07:48,364 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=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=458, PETRI_PLACES=72, PETRI_TRANSITIONS=65} [2020-10-16 05:07:48,364 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 37 predicate places. [2020-10-16 05:07:48,365 INFO L481 AbstractCegarLoop]: Abstraction has has 72 places, 65 transitions, 458 flow [2020-10-16 05:07:48,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:07:48,365 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:48,365 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,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 05:07:48,365 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:48,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:48,366 INFO L82 PathProgramCache]: Analyzing trace with hash 578609423, now seen corresponding path program 2 times [2020-10-16 05:07:48,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:48,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7113483] [2020-10-16 05:07:48,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:48,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:48,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 05:07:48,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7113483] [2020-10-16 05:07:48,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:48,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:07:48,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211035141] [2020-10-16 05:07:48,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:07:48,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:48,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:07:48,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:07:48,784 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 171 [2020-10-16 05:07:48,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 65 transitions, 458 flow. Second operand 14 states. [2020-10-16 05:07:48,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:48,785 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 171 [2020-10-16 05:07:48,785 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:49,799 INFO L129 PetriNetUnfolder]: 878/1619 cut-off events. [2020-10-16 05:07:49,800 INFO L130 PetriNetUnfolder]: For 4750/4842 co-relation queries the response was YES. [2020-10-16 05:07:49,807 INFO L80 FinitePrefix]: Finished finitePrefix Result has 6802 conditions, 1619 events. 878/1619 cut-off events. For 4750/4842 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 9740 event pairs, 147 based on Foata normal form. 21/1636 useless extension candidates. Maximal degree in co-relation 6780. Up to 1063 conditions per place. [2020-10-16 05:07:49,813 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 52 selfloop transitions, 29 changer transitions 65/153 dead transitions. [2020-10-16 05:07:49,813 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 153 transitions, 1343 flow [2020-10-16 05:07:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 05:07:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 05:07:49,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1217 transitions. [2020-10-16 05:07:49,822 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5930799220272904 [2020-10-16 05:07:49,823 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1217 transitions. [2020-10-16 05:07:49,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1217 transitions. [2020-10-16 05:07:49,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:49,824 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1217 transitions. [2020-10-16 05:07:49,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 05:07:49,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 05:07:49,831 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 05:07:49,831 INFO L185 Difference]: Start difference. First operand has 72 places, 65 transitions, 458 flow. Second operand 12 states and 1217 transitions. [2020-10-16 05:07:49,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 153 transitions, 1343 flow [2020-10-16 05:07:49,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 153 transitions, 1322 flow, removed 4 selfloop flow, removed 3 redundant places. [2020-10-16 05:07:49,852 INFO L241 Difference]: Finished difference. Result has 86 places, 74 transitions, 668 flow [2020-10-16 05:07:49,853 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=668, PETRI_PLACES=86, PETRI_TRANSITIONS=74} [2020-10-16 05:07:49,853 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 51 predicate places. [2020-10-16 05:07:49,853 INFO L481 AbstractCegarLoop]: Abstraction has has 86 places, 74 transitions, 668 flow [2020-10-16 05:07:49,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:07:49,853 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:49,853 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:49,854 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 05:07:49,854 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:49,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:49,854 INFO L82 PathProgramCache]: Analyzing trace with hash 892719137, now seen corresponding path program 3 times [2020-10-16 05:07:49,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:49,855 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384331880] [2020-10-16 05:07:49,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:50,214 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,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384331880] [2020-10-16 05:07:50,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:50,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:50,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895410962] [2020-10-16 05:07:50,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:50,217 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:50,220 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 171 [2020-10-16 05:07:50,221 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 74 transitions, 668 flow. Second operand 9 states. [2020-10-16 05:07:50,222 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:50,222 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 171 [2020-10-16 05:07:50,222 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:50,658 INFO L129 PetriNetUnfolder]: 153/393 cut-off events. [2020-10-16 05:07:50,658 INFO L130 PetriNetUnfolder]: For 1985/2127 co-relation queries the response was YES. [2020-10-16 05:07:50,660 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 393 events. 153/393 cut-off events. For 1985/2127 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2073 event pairs, 21 based on Foata normal form. 25/415 useless extension candidates. Maximal degree in co-relation 1861. Up to 120 conditions per place. [2020-10-16 05:07:50,663 INFO L132 encePairwiseOnDemand]: 165/171 looper letters, 32 selfloop transitions, 18 changer transitions 11/83 dead transitions. [2020-10-16 05:07:50,663 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 860 flow [2020-10-16 05:07:50,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:07:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:07:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions. [2020-10-16 05:07:50,668 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6290726817042607 [2020-10-16 05:07:50,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 753 transitions. [2020-10-16 05:07:50,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 753 transitions. [2020-10-16 05:07:50,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:50,669 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 753 transitions. [2020-10-16 05:07:50,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:07:50,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:07:50,673 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:07:50,673 INFO L185 Difference]: Start difference. First operand has 86 places, 74 transitions, 668 flow. Second operand 7 states and 753 transitions. [2020-10-16 05:07:50,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 860 flow [2020-10-16 05:07:50,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 83 transitions, 790 flow, removed 23 selfloop flow, removed 10 redundant places. [2020-10-16 05:07:50,683 INFO L241 Difference]: Finished difference. Result has 77 places, 67 transitions, 609 flow [2020-10-16 05:07:50,683 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=609, PETRI_PLACES=77, PETRI_TRANSITIONS=67} [2020-10-16 05:07:50,684 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 42 predicate places. [2020-10-16 05:07:50,684 INFO L481 AbstractCegarLoop]: Abstraction has has 77 places, 67 transitions, 609 flow [2020-10-16 05:07:50,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:50,684 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:50,684 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,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 05:07:50,684 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:50,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:50,685 INFO L82 PathProgramCache]: Analyzing trace with hash 2117382169, now seen corresponding path program 4 times [2020-10-16 05:07:50,685 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:50,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440962759] [2020-10-16 05:07:50,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:50,982 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,983 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440962759] [2020-10-16 05:07:50,983 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:50,983 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 05:07:50,983 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798581058] [2020-10-16 05:07:50,983 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 05:07:50,984 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:50,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 05:07:50,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-10-16 05:07:50,986 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 171 [2020-10-16 05:07:50,986 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 67 transitions, 609 flow. Second operand 10 states. [2020-10-16 05:07:50,987 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:50,987 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 171 [2020-10-16 05:07:50,987 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:51,492 INFO L129 PetriNetUnfolder]: 217/529 cut-off events. [2020-10-16 05:07:51,492 INFO L130 PetriNetUnfolder]: For 2772/2997 co-relation queries the response was YES. [2020-10-16 05:07:51,495 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2606 conditions, 529 events. 217/529 cut-off events. For 2772/2997 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3032 event pairs, 28 based on Foata normal form. 48/571 useless extension candidates. Maximal degree in co-relation 2584. Up to 197 conditions per place. [2020-10-16 05:07:51,497 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 42 selfloop transitions, 20 changer transitions 33/117 dead transitions. [2020-10-16 05:07:51,497 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 117 transitions, 1304 flow [2020-10-16 05:07:51,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:07:51,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:07:51,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1049 transitions. [2020-10-16 05:07:51,501 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6134502923976608 [2020-10-16 05:07:51,501 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1049 transitions. [2020-10-16 05:07:51,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1049 transitions. [2020-10-16 05:07:51,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:51,502 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1049 transitions. [2020-10-16 05:07:51,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:07:51,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:07:51,506 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:07:51,506 INFO L185 Difference]: Start difference. First operand has 77 places, 67 transitions, 609 flow. Second operand 10 states and 1049 transitions. [2020-10-16 05:07:51,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 117 transitions, 1304 flow [2020-10-16 05:07:51,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 117 transitions, 1176 flow, removed 9 selfloop flow, removed 7 redundant places. [2020-10-16 05:07:51,518 INFO L241 Difference]: Finished difference. Result has 78 places, 78 transitions, 757 flow [2020-10-16 05:07:51,518 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=757, PETRI_PLACES=78, PETRI_TRANSITIONS=78} [2020-10-16 05:07:51,518 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 43 predicate places. [2020-10-16 05:07:51,519 INFO L481 AbstractCegarLoop]: Abstraction has has 78 places, 78 transitions, 757 flow [2020-10-16 05:07:51,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 05:07:51,519 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:51,519 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,519 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 05:07:51,519 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:51,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:51,520 INFO L82 PathProgramCache]: Analyzing trace with hash -352237255, now seen corresponding path program 5 times [2020-10-16 05:07:51,520 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:51,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664362123] [2020-10-16 05:07:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:51,720 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,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664362123] [2020-10-16 05:07:51,721 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:51,721 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:07:51,721 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768466304] [2020-10-16 05:07:51,721 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:07:51,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:51,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:07:51,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:07:51,723 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 171 [2020-10-16 05:07:51,724 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 78 transitions, 757 flow. Second operand 7 states. [2020-10-16 05:07:51,724 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:51,724 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 171 [2020-10-16 05:07:51,724 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:52,069 INFO L129 PetriNetUnfolder]: 149/379 cut-off events. [2020-10-16 05:07:52,070 INFO L130 PetriNetUnfolder]: For 2138/2297 co-relation queries the response was YES. [2020-10-16 05:07:52,072 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1872 conditions, 379 events. 149/379 cut-off events. For 2138/2297 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1994 event pairs, 9 based on Foata normal form. 34/408 useless extension candidates. Maximal degree in co-relation 1848. Up to 185 conditions per place. [2020-10-16 05:07:52,074 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 42 selfloop transitions, 23 changer transitions 3/90 dead transitions. [2020-10-16 05:07:52,074 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 90 transitions, 994 flow [2020-10-16 05:07:52,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:07:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:07:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 873 transitions. [2020-10-16 05:07:52,078 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6381578947368421 [2020-10-16 05:07:52,078 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 873 transitions. [2020-10-16 05:07:52,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 873 transitions. [2020-10-16 05:07:52,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:52,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 873 transitions. [2020-10-16 05:07:52,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:07:52,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:07:52,083 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:07:52,083 INFO L185 Difference]: Start difference. First operand has 78 places, 78 transitions, 757 flow. Second operand 8 states and 873 transitions. [2020-10-16 05:07:52,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 90 transitions, 994 flow [2020-10-16 05:07:52,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 90 transitions, 956 flow, removed 12 selfloop flow, removed 5 redundant places. [2020-10-16 05:07:52,092 INFO L241 Difference]: Finished difference. Result has 80 places, 85 transitions, 874 flow [2020-10-16 05:07:52,093 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=874, PETRI_PLACES=80, PETRI_TRANSITIONS=85} [2020-10-16 05:07:52,093 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 45 predicate places. [2020-10-16 05:07:52,093 INFO L481 AbstractCegarLoop]: Abstraction has has 80 places, 85 transitions, 874 flow [2020-10-16 05:07:52,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:07:52,093 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:52,093 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,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 05:07:52,094 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:52,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:52,094 INFO L82 PathProgramCache]: Analyzing trace with hash 982677667, now seen corresponding path program 6 times [2020-10-16 05:07:52,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:52,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095102393] [2020-10-16 05:07:52,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:52,372 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,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095102393] [2020-10-16 05:07:52,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:52,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:07:52,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454832723] [2020-10-16 05:07:52,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:07:52,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:52,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:07:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:07:52,375 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 171 [2020-10-16 05:07:52,375 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 85 transitions, 874 flow. Second operand 12 states. [2020-10-16 05:07:52,375 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:52,376 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 171 [2020-10-16 05:07:52,376 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:53,186 INFO L129 PetriNetUnfolder]: 272/561 cut-off events. [2020-10-16 05:07:53,187 INFO L130 PetriNetUnfolder]: For 3670/3848 co-relation queries the response was YES. [2020-10-16 05:07:53,189 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3192 conditions, 561 events. 272/561 cut-off events. For 3670/3848 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2785 event pairs, 12 based on Foata normal form. 55/614 useless extension candidates. Maximal degree in co-relation 3167. Up to 288 conditions per place. [2020-10-16 05:07:53,191 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 69 selfloop transitions, 57 changer transitions 48/181 dead transitions. [2020-10-16 05:07:53,192 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 181 transitions, 2129 flow [2020-10-16 05:07:53,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-10-16 05:07:53,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-16 05:07:53,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1789 transitions. [2020-10-16 05:07:53,196 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5812215724496427 [2020-10-16 05:07:53,197 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1789 transitions. [2020-10-16 05:07:53,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1789 transitions. [2020-10-16 05:07:53,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:53,198 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1789 transitions. [2020-10-16 05:07:53,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 19 states. [2020-10-16 05:07:53,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 19 states. [2020-10-16 05:07:53,205 INFO L81 ComplementDD]: Finished complementDD. Result 19 states. [2020-10-16 05:07:53,205 INFO L185 Difference]: Start difference. First operand has 80 places, 85 transitions, 874 flow. Second operand 18 states and 1789 transitions. [2020-10-16 05:07:53,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 181 transitions, 2129 flow [2020-10-16 05:07:53,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 181 transitions, 2071 flow, removed 26 selfloop flow, removed 6 redundant places. [2020-10-16 05:07:53,223 INFO L241 Difference]: Finished difference. Result has 99 places, 113 transitions, 1397 flow [2020-10-16 05:07:53,224 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1397, PETRI_PLACES=99, PETRI_TRANSITIONS=113} [2020-10-16 05:07:53,224 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 64 predicate places. [2020-10-16 05:07:53,224 INFO L481 AbstractCegarLoop]: Abstraction has has 99 places, 113 transitions, 1397 flow [2020-10-16 05:07:53,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:07:53,224 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:53,224 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,224 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 05:07:53,225 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:53,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:53,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1864012589, now seen corresponding path program 7 times [2020-10-16 05:07:53,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:53,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069269332] [2020-10-16 05:07:53,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:53,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:53,591 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,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069269332] [2020-10-16 05:07:53,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:53,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-10-16 05:07:53,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455665403] [2020-10-16 05:07:53,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-16 05:07:53,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:53,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-16 05:07:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-10-16 05:07:53,595 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 171 [2020-10-16 05:07:53,596 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 113 transitions, 1397 flow. Second operand 14 states. [2020-10-16 05:07:53,596 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:53,596 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 171 [2020-10-16 05:07:53,596 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:54,636 INFO L129 PetriNetUnfolder]: 290/598 cut-off events. [2020-10-16 05:07:54,636 INFO L130 PetriNetUnfolder]: For 5539/5787 co-relation queries the response was YES. [2020-10-16 05:07:54,639 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 598 events. 290/598 cut-off events. For 5539/5787 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3019 event pairs, 16 based on Foata normal form. 69/665 useless extension candidates. Maximal degree in co-relation 3816. Up to 291 conditions per place. [2020-10-16 05:07:54,643 INFO L132 encePairwiseOnDemand]: 159/171 looper letters, 68 selfloop transitions, 87 changer transitions 35/197 dead transitions. [2020-10-16 05:07:54,643 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 197 transitions, 2682 flow [2020-10-16 05:07:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-16 05:07:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-16 05:07:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1555 transitions. [2020-10-16 05:07:54,650 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5683479532163743 [2020-10-16 05:07:54,650 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1555 transitions. [2020-10-16 05:07:54,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1555 transitions. [2020-10-16 05:07:54,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:54,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1555 transitions. [2020-10-16 05:07:54,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 17 states. [2020-10-16 05:07:54,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 17 states. [2020-10-16 05:07:54,656 INFO L81 ComplementDD]: Finished complementDD. Result 17 states. [2020-10-16 05:07:54,656 INFO L185 Difference]: Start difference. First operand has 99 places, 113 transitions, 1397 flow. Second operand 16 states and 1555 transitions. [2020-10-16 05:07:54,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 197 transitions, 2682 flow [2020-10-16 05:07:54,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 197 transitions, 2531 flow, removed 46 selfloop flow, removed 5 redundant places. [2020-10-16 05:07:54,683 INFO L241 Difference]: Finished difference. Result has 115 places, 142 transitions, 2004 flow [2020-10-16 05:07:54,684 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2004, PETRI_PLACES=115, PETRI_TRANSITIONS=142} [2020-10-16 05:07:54,684 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 80 predicate places. [2020-10-16 05:07:54,684 INFO L481 AbstractCegarLoop]: Abstraction has has 115 places, 142 transitions, 2004 flow [2020-10-16 05:07:54,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-16 05:07:54,685 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:54,685 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,685 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 05:07:54,685 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:54,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:54,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1433096921, now seen corresponding path program 8 times [2020-10-16 05:07:54,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:54,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538662282] [2020-10-16 05:07:54,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:55,059 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,059 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538662282] [2020-10-16 05:07:55,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:55,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 05:07:55,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355011610] [2020-10-16 05:07:55,060 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 05:07:55,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:55,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 05:07:55,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-16 05:07:55,062 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 171 [2020-10-16 05:07:55,063 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 142 transitions, 2004 flow. Second operand 11 states. [2020-10-16 05:07:55,063 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:55,063 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 171 [2020-10-16 05:07:55,063 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:55,939 INFO L129 PetriNetUnfolder]: 268/566 cut-off events. [2020-10-16 05:07:55,939 INFO L130 PetriNetUnfolder]: For 5918/6220 co-relation queries the response was YES. [2020-10-16 05:07:55,943 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4048 conditions, 566 events. 268/566 cut-off events. For 5918/6220 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2849 event pairs, 23 based on Foata normal form. 44/608 useless extension candidates. Maximal degree in co-relation 4007. Up to 307 conditions per place. [2020-10-16 05:07:55,947 INFO L132 encePairwiseOnDemand]: 157/171 looper letters, 68 selfloop transitions, 100 changer transitions 34/209 dead transitions. [2020-10-16 05:07:55,947 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 209 transitions, 3153 flow [2020-10-16 05:07:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-16 05:07:55,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-16 05:07:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1311 transitions. [2020-10-16 05:07:55,956 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5897435897435898 [2020-10-16 05:07:55,956 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1311 transitions. [2020-10-16 05:07:55,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1311 transitions. [2020-10-16 05:07:55,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:55,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1311 transitions. [2020-10-16 05:07:55,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 14 states. [2020-10-16 05:07:55,960 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 14 states. [2020-10-16 05:07:55,960 INFO L81 ComplementDD]: Finished complementDD. Result 14 states. [2020-10-16 05:07:55,960 INFO L185 Difference]: Start difference. First operand has 115 places, 142 transitions, 2004 flow. Second operand 13 states and 1311 transitions. [2020-10-16 05:07:55,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 209 transitions, 3153 flow [2020-10-16 05:07:55,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 209 transitions, 3006 flow, removed 49 selfloop flow, removed 6 redundant places. [2020-10-16 05:07:55,988 INFO L241 Difference]: Finished difference. Result has 125 places, 165 transitions, 2445 flow [2020-10-16 05:07:55,989 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2445, PETRI_PLACES=125, PETRI_TRANSITIONS=165} [2020-10-16 05:07:55,989 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 90 predicate places. [2020-10-16 05:07:55,989 INFO L481 AbstractCegarLoop]: Abstraction has has 125 places, 165 transitions, 2445 flow [2020-10-16 05:07:55,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 05:07:55,989 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:55,989 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,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 05:07:55,990 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:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:55,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1609009559, now seen corresponding path program 9 times [2020-10-16 05:07:55,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:55,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656650251] [2020-10-16 05:07:55,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:56,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:07:56,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656650251] [2020-10-16 05:07:56,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:56,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:56,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092139598] [2020-10-16 05:07:56,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:56,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:56,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:56,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:56,389 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 171 [2020-10-16 05:07:56,390 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 165 transitions, 2445 flow. Second operand 9 states. [2020-10-16 05:07:56,390 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:56,390 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 171 [2020-10-16 05:07:56,390 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:57,091 INFO L129 PetriNetUnfolder]: 229/532 cut-off events. [2020-10-16 05:07:57,091 INFO L130 PetriNetUnfolder]: For 7044/7328 co-relation queries the response was YES. [2020-10-16 05:07:57,094 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3969 conditions, 532 events. 229/532 cut-off events. For 7044/7328 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 2901 event pairs, 11 based on Foata normal form. 21/550 useless extension candidates. Maximal degree in co-relation 3926. Up to 238 conditions per place. [2020-10-16 05:07:57,097 INFO L132 encePairwiseOnDemand]: 161/171 looper letters, 78 selfloop transitions, 39 changer transitions 19/184 dead transitions. [2020-10-16 05:07:57,097 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 184 transitions, 2900 flow [2020-10-16 05:07:57,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 05:07:57,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 05:07:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 938 transitions. [2020-10-16 05:07:57,098 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6094866796621182 [2020-10-16 05:07:57,098 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 938 transitions. [2020-10-16 05:07:57,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 938 transitions. [2020-10-16 05:07:57,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:57,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 938 transitions. [2020-10-16 05:07:57,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 05:07:57,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 05:07:57,101 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 05:07:57,102 INFO L185 Difference]: Start difference. First operand has 125 places, 165 transitions, 2445 flow. Second operand 9 states and 938 transitions. [2020-10-16 05:07:57,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 184 transitions, 2900 flow [2020-10-16 05:07:57,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 184 transitions, 2771 flow, removed 39 selfloop flow, removed 7 redundant places. [2020-10-16 05:07:57,129 INFO L241 Difference]: Finished difference. Result has 126 places, 162 transitions, 2325 flow [2020-10-16 05:07:57,129 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2329, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2325, PETRI_PLACES=126, PETRI_TRANSITIONS=162} [2020-10-16 05:07:57,130 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 91 predicate places. [2020-10-16 05:07:57,130 INFO L481 AbstractCegarLoop]: Abstraction has has 126 places, 162 transitions, 2325 flow [2020-10-16 05:07:57,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:57,130 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:57,130 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:57,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 05:07:57,131 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:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:57,131 INFO L82 PathProgramCache]: Analyzing trace with hash -250909811, now seen corresponding path program 10 times [2020-10-16 05:07:57,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:57,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480716301] [2020-10-16 05:07:57,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:57,383 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,384 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480716301] [2020-10-16 05:07:57,384 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:57,384 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 05:07:57,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603262335] [2020-10-16 05:07:57,385 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 05:07:57,385 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:57,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 05:07:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-16 05:07:57,388 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 171 [2020-10-16 05:07:57,389 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 162 transitions, 2325 flow. Second operand 9 states. [2020-10-16 05:07:57,389 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:57,389 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 171 [2020-10-16 05:07:57,389 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:57,803 INFO L129 PetriNetUnfolder]: 192/465 cut-off events. [2020-10-16 05:07:57,803 INFO L130 PetriNetUnfolder]: For 6448/6658 co-relation queries the response was YES. [2020-10-16 05:07:57,805 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3424 conditions, 465 events. 192/465 cut-off events. For 6448/6658 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2535 event pairs, 20 based on Foata normal form. 25/487 useless extension candidates. Maximal degree in co-relation 3383. Up to 154 conditions per place. [2020-10-16 05:07:57,808 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 61 selfloop transitions, 56 changer transitions 15/180 dead transitions. [2020-10-16 05:07:57,808 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 180 transitions, 2796 flow [2020-10-16 05:07:57,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:07:57,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:07:57,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 888 transitions. [2020-10-16 05:07:57,811 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6491228070175439 [2020-10-16 05:07:57,811 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 888 transitions. [2020-10-16 05:07:57,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 888 transitions. [2020-10-16 05:07:57,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:57,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 888 transitions. [2020-10-16 05:07:57,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:07:57,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:07:57,814 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:07:57,814 INFO L185 Difference]: Start difference. First operand has 126 places, 162 transitions, 2325 flow. Second operand 8 states and 888 transitions. [2020-10-16 05:07:57,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 180 transitions, 2796 flow [2020-10-16 05:07:57,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 180 transitions, 2648 flow, removed 4 selfloop flow, removed 9 redundant places. [2020-10-16 05:07:57,843 INFO L241 Difference]: Finished difference. Result has 126 places, 163 transitions, 2416 flow [2020-10-16 05:07:57,843 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2188, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2416, PETRI_PLACES=126, PETRI_TRANSITIONS=163} [2020-10-16 05:07:57,844 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 91 predicate places. [2020-10-16 05:07:57,844 INFO L481 AbstractCegarLoop]: Abstraction has has 126 places, 163 transitions, 2416 flow [2020-10-16 05:07:57,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 05:07:57,844 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:57,844 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:57,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-10-16 05:07:57,844 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:57,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:57,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1800032833, now seen corresponding path program 11 times [2020-10-16 05:07:57,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:57,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328867472] [2020-10-16 05:07:57,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:58,167 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:58,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328867472] [2020-10-16 05:07:58,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:58,168 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:07:58,169 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365950813] [2020-10-16 05:07:58,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 05:07:58,169 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 05:07:58,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-16 05:07:58,171 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 171 [2020-10-16 05:07:58,172 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 163 transitions, 2416 flow. Second operand 8 states. [2020-10-16 05:07:58,172 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:58,172 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 171 [2020-10-16 05:07:58,172 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:58,594 INFO L129 PetriNetUnfolder]: 238/607 cut-off events. [2020-10-16 05:07:58,594 INFO L130 PetriNetUnfolder]: For 8324/8521 co-relation queries the response was YES. [2020-10-16 05:07:58,597 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4516 conditions, 607 events. 238/607 cut-off events. For 8324/8521 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 3681 event pairs, 31 based on Foata normal form. 31/633 useless extension candidates. Maximal degree in co-relation 4473. Up to 183 conditions per place. [2020-10-16 05:07:58,603 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 97 selfloop transitions, 33 changer transitions 29/204 dead transitions. [2020-10-16 05:07:58,603 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 204 transitions, 3175 flow [2020-10-16 05:07:58,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:07:58,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:07:58,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 911 transitions. [2020-10-16 05:07:58,606 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6659356725146199 [2020-10-16 05:07:58,606 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 911 transitions. [2020-10-16 05:07:58,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 911 transitions. [2020-10-16 05:07:58,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:58,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 911 transitions. [2020-10-16 05:07:58,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:07:58,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:07:58,609 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:07:58,609 INFO L185 Difference]: Start difference. First operand has 126 places, 163 transitions, 2416 flow. Second operand 8 states and 911 transitions. [2020-10-16 05:07:58,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 204 transitions, 3175 flow [2020-10-16 05:07:58,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 204 transitions, 3083 flow, removed 12 selfloop flow, removed 6 redundant places. [2020-10-16 05:07:58,644 INFO L241 Difference]: Finished difference. Result has 128 places, 155 transitions, 2284 flow [2020-10-16 05:07:58,645 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2337, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2284, PETRI_PLACES=128, PETRI_TRANSITIONS=155} [2020-10-16 05:07:58,645 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 93 predicate places. [2020-10-16 05:07:58,645 INFO L481 AbstractCegarLoop]: Abstraction has has 128 places, 155 transitions, 2284 flow [2020-10-16 05:07:58,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 05:07:58,645 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:58,645 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,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-10-16 05:07:58,645 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,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1327392681, now seen corresponding path program 12 times [2020-10-16 05:07:58,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:58,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504597475] [2020-10-16 05:07:58,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:58,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:07:59,002 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:59,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504597475] [2020-10-16 05:07:59,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:07:59,003 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-16 05:07:59,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337103130] [2020-10-16 05:07:59,003 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-16 05:07:59,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:07:59,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-16 05:07:59,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-16 05:07:59,005 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 171 [2020-10-16 05:07:59,006 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 155 transitions, 2284 flow. Second operand 11 states. [2020-10-16 05:07:59,006 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:07:59,006 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 171 [2020-10-16 05:07:59,006 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:07:59,798 INFO L129 PetriNetUnfolder]: 238/564 cut-off events. [2020-10-16 05:07:59,798 INFO L130 PetriNetUnfolder]: For 7655/7789 co-relation queries the response was YES. [2020-10-16 05:07:59,802 INFO L80 FinitePrefix]: Finished finitePrefix Result has 4385 conditions, 564 events. 238/564 cut-off events. For 7655/7789 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3165 event pairs, 11 based on Foata normal form. 10/574 useless extension candidates. Maximal degree in co-relation 4342. Up to 205 conditions per place. [2020-10-16 05:07:59,807 INFO L132 encePairwiseOnDemand]: 158/171 looper letters, 95 selfloop transitions, 68 changer transitions 28/198 dead transitions. [2020-10-16 05:07:59,807 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 198 transitions, 3212 flow [2020-10-16 05:07:59,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-16 05:07:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-16 05:07:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1203 transitions. [2020-10-16 05:07:59,810 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.5862573099415205 [2020-10-16 05:07:59,810 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1203 transitions. [2020-10-16 05:07:59,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1203 transitions. [2020-10-16 05:07:59,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:07:59,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1203 transitions. [2020-10-16 05:07:59,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 13 states. [2020-10-16 05:07:59,815 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 13 states. [2020-10-16 05:07:59,815 INFO L81 ComplementDD]: Finished complementDD. Result 13 states. [2020-10-16 05:07:59,816 INFO L185 Difference]: Start difference. First operand has 128 places, 155 transitions, 2284 flow. Second operand 12 states and 1203 transitions. [2020-10-16 05:07:59,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 198 transitions, 3212 flow [2020-10-16 05:07:59,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 198 transitions, 3166 flow, removed 10 selfloop flow, removed 6 redundant places. [2020-10-16 05:07:59,865 INFO L241 Difference]: Finished difference. Result has 133 places, 154 transitions, 2394 flow [2020-10-16 05:07:59,866 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2244, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=2394, PETRI_PLACES=133, PETRI_TRANSITIONS=154} [2020-10-16 05:07:59,866 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 98 predicate places. [2020-10-16 05:07:59,866 INFO L481 AbstractCegarLoop]: Abstraction has has 133 places, 154 transitions, 2394 flow [2020-10-16 05:07:59,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-16 05:07:59,867 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:07:59,867 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:59,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-10-16 05:07:59,867 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:07:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:07:59,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1479391435, now seen corresponding path program 13 times [2020-10-16 05:07:59,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:07:59,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749139646] [2020-10-16 05:07:59,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:07:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:00,171 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,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749139646] [2020-10-16 05:08:00,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:00,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-16 05:08:00,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664489857] [2020-10-16 05:08:00,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-16 05:08:00,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:00,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-16 05:08:00,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2020-10-16 05:08:00,174 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 171 [2020-10-16 05:08:00,175 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 154 transitions, 2394 flow. Second operand 12 states. [2020-10-16 05:08:00,175 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:00,175 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 171 [2020-10-16 05:08:00,175 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:00,881 INFO L129 PetriNetUnfolder]: 289/668 cut-off events. [2020-10-16 05:08:00,881 INFO L130 PetriNetUnfolder]: For 10577/10706 co-relation queries the response was YES. [2020-10-16 05:08:00,887 INFO L80 FinitePrefix]: Finished finitePrefix Result has 5565 conditions, 668 events. 289/668 cut-off events. For 10577/10706 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 3800 event pairs, 19 based on Foata normal form. 18/686 useless extension candidates. Maximal degree in co-relation 5520. Up to 291 conditions per place. [2020-10-16 05:08:00,899 INFO L132 encePairwiseOnDemand]: 160/171 looper letters, 72 selfloop transitions, 42 changer transitions 89/210 dead transitions. [2020-10-16 05:08:00,900 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 210 transitions, 3516 flow [2020-10-16 05:08:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 05:08:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-10-16 05:08:00,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1041 transitions. [2020-10-16 05:08:00,902 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6087719298245614 [2020-10-16 05:08:00,902 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1041 transitions. [2020-10-16 05:08:00,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1041 transitions. [2020-10-16 05:08:00,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:00,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1041 transitions. [2020-10-16 05:08:00,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 11 states. [2020-10-16 05:08:00,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 11 states. [2020-10-16 05:08:00,908 INFO L81 ComplementDD]: Finished complementDD. Result 11 states. [2020-10-16 05:08:00,908 INFO L185 Difference]: Start difference. First operand has 133 places, 154 transitions, 2394 flow. Second operand 10 states and 1041 transitions. [2020-10-16 05:08:00,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 210 transitions, 3516 flow [2020-10-16 05:08:00,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 210 transitions, 3272 flow, removed 54 selfloop flow, removed 13 redundant places. [2020-10-16 05:08:00,966 INFO L241 Difference]: Finished difference. Result has 131 places, 117 transitions, 1715 flow [2020-10-16 05:08:00,966 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=2215, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1715, PETRI_PLACES=131, PETRI_TRANSITIONS=117} [2020-10-16 05:08:00,966 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 96 predicate places. [2020-10-16 05:08:00,966 INFO L481 AbstractCegarLoop]: Abstraction has has 131 places, 117 transitions, 1715 flow [2020-10-16 05:08:00,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-16 05:08:00,967 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:00,967 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:00,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-10-16 05:08:00,967 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:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:00,967 INFO L82 PathProgramCache]: Analyzing trace with hash 322866453, now seen corresponding path program 14 times [2020-10-16 05:08:00,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:00,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823497602] [2020-10-16 05:08:00,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:01,115 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:01,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823497602] [2020-10-16 05:08:01,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:01,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 05:08:01,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778923320] [2020-10-16 05:08:01,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 05:08:01,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:01,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 05:08:01,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-16 05:08:01,121 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 171 [2020-10-16 05:08:01,121 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 117 transitions, 1715 flow. Second operand 7 states. [2020-10-16 05:08:01,121 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:01,122 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 171 [2020-10-16 05:08:01,122 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:01,430 INFO L129 PetriNetUnfolder]: 135/361 cut-off events. [2020-10-16 05:08:01,430 INFO L130 PetriNetUnfolder]: For 5357/5379 co-relation queries the response was YES. [2020-10-16 05:08:01,432 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2763 conditions, 361 events. 135/361 cut-off events. For 5357/5379 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1870 event pairs, 10 based on Foata normal form. 12/371 useless extension candidates. Maximal degree in co-relation 2722. Up to 127 conditions per place. [2020-10-16 05:08:01,434 INFO L132 encePairwiseOnDemand]: 162/171 looper letters, 70 selfloop transitions, 9 changer transitions 18/138 dead transitions. [2020-10-16 05:08:01,434 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 138 transitions, 2110 flow [2020-10-16 05:08:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 05:08:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-10-16 05:08:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 936 transitions. [2020-10-16 05:08:01,437 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6842105263157895 [2020-10-16 05:08:01,437 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 936 transitions. [2020-10-16 05:08:01,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 936 transitions. [2020-10-16 05:08:01,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:01,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 936 transitions. [2020-10-16 05:08:01,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 9 states. [2020-10-16 05:08:01,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 9 states. [2020-10-16 05:08:01,440 INFO L81 ComplementDD]: Finished complementDD. Result 9 states. [2020-10-16 05:08:01,440 INFO L185 Difference]: Start difference. First operand has 131 places, 117 transitions, 1715 flow. Second operand 8 states and 936 transitions. [2020-10-16 05:08:01,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 138 transitions, 2110 flow [2020-10-16 05:08:01,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 138 transitions, 1879 flow, removed 46 selfloop flow, removed 16 redundant places. [2020-10-16 05:08:01,462 INFO L241 Difference]: Finished difference. Result has 117 places, 108 transitions, 1380 flow [2020-10-16 05:08:01,462 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1380, PETRI_PLACES=117, PETRI_TRANSITIONS=108} [2020-10-16 05:08:01,462 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 82 predicate places. [2020-10-16 05:08:01,462 INFO L481 AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 1380 flow [2020-10-16 05:08:01,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 05:08:01,463 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:01,463 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:01,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-10-16 05:08:01,463 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:01,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:01,463 INFO L82 PathProgramCache]: Analyzing trace with hash -406435045, now seen corresponding path program 15 times [2020-10-16 05:08:01,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:01,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118170103] [2020-10-16 05:08:01,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 05:08:01,593 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:01,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118170103] [2020-10-16 05:08:01,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 05:08:01,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 05:08:01,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929625849] [2020-10-16 05:08:01,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 05:08:01,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 05:08:01,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 05:08:01,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-16 05:08:01,598 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 171 [2020-10-16 05:08:01,598 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 1380 flow. Second operand 6 states. [2020-10-16 05:08:01,598 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 05:08:01,598 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 171 [2020-10-16 05:08:01,598 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 05:08:01,798 INFO L129 PetriNetUnfolder]: 126/320 cut-off events. [2020-10-16 05:08:01,798 INFO L130 PetriNetUnfolder]: For 3552/3564 co-relation queries the response was YES. [2020-10-16 05:08:01,799 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2170 conditions, 320 events. 126/320 cut-off events. For 3552/3564 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1552 event pairs, 8 based on Foata normal form. 5/321 useless extension candidates. Maximal degree in co-relation 2135. Up to 126 conditions per place. [2020-10-16 05:08:01,801 INFO L132 encePairwiseOnDemand]: 164/171 looper letters, 55 selfloop transitions, 2 changer transitions 27/121 dead transitions. [2020-10-16 05:08:01,801 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 121 transitions, 1693 flow [2020-10-16 05:08:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 05:08:01,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 05:08:01,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 801 transitions. [2020-10-16 05:08:01,802 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.6691729323308271 [2020-10-16 05:08:01,802 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 801 transitions. [2020-10-16 05:08:01,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 801 transitions. [2020-10-16 05:08:01,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 05:08:01,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 801 transitions. [2020-10-16 05:08:01,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 05:08:01,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 05:08:01,805 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 05:08:01,805 INFO L185 Difference]: Start difference. First operand has 117 places, 108 transitions, 1380 flow. Second operand 7 states and 801 transitions. [2020-10-16 05:08:01,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 121 transitions, 1693 flow [2020-10-16 05:08:01,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 121 transitions, 1629 flow, removed 14 selfloop flow, removed 10 redundant places. [2020-10-16 05:08:01,817 INFO L241 Difference]: Finished difference. Result has 110 places, 94 transitions, 1130 flow [2020-10-16 05:08:01,817 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=171, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1130, PETRI_PLACES=110, PETRI_TRANSITIONS=94} [2020-10-16 05:08:01,817 INFO L342 CegarLoopForPetriNet]: 35 programPoint places, 75 predicate places. [2020-10-16 05:08:01,817 INFO L481 AbstractCegarLoop]: Abstraction has has 110 places, 94 transitions, 1130 flow [2020-10-16 05:08:01,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 05:08:01,817 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 05:08:01,818 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:01,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-10-16 05:08:01,818 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:01,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 05:08:01,818 INFO L82 PathProgramCache]: Analyzing trace with hash 705097811, now seen corresponding path program 16 times [2020-10-16 05:08:01,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 05:08:01,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131601993] [2020-10-16 05:08:01,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 05:08:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:08:01,932 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:08:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 05:08:02,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 05:08:02,082 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 05:08:02,082 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 05:08:02,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-10-16 05:08:02,119 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:02,119 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,121 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:02,121 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,122 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:02,122 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,122 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:02,122 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,123 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:02,123 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,124 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:02,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,124 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:02,124 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,124 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:02,125 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,125 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:02,125 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,126 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:02,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,126 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:02,126 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,127 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:02,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,127 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:02,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,127 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:02,127 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,127 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:02,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,128 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:02,128 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,133 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:02,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,134 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:02,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,134 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:02,134 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,135 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:02,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,135 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:02,135 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,135 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:02,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,136 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:02,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,136 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:02,136 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,136 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:02,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,137 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:02,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,137 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:02,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,137 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:02,137 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,137 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:02,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,138 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:02,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,138 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:02,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,138 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:02,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,138 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:02,138 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,139 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:02,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,139 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:02,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,139 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:02,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,139 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:02,139 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,139 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:02,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,140 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:02,140 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,140 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:02,143 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,143 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:02,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,144 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:02,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,144 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:02,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,144 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:02,144 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,145 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:02,145 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,146 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:02,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,146 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:02,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,146 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:02,146 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,146 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:02,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,147 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:02,147 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,148 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:02,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,148 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:02,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,148 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:02,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,148 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:02,148 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,149 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:02,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,149 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:02,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,149 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:02,149 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,149 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:02,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,150 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:02,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,150 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:02,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,150 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:02,150 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,151 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:02,151 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 05:08:02,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 05:08:02 BasicIcfg [2020-10-16 05:08:02,251 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 05:08:02,252 INFO L168 Benchmark]: Toolchain (without parser) took 28571.58 ms. Allocated memory was 251.7 MB in the beginning and 909.1 MB in the end (delta: 657.5 MB). Free memory was 203.4 MB in the beginning and 318.4 MB in the end (delta: -115.0 MB). Peak memory consumption was 542.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:02,253 INFO L168 Benchmark]: CDTParser took 0.37 ms. Allocated memory is still 251.7 MB. Free memory is still 225.5 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 05:08:02,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.60 ms. Allocated memory was 251.7 MB in the beginning and 315.1 MB in the end (delta: 63.4 MB). Free memory was 203.4 MB in the beginning and 258.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:02,255 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.78 ms. Allocated memory is still 315.1 MB. Free memory was 258.2 MB in the beginning and 255.7 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:02,255 INFO L168 Benchmark]: Boogie Preprocessor took 59.94 ms. Allocated memory is still 315.1 MB. Free memory was 255.7 MB in the beginning and 253.2 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:02,260 INFO L168 Benchmark]: RCFGBuilder took 3923.40 ms. Allocated memory was 315.1 MB in the beginning and 430.4 MB in the end (delta: 115.3 MB). Free memory was 253.2 MB in the beginning and 359.2 MB in the end (delta: -106.0 MB). Peak memory consumption was 155.1 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:02,261 INFO L168 Benchmark]: TraceAbstraction took 23708.17 ms. Allocated memory was 430.4 MB in the beginning and 909.1 MB in the end (delta: 478.7 MB). Free memory was 359.2 MB in the beginning and 318.4 MB in the end (delta: 40.8 MB). Peak memory consumption was 519.5 MB. Max. memory is 14.2 GB. [2020-10-16 05:08:02,268 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.37 ms. Allocated memory is still 251.7 MB. Free memory is still 225.5 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 797.60 ms. Allocated memory was 251.7 MB in the beginning and 315.1 MB in the end (delta: 63.4 MB). Free memory was 203.4 MB in the beginning and 258.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 27.3 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 76.78 ms. Allocated memory is still 315.1 MB. Free memory was 258.2 MB in the beginning and 255.7 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 59.94 ms. Allocated memory is still 315.1 MB. Free memory was 255.7 MB in the beginning and 253.2 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 3923.40 ms. Allocated memory was 315.1 MB in the beginning and 430.4 MB in the end (delta: 115.3 MB). Free memory was 253.2 MB in the beginning and 359.2 MB in the end (delta: -106.0 MB). Peak memory consumption was 155.1 MB. Max. memory is 14.2 GB. * TraceAbstraction took 23708.17 ms. Allocated memory was 430.4 MB in the beginning and 909.1 MB in the end (delta: 478.7 MB). Free memory was 359.2 MB in the beginning and 318.4 MB in the end (delta: 40.8 MB). Peak memory consumption was 519.5 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.7s, 94 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.3s, 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 t2336; [L844] FCALL, FORK 0 pthread_create(&t2336, ((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 t2337; [L846] FCALL, FORK 0 pthread_create(&t2337, ((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] [L847] 0 pthread_t t2338; [L848] FCALL, FORK 0 pthread_create(&t2338, ((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=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}, 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}, 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=1, 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] [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=1, weak$$choice2=0, 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 [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 [__unbuffered_cnt=0, __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] [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 [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 [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 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 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=4, weak$$choice2=0, 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=4, weak$$choice2=0, 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: 23.3s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 11.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 174 SDtfs, 222 SDslu, 513 SDs, 0 SdLazy, 3108 SolverSat, 555 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2445occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 433 ConstructedInterpolants, 0 QuantifiedInterpolants, 99823 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...