/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/mix038_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-16 04:49:39,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 04:49:39,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 04:49:39,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 04:49:39,110 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 04:49:39,118 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 04:49:39,121 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 04:49:39,124 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 04:49:39,127 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 04:49:39,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 04:49:39,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 04:49:39,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 04:49:39,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 04:49:39,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 04:49:39,136 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 04:49:39,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 04:49:39,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 04:49:39,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 04:49:39,141 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 04:49:39,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 04:49:39,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 04:49:39,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 04:49:39,153 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 04:49:39,154 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 04:49:39,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 04:49:39,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 04:49:39,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 04:49:39,172 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 04:49:39,173 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 04:49:39,174 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 04:49:39,177 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 04:49:39,178 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 04:49:39,179 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 04:49:39,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 04:49:39,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 04:49:39,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 04:49:39,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 04:49:39,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 04:49:39,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 04:49:39,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 04:49:39,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 04:49:39,188 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 04:49:39,211 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 04:49:39,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 04:49:39,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 04:49:39,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 04:49:39,213 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 04:49:39,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 04:49:39,214 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 04:49:39,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 04:49:39,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 04:49:39,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 04:49:39,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 04:49:39,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 04:49:39,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 04:49:39,215 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 04:49:39,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 04:49:39,215 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 04:49:39,216 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 04:49:39,216 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 04:49:39,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 04:49:39,216 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 04:49:39,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 04:49:39,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 04:49:39,217 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 04:49:39,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 04:49:39,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 04:49:39,218 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 04:49:39,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 04:49:39,218 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2020-10-16 04:49:39,218 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 04:49:39,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 04:49:39,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 04:49:39,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 04:49:39,546 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 04:49:39,546 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 04:49:39,547 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2020-10-16 04:49:39,611 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638d9f3f3/e954cd00603543e58716a9e826e71b96/FLAG86368fad8 [2020-10-16 04:49:40,148 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 04:49:40,149 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_tso.oepc.i [2020-10-16 04:49:40,167 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638d9f3f3/e954cd00603543e58716a9e826e71b96/FLAG86368fad8 [2020-10-16 04:49:40,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/638d9f3f3/e954cd00603543e58716a9e826e71b96 [2020-10-16 04:49:40,441 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 04:49:40,443 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 04:49:40,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 04:49:40,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 04:49:40,448 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 04:49:40,449 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:49:40" (1/1) ... [2020-10-16 04:49:40,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0813b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:40, skipping insertion in model container [2020-10-16 04:49:40,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 04:49:40" (1/1) ... [2020-10-16 04:49:40,460 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 04:49:40,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 04:49:40,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:49:41,003 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 04:49:41,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 04:49:41,204 INFO L208 MainTranslator]: Completed translation [2020-10-16 04:49:41,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41 WrapperNode [2020-10-16 04:49:41,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 04:49:41,205 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 04:49:41,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 04:49:41,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 04:49:41,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,277 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 04:49:41,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 04:49:41,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 04:49:41,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 04:49:41,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (1/1) ... [2020-10-16 04:49:41,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 04:49:41,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 04:49:41,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 04:49:41,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 04:49:41,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (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 04:49:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 04:49:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 04:49:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 04:49:41,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 04:49:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 04:49:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 04:49:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 04:49:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 04:49:41,383 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 04:49:41,383 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 04:49:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 04:49:41,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 04:49:41,384 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 04:49:41,386 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 04:49:43,534 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 04:49:43,535 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 04:49:43,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:49:43 BoogieIcfgContainer [2020-10-16 04:49:43,538 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 04:49:43,539 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 04:49:43,539 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 04:49:43,543 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 04:49:43,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 04:49:40" (1/3) ... [2020-10-16 04:49:43,544 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b276d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:49:43, skipping insertion in model container [2020-10-16 04:49:43,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 04:49:41" (2/3) ... [2020-10-16 04:49:43,545 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56b276d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 04:49:43, skipping insertion in model container [2020-10-16 04:49:43,545 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 04:49:43" (3/3) ... [2020-10-16 04:49:43,547 INFO L111 eAbstractionObserver]: Analyzing ICFG mix038_tso.oepc.i [2020-10-16 04:49:43,560 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 04:49:43,569 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 04:49:43,570 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 04:49:43,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,604 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,609 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,613 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,614 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,615 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,616 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,616 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,623 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,623 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,624 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,624 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,625 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,628 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,628 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,629 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,629 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,630 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,634 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,634 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 04:49:43,655 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 04:49:43,679 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 04:49:43,680 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-16 04:49:43,680 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 04:49:43,680 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 04:49:43,680 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 04:49:43,681 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 04:49:43,681 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 04:49:43,681 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 04:49:43,696 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-10-16 04:49:43,753 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-16 04:49:43,753 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:49:43,758 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-16 04:49:43,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 97 transitions, 209 flow [2020-10-16 04:49:43,766 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 94 transitions, 197 flow [2020-10-16 04:49:43,768 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 04:49:43,772 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 94 transitions, 197 flow [2020-10-16 04:49:43,778 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 94 transitions, 197 flow [2020-10-16 04:49:43,778 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 102 places, 94 transitions, 197 flow [2020-10-16 04:49:43,803 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-10-16 04:49:43,804 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:49:43,805 INFO L80 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 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/90 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-16 04:49:43,808 INFO L117 LiptonReduction]: Number of co-enabled transitions 1806 [2020-10-16 04:49:44,114 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 42 [2020-10-16 04:49:44,442 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-16 04:49:44,562 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-16 04:49:44,657 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:44,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:44,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:44,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:44,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:44,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:44,669 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:44,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:44,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:44,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:44,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:44,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:44,701 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:44,701 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:44,705 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:44,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:44,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:49:44,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:44,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:49:44,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:44,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:49:44,875 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:44,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:49:44,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:44,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:44,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:44,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:44,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:44,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:44,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:44,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:44,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,014 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,056 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,150 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,154 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,170 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:45,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:45,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:45,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:49:45,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 04:49:45,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:45,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-16 04:49:45,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:45,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:49:45,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:46,532 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 04:49:46,551 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 04:49:46,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:46,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 04:49:46,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:47,755 WARN L193 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-10-16 04:49:47,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:47,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:47,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:47,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:47,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:47,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:47,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:47,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:47,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:47,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:47,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:47,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:47,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:47,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:47,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:47,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,009 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:49:48,125 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 04:49:48,136 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:48,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:48,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:48,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:48,140 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:48,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,143 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:48,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:48,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:48,167 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:48,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:48,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:48,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:48,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:48,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:48,454 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:48,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:48,460 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:48,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:48,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,480 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:48,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:48,481 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:48,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:48,487 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:48,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,490 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-16 04:49:48,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-16 04:49:48,641 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-16 04:49:48,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:49,483 WARN L193 SmtUtils]: Spent 692.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 122 [2020-10-16 04:49:50,117 WARN L193 SmtUtils]: Spent 631.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 118 [2020-10-16 04:49:50,739 WARN L193 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 111 [2020-10-16 04:49:51,077 WARN L193 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-16 04:49:51,638 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-16 04:49:51,940 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-16 04:49:52,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:52,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:52,174 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:52,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:52,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,346 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,398 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:52,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:52,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:52,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,679 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,681 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:52,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:52,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:52,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:52,698 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:52,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,077 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-16 04:49:53,402 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 04:49:53,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:53,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:53,458 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:53,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:53,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,535 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,596 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:53,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:53,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:53,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,770 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:53,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,780 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,784 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:53,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,866 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,869 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:53,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:53,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,984 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:53,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,988 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:53,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,991 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:53,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:53,996 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:53,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,131 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-16 04:49:54,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:54,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:54,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:54,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:54,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:54,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:54,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:54,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:54,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:54,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:54,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:54,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 04:49:54,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:54,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,347 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:54,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:54,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 4, 3, 2, 1] term [2020-10-16 04:49:54,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:54,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:54,350 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 04:49:54,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 4, 4, 4, 2, 1] term [2020-10-16 04:49:54,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 4, 4, 4, 4, 4, 3, 2, 3, 2, 3, 2, 1] term [2020-10-16 04:49:54,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 04:49:54,637 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2020-10-16 04:49:54,761 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-16 04:49:54,795 INFO L132 LiptonReduction]: Checked pairs total: 5648 [2020-10-16 04:49:54,796 INFO L134 LiptonReduction]: Total number of compositions: 82 [2020-10-16 04:49:54,799 INFO L182 CegarLoopForPetriNet]: Time needed for LBE in milliseconds: 11032 [2020-10-16 04:49:54,805 INFO L129 PetriNetUnfolder]: 0/8 cut-off events. [2020-10-16 04:49:54,805 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:49:54,806 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:54,807 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 04:49:54,807 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 04:49:54,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:54,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1015824799, now seen corresponding path program 1 times [2020-10-16 04:49:54,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:54,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869061678] [2020-10-16 04:49:54,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:54,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:55,034 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 04:49:55,035 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869061678] [2020-10-16 04:49:55,036 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:55,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:49:55,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424580355] [2020-10-16 04:49:55,048 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:49:55,048 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:55,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:49:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:49:55,066 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 179 [2020-10-16 04:49:55,068 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states. [2020-10-16 04:49:55,069 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:55,069 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 179 [2020-10-16 04:49:55,070 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:55,182 INFO L129 PetriNetUnfolder]: 69/141 cut-off events. [2020-10-16 04:49:55,183 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 04:49:55,184 INFO L80 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 69/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 609 event pairs, 39 based on Foata normal form. 11/133 useless extension candidates. Maximal degree in co-relation 259. Up to 89 conditions per place. [2020-10-16 04:49:55,186 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 9 selfloop transitions, 2 changer transitions 2/28 dead transitions. [2020-10-16 04:49:55,187 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 91 flow [2020-10-16 04:49:55,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:49:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:49:55,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 442 transitions. [2020-10-16 04:49:55,206 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8230912476722533 [2020-10-16 04:49:55,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 442 transitions. [2020-10-16 04:49:55,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 442 transitions. [2020-10-16 04:49:55,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:55,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 442 transitions. [2020-10-16 04:49:55,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:49:55,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:49:55,225 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:49:55,230 INFO L185 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 442 transitions. [2020-10-16 04:49:55,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 91 flow [2020-10-16 04:49:55,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 28 transitions, 88 flow, removed 0 selfloop flow, removed 3 redundant places. [2020-10-16 04:49:55,239 INFO L241 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2020-10-16 04:49:55,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2020-10-16 04:49:55,243 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 04:49:55,243 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2020-10-16 04:49:55,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:49:55,244 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:55,244 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:55,244 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 04:49:55,244 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 04:49:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:55,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1212648551, now seen corresponding path program 1 times [2020-10-16 04:49:55,245 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:55,245 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140310833] [2020-10-16 04:49:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:55,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:55,431 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 04:49:55,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140310833] [2020-10-16 04:49:55,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:55,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:49:55,432 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669453067] [2020-10-16 04:49:55,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:49:55,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:55,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:49:55,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:49:55,436 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 179 [2020-10-16 04:49:55,436 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states. [2020-10-16 04:49:55,436 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:55,436 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 179 [2020-10-16 04:49:55,436 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:55,519 INFO L129 PetriNetUnfolder]: 77/157 cut-off events. [2020-10-16 04:49:55,519 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2020-10-16 04:49:55,520 INFO L80 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 157 events. 77/157 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 638 event pairs, 37 based on Foata normal form. 2/155 useless extension candidates. Maximal degree in co-relation 303. Up to 125 conditions per place. [2020-10-16 04:49:55,522 INFO L132 encePairwiseOnDemand]: 175/179 looper letters, 9 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2020-10-16 04:49:55,522 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 88 flow [2020-10-16 04:49:55,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:49:55,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:49:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2020-10-16 04:49:55,526 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7672253258845437 [2020-10-16 04:49:55,526 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2020-10-16 04:49:55,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2020-10-16 04:49:55,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:55,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2020-10-16 04:49:55,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:49:55,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:49:55,530 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:49:55,530 INFO L185 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 412 transitions. [2020-10-16 04:49:55,530 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 88 flow [2020-10-16 04:49:55,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 26 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:49:55,531 INFO L241 Difference]: Finished difference. Result has 32 places, 24 transitions, 69 flow [2020-10-16 04:49:55,532 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2020-10-16 04:49:55,532 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2020-10-16 04:49:55,533 INFO L481 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 69 flow [2020-10-16 04:49:55,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:49:55,533 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:55,533 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:55,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 04:49:55,533 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 04:49:55,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:55,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1062547602, now seen corresponding path program 1 times [2020-10-16 04:49:55,534 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:55,534 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390489222] [2020-10-16 04:49:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:55,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 04:49:55,593 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390489222] [2020-10-16 04:49:55,593 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:55,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 04:49:55,594 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198034274] [2020-10-16 04:49:55,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 04:49:55,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:55,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 04:49:55,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 04:49:55,596 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 179 [2020-10-16 04:49:55,597 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states. [2020-10-16 04:49:55,597 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:55,597 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 179 [2020-10-16 04:49:55,597 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:55,612 INFO L129 PetriNetUnfolder]: 2/29 cut-off events. [2020-10-16 04:49:55,612 INFO L130 PetriNetUnfolder]: For 4/6 co-relation queries the response was YES. [2020-10-16 04:49:55,613 INFO L80 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 29 events. 2/29 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 44. Up to 8 conditions per place. [2020-10-16 04:49:55,613 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 1 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2020-10-16 04:49:55,613 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 24 transitions, 77 flow [2020-10-16 04:49:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 04:49:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-16 04:49:55,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2020-10-16 04:49:55,616 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8566108007448789 [2020-10-16 04:49:55,617 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2020-10-16 04:49:55,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2020-10-16 04:49:55,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:55,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2020-10-16 04:49:55,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 4 states. [2020-10-16 04:49:55,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 4 states. [2020-10-16 04:49:55,620 INFO L81 ComplementDD]: Finished complementDD. Result 4 states. [2020-10-16 04:49:55,620 INFO L185 Difference]: Start difference. First operand has 32 places, 24 transitions, 69 flow. Second operand 3 states and 460 transitions. [2020-10-16 04:49:55,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 24 transitions, 77 flow [2020-10-16 04:49:55,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 24 transitions, 74 flow, removed 0 selfloop flow, removed 1 redundant places. [2020-10-16 04:49:55,621 INFO L241 Difference]: Finished difference. Result has 34 places, 24 transitions, 77 flow [2020-10-16 04:49:55,622 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2020-10-16 04:49:55,622 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2020-10-16 04:49:55,622 INFO L481 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 77 flow [2020-10-16 04:49:55,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 04:49:55,622 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:55,622 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:55,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 04:49:55,623 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 04:49:55,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:55,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1475421629, now seen corresponding path program 1 times [2020-10-16 04:49:55,623 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:55,624 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034147769] [2020-10-16 04:49:55,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:55,732 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 04:49:55,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034147769] [2020-10-16 04:49:55,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:55,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 04:49:55,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313975435] [2020-10-16 04:49:55,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:49:55,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:55,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:49:55,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:49:55,735 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 179 [2020-10-16 04:49:55,736 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 77 flow. Second operand 4 states. [2020-10-16 04:49:55,736 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:55,736 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 179 [2020-10-16 04:49:55,736 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:55,831 INFO L129 PetriNetUnfolder]: 91/197 cut-off events. [2020-10-16 04:49:55,831 INFO L130 PetriNetUnfolder]: For 67/69 co-relation queries the response was YES. [2020-10-16 04:49:55,832 INFO L80 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 197 events. 91/197 cut-off events. For 67/69 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 861 event pairs, 50 based on Foata normal form. 2/184 useless extension candidates. Maximal degree in co-relation 425. Up to 143 conditions per place. [2020-10-16 04:49:55,834 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 10 selfloop transitions, 9 changer transitions 0/34 dead transitions. [2020-10-16 04:49:55,834 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 34 transitions, 143 flow [2020-10-16 04:49:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:49:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:49:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2020-10-16 04:49:55,837 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7835195530726257 [2020-10-16 04:49:55,837 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2020-10-16 04:49:55,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2020-10-16 04:49:55,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:55,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2020-10-16 04:49:55,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:49:55,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:49:55,841 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:49:55,841 INFO L185 Difference]: Start difference. First operand has 34 places, 24 transitions, 77 flow. Second operand 4 states and 561 transitions. [2020-10-16 04:49:55,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 34 transitions, 143 flow [2020-10-16 04:49:55,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 34 transitions, 137 flow, removed 0 selfloop flow, removed 2 redundant places. [2020-10-16 04:49:55,843 INFO L241 Difference]: Finished difference. Result has 37 places, 32 transitions, 136 flow [2020-10-16 04:49:55,843 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2020-10-16 04:49:55,844 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2020-10-16 04:49:55,844 INFO L481 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 136 flow [2020-10-16 04:49:55,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:49:55,844 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:55,844 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:55,844 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 04:49:55,845 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 04:49:55,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:55,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1043837480, now seen corresponding path program 1 times [2020-10-16 04:49:55,845 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:55,845 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363981658] [2020-10-16 04:49:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:55,975 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 04:49:55,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363981658] [2020-10-16 04:49:55,976 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:55,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:49:55,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479388034] [2020-10-16 04:49:55,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:49:55,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:55,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:49:55,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:49:55,978 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 179 [2020-10-16 04:49:55,979 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 136 flow. Second operand 5 states. [2020-10-16 04:49:55,979 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:55,979 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 179 [2020-10-16 04:49:55,979 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:56,117 INFO L129 PetriNetUnfolder]: 95/199 cut-off events. [2020-10-16 04:49:56,117 INFO L130 PetriNetUnfolder]: For 193/231 co-relation queries the response was YES. [2020-10-16 04:49:56,120 INFO L80 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 199 events. 95/199 cut-off events. For 193/231 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 845 event pairs, 18 based on Foata normal form. 17/208 useless extension candidates. Maximal degree in co-relation 546. Up to 126 conditions per place. [2020-10-16 04:49:56,125 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 15 selfloop transitions, 12 changer transitions 0/42 dead transitions. [2020-10-16 04:49:56,126 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 42 transitions, 234 flow [2020-10-16 04:49:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:49:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:49:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 551 transitions. [2020-10-16 04:49:56,130 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7695530726256983 [2020-10-16 04:49:56,130 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 551 transitions. [2020-10-16 04:49:56,130 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 551 transitions. [2020-10-16 04:49:56,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:56,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 551 transitions. [2020-10-16 04:49:56,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:49:56,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:49:56,143 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:49:56,143 INFO L185 Difference]: Start difference. First operand has 37 places, 32 transitions, 136 flow. Second operand 4 states and 551 transitions. [2020-10-16 04:49:56,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 42 transitions, 234 flow [2020-10-16 04:49:56,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 42 transitions, 234 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 04:49:56,147 INFO L241 Difference]: Finished difference. Result has 42 places, 38 transitions, 216 flow [2020-10-16 04:49:56,147 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2020-10-16 04:49:56,148 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2020-10-16 04:49:56,148 INFO L481 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 216 flow [2020-10-16 04:49:56,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:49:56,148 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:56,148 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:56,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 04:49:56,149 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 04:49:56,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:56,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1894479351, now seen corresponding path program 1 times [2020-10-16 04:49:56,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:56,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893879587] [2020-10-16 04:49:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:56,312 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 04:49:56,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893879587] [2020-10-16 04:49:56,313 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:56,313 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:49:56,313 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171939391] [2020-10-16 04:49:56,314 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:49:56,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:56,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:49:56,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:49:56,318 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 179 [2020-10-16 04:49:56,318 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 216 flow. Second operand 6 states. [2020-10-16 04:49:56,318 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:56,319 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 179 [2020-10-16 04:49:56,319 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:56,610 INFO L129 PetriNetUnfolder]: 181/435 cut-off events. [2020-10-16 04:49:56,610 INFO L130 PetriNetUnfolder]: For 592/615 co-relation queries the response was YES. [2020-10-16 04:49:56,615 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1321 conditions, 435 events. 181/435 cut-off events. For 592/615 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2539 event pairs, 19 based on Foata normal form. 13/442 useless extension candidates. Maximal degree in co-relation 1303. Up to 198 conditions per place. [2020-10-16 04:49:56,621 INFO L132 encePairwiseOnDemand]: 171/179 looper letters, 26 selfloop transitions, 22 changer transitions 0/65 dead transitions. [2020-10-16 04:49:56,621 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 65 transitions, 457 flow [2020-10-16 04:49:56,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:49:56,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:49:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions. [2020-10-16 04:49:56,627 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7299813780260708 [2020-10-16 04:49:56,627 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 784 transitions. [2020-10-16 04:49:56,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions. [2020-10-16 04:49:56,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:56,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions. [2020-10-16 04:49:56,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:49:56,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:49:56,633 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:49:56,634 INFO L185 Difference]: Start difference. First operand has 42 places, 38 transitions, 216 flow. Second operand 6 states and 784 transitions. [2020-10-16 04:49:56,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 65 transitions, 457 flow [2020-10-16 04:49:56,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 65 transitions, 457 flow, removed 0 selfloop flow, removed 0 redundant places. [2020-10-16 04:49:56,644 INFO L241 Difference]: Finished difference. Result has 51 places, 55 transitions, 440 flow [2020-10-16 04:49:56,644 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=440, PETRI_PLACES=51, PETRI_TRANSITIONS=55} [2020-10-16 04:49:56,645 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2020-10-16 04:49:56,645 INFO L481 AbstractCegarLoop]: Abstraction has has 51 places, 55 transitions, 440 flow [2020-10-16 04:49:56,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:49:56,645 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:56,645 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:56,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 04:49:56,645 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 04:49:56,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:56,646 INFO L82 PathProgramCache]: Analyzing trace with hash 967230606, now seen corresponding path program 1 times [2020-10-16 04:49:56,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:56,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126964035] [2020-10-16 04:49:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:57,141 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 04:49:57,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126964035] [2020-10-16 04:49:57,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:57,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:49:57,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198206601] [2020-10-16 04:49:57,143 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:49:57,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:57,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:49:57,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:49:57,147 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 179 [2020-10-16 04:49:57,148 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 55 transitions, 440 flow. Second operand 7 states. [2020-10-16 04:49:57,148 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:57,148 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 179 [2020-10-16 04:49:57,148 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:57,475 INFO L129 PetriNetUnfolder]: 188/405 cut-off events. [2020-10-16 04:49:57,475 INFO L130 PetriNetUnfolder]: For 1851/2138 co-relation queries the response was YES. [2020-10-16 04:49:57,478 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1791 conditions, 405 events. 188/405 cut-off events. For 1851/2138 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2231 event pairs, 18 based on Foata normal form. 59/442 useless extension candidates. Maximal degree in co-relation 1768. Up to 204 conditions per place. [2020-10-16 04:49:57,481 INFO L132 encePairwiseOnDemand]: 172/179 looper letters, 17 selfloop transitions, 32 changer transitions 1/66 dead transitions. [2020-10-16 04:49:57,481 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 66 transitions, 624 flow [2020-10-16 04:49:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:49:57,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:49:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2020-10-16 04:49:57,485 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7307262569832402 [2020-10-16 04:49:57,485 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2020-10-16 04:49:57,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2020-10-16 04:49:57,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:57,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2020-10-16 04:49:57,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:49:57,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:49:57,490 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:49:57,490 INFO L185 Difference]: Start difference. First operand has 51 places, 55 transitions, 440 flow. Second operand 5 states and 654 transitions. [2020-10-16 04:49:57,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 66 transitions, 624 flow [2020-10-16 04:49:57,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 611 flow, removed 6 selfloop flow, removed 1 redundant places. [2020-10-16 04:49:57,502 INFO L241 Difference]: Finished difference. Result has 57 places, 60 transitions, 593 flow [2020-10-16 04:49:57,502 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=593, PETRI_PLACES=57, PETRI_TRANSITIONS=60} [2020-10-16 04:49:57,503 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2020-10-16 04:49:57,503 INFO L481 AbstractCegarLoop]: Abstraction has has 57 places, 60 transitions, 593 flow [2020-10-16 04:49:57,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:49:57,503 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:57,503 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:57,504 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 04:49:57,504 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 04:49:57,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1383888109, now seen corresponding path program 2 times [2020-10-16 04:49:57,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:57,505 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404956688] [2020-10-16 04:49:57,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:57,560 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 04:49:57,561 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404956688] [2020-10-16 04:49:57,561 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:57,561 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:49:57,561 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540795305] [2020-10-16 04:49:57,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:49:57,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:57,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:49:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:49:57,564 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 179 [2020-10-16 04:49:57,564 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 60 transitions, 593 flow. Second operand 4 states. [2020-10-16 04:49:57,564 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:57,565 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 179 [2020-10-16 04:49:57,565 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:57,685 INFO L129 PetriNetUnfolder]: 192/482 cut-off events. [2020-10-16 04:49:57,686 INFO L130 PetriNetUnfolder]: For 2852/3032 co-relation queries the response was YES. [2020-10-16 04:49:57,689 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 482 events. 192/482 cut-off events. For 2852/3032 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 3054 event pairs, 55 based on Foata normal form. 26/489 useless extension candidates. Maximal degree in co-relation 2133. Up to 238 conditions per place. [2020-10-16 04:49:57,693 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 3 selfloop transitions, 3 changer transitions 3/61 dead transitions. [2020-10-16 04:49:57,693 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 61 transitions, 609 flow [2020-10-16 04:49:57,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:49:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:49:57,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2020-10-16 04:49:57,696 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8184357541899442 [2020-10-16 04:49:57,697 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2020-10-16 04:49:57,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2020-10-16 04:49:57,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:57,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2020-10-16 04:49:57,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:49:57,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:49:57,700 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:49:57,701 INFO L185 Difference]: Start difference. First operand has 57 places, 60 transitions, 593 flow. Second operand 4 states and 586 transitions. [2020-10-16 04:49:57,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 61 transitions, 609 flow [2020-10-16 04:49:57,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 61 transitions, 591 flow, removed 5 selfloop flow, removed 1 redundant places. [2020-10-16 04:49:57,710 INFO L241 Difference]: Finished difference. Result has 61 places, 58 transitions, 558 flow [2020-10-16 04:49:57,710 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=558, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2020-10-16 04:49:57,710 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 27 predicate places. [2020-10-16 04:49:57,710 INFO L481 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 558 flow [2020-10-16 04:49:57,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:49:57,711 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:57,711 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:57,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 04:49:57,711 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 04:49:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:57,712 INFO L82 PathProgramCache]: Analyzing trace with hash -501204984, now seen corresponding path program 2 times [2020-10-16 04:49:57,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:57,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470884165] [2020-10-16 04:49:57,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:57,965 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 04:49:57,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470884165] [2020-10-16 04:49:57,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:57,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:49:57,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663536075] [2020-10-16 04:49:57,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:49:57,966 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:57,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:49:57,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:49:57,968 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 179 [2020-10-16 04:49:57,969 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 558 flow. Second operand 7 states. [2020-10-16 04:49:57,969 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:57,969 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 179 [2020-10-16 04:49:57,969 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:58,349 INFO L129 PetriNetUnfolder]: 256/573 cut-off events. [2020-10-16 04:49:58,349 INFO L130 PetriNetUnfolder]: For 3337/3857 co-relation queries the response was YES. [2020-10-16 04:49:58,353 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 573 events. 256/573 cut-off events. For 3337/3857 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3564 event pairs, 54 based on Foata normal form. 49/597 useless extension candidates. Maximal degree in co-relation 2844. Up to 319 conditions per place. [2020-10-16 04:49:58,357 INFO L132 encePairwiseOnDemand]: 171/179 looper letters, 29 selfloop transitions, 31 changer transitions 8/85 dead transitions. [2020-10-16 04:49:58,357 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 85 transitions, 972 flow [2020-10-16 04:49:58,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:49:58,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:49:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 938 transitions. [2020-10-16 04:49:58,362 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7486033519553073 [2020-10-16 04:49:58,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 938 transitions. [2020-10-16 04:49:58,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 938 transitions. [2020-10-16 04:49:58,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:58,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 938 transitions. [2020-10-16 04:49:58,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:49:58,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:49:58,370 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:49:58,370 INFO L185 Difference]: Start difference. First operand has 61 places, 58 transitions, 558 flow. Second operand 7 states and 938 transitions. [2020-10-16 04:49:58,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 85 transitions, 972 flow [2020-10-16 04:49:58,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 85 transitions, 967 flow, removed 1 selfloop flow, removed 2 redundant places. [2020-10-16 04:49:58,383 INFO L241 Difference]: Finished difference. Result has 68 places, 70 transitions, 784 flow [2020-10-16 04:49:58,384 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=784, PETRI_PLACES=68, PETRI_TRANSITIONS=70} [2020-10-16 04:49:58,384 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2020-10-16 04:49:58,384 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 70 transitions, 784 flow [2020-10-16 04:49:58,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:49:58,385 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:58,385 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:58,385 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 04:49:58,385 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 04:49:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash 995743476, now seen corresponding path program 3 times [2020-10-16 04:49:58,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:58,387 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044488780] [2020-10-16 04:49:58,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 04:49:58,698 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044488780] [2020-10-16 04:49:58,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:58,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:49:58,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956535546] [2020-10-16 04:49:58,699 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 04:49:58,699 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:58,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 04:49:58,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-16 04:49:58,702 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 179 [2020-10-16 04:49:58,703 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 70 transitions, 784 flow. Second operand 7 states. [2020-10-16 04:49:58,703 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:58,704 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 179 [2020-10-16 04:49:58,704 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:59,061 INFO L129 PetriNetUnfolder]: 243/560 cut-off events. [2020-10-16 04:49:59,061 INFO L130 PetriNetUnfolder]: For 3899/4401 co-relation queries the response was YES. [2020-10-16 04:49:59,065 INFO L80 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 560 events. 243/560 cut-off events. For 3899/4401 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3552 event pairs, 37 based on Foata normal form. 62/597 useless extension candidates. Maximal degree in co-relation 3068. Up to 272 conditions per place. [2020-10-16 04:49:59,069 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 17 selfloop transitions, 30 changer transitions 13/77 dead transitions. [2020-10-16 04:49:59,070 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 77 transitions, 976 flow [2020-10-16 04:49:59,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:49:59,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:49:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2020-10-16 04:49:59,073 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7284916201117319 [2020-10-16 04:49:59,073 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2020-10-16 04:49:59,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2020-10-16 04:49:59,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:59,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2020-10-16 04:49:59,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:49:59,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:49:59,077 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:49:59,077 INFO L185 Difference]: Start difference. First operand has 68 places, 70 transitions, 784 flow. Second operand 5 states and 652 transitions. [2020-10-16 04:49:59,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 77 transitions, 976 flow [2020-10-16 04:49:59,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 917 flow, removed 15 selfloop flow, removed 2 redundant places. [2020-10-16 04:49:59,088 INFO L241 Difference]: Finished difference. Result has 71 places, 61 transitions, 717 flow [2020-10-16 04:49:59,088 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=725, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=717, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2020-10-16 04:49:59,088 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 37 predicate places. [2020-10-16 04:49:59,089 INFO L481 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 717 flow [2020-10-16 04:49:59,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 04:49:59,089 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:59,089 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:59,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 04:49:59,089 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 04:49:59,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:59,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1806098401, now seen corresponding path program 3 times [2020-10-16 04:49:59,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:59,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12003588] [2020-10-16 04:49:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:59,143 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 04:49:59,144 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12003588] [2020-10-16 04:49:59,144 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:59,144 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:49:59,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330045492] [2020-10-16 04:49:59,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:49:59,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:59,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:49:59,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:49:59,146 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 179 [2020-10-16 04:49:59,146 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 717 flow. Second operand 4 states. [2020-10-16 04:49:59,147 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:59,147 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 179 [2020-10-16 04:49:59,147 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:59,315 INFO L129 PetriNetUnfolder]: 288/657 cut-off events. [2020-10-16 04:49:59,315 INFO L130 PetriNetUnfolder]: For 5560/5954 co-relation queries the response was YES. [2020-10-16 04:49:59,319 INFO L80 FinitePrefix]: Finished finitePrefix Result has 2925 conditions, 657 events. 288/657 cut-off events. For 5560/5954 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 4214 event pairs, 97 based on Foata normal form. 179/784 useless extension candidates. Maximal degree in co-relation 2892. Up to 294 conditions per place. [2020-10-16 04:49:59,324 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 9 selfloop transitions, 8 changer transitions 2/64 dead transitions. [2020-10-16 04:49:59,324 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 671 flow [2020-10-16 04:49:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 04:49:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-16 04:49:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2020-10-16 04:49:59,327 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8245810055865922 [2020-10-16 04:49:59,327 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2020-10-16 04:49:59,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2020-10-16 04:49:59,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:59,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2020-10-16 04:49:59,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 6 states. [2020-10-16 04:49:59,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 6 states. [2020-10-16 04:49:59,332 INFO L81 ComplementDD]: Finished complementDD. Result 6 states. [2020-10-16 04:49:59,332 INFO L185 Difference]: Start difference. First operand has 71 places, 61 transitions, 717 flow. Second operand 5 states and 738 transitions. [2020-10-16 04:49:59,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 671 flow [2020-10-16 04:49:59,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 614 flow, removed 7 selfloop flow, removed 7 redundant places. [2020-10-16 04:49:59,345 INFO L241 Difference]: Finished difference. Result has 68 places, 59 transitions, 601 flow [2020-10-16 04:49:59,345 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=601, PETRI_PLACES=68, PETRI_TRANSITIONS=59} [2020-10-16 04:49:59,345 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2020-10-16 04:49:59,346 INFO L481 AbstractCegarLoop]: Abstraction has has 68 places, 59 transitions, 601 flow [2020-10-16 04:49:59,346 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:49:59,346 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:59,346 INFO L255 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 04:49:59,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 04:49:59,346 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 04:49:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash -983176658, now seen corresponding path program 1 times [2020-10-16 04:49:59,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:59,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540120280] [2020-10-16 04:49:59,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:59,440 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 04:49:59,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540120280] [2020-10-16 04:49:59,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:59,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:49:59,441 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831817699] [2020-10-16 04:49:59,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 04:49:59,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:59,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 04:49:59,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 04:49:59,442 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 179 [2020-10-16 04:49:59,443 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 59 transitions, 601 flow. Second operand 5 states. [2020-10-16 04:49:59,443 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:59,443 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 179 [2020-10-16 04:49:59,443 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:59,593 INFO L129 PetriNetUnfolder]: 126/392 cut-off events. [2020-10-16 04:49:59,593 INFO L130 PetriNetUnfolder]: For 3681/4802 co-relation queries the response was YES. [2020-10-16 04:49:59,596 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1830 conditions, 392 events. 126/392 cut-off events. For 3681/4802 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 2559 event pairs, 13 based on Foata normal form. 330/693 useless extension candidates. Maximal degree in co-relation 1798. Up to 184 conditions per place. [2020-10-16 04:49:59,599 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 5 selfloop transitions, 15 changer transitions 3/68 dead transitions. [2020-10-16 04:49:59,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 68 transitions, 695 flow [2020-10-16 04:49:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:49:59,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:49:59,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1033 transitions. [2020-10-16 04:49:59,603 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8244213886671987 [2020-10-16 04:49:59,603 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1033 transitions. [2020-10-16 04:49:59,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1033 transitions. [2020-10-16 04:49:59,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:59,604 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1033 transitions. [2020-10-16 04:49:59,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:49:59,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:49:59,612 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:49:59,612 INFO L185 Difference]: Start difference. First operand has 68 places, 59 transitions, 601 flow. Second operand 7 states and 1033 transitions. [2020-10-16 04:49:59,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 68 transitions, 695 flow [2020-10-16 04:49:59,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 68 transitions, 676 flow, removed 4 selfloop flow, removed 2 redundant places. [2020-10-16 04:49:59,622 INFO L241 Difference]: Finished difference. Result has 74 places, 65 transitions, 671 flow [2020-10-16 04:49:59,623 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=671, PETRI_PLACES=74, PETRI_TRANSITIONS=65} [2020-10-16 04:49:59,623 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2020-10-16 04:49:59,623 INFO L481 AbstractCegarLoop]: Abstraction has has 74 places, 65 transitions, 671 flow [2020-10-16 04:49:59,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 04:49:59,624 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:59,624 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 04:49:59,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 04:49:59,624 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 04:49:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1833012601, now seen corresponding path program 1 times [2020-10-16 04:49:59,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:59,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886045048] [2020-10-16 04:49:59,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:49:59,763 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 04:49:59,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886045048] [2020-10-16 04:49:59,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:49:59,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 04:49:59,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731431900] [2020-10-16 04:49:59,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:49:59,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:49:59,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:49:59,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:49:59,766 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 179 [2020-10-16 04:49:59,766 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 65 transitions, 671 flow. Second operand 6 states. [2020-10-16 04:49:59,767 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:49:59,767 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 179 [2020-10-16 04:49:59,767 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:49:59,913 INFO L129 PetriNetUnfolder]: 96/333 cut-off events. [2020-10-16 04:49:59,913 INFO L130 PetriNetUnfolder]: For 3343/4556 co-relation queries the response was YES. [2020-10-16 04:49:59,916 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1723 conditions, 333 events. 96/333 cut-off events. For 3343/4556 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2213 event pairs, 5 based on Foata normal form. 317/626 useless extension candidates. Maximal degree in co-relation 1688. Up to 165 conditions per place. [2020-10-16 04:49:59,918 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 2 selfloop transitions, 19 changer transitions 17/69 dead transitions. [2020-10-16 04:49:59,919 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 69 transitions, 749 flow [2020-10-16 04:49:59,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 04:49:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-16 04:49:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1322 transitions. [2020-10-16 04:49:59,924 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8206083178150217 [2020-10-16 04:49:59,924 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1322 transitions. [2020-10-16 04:49:59,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1322 transitions. [2020-10-16 04:49:59,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:49:59,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1322 transitions. [2020-10-16 04:49:59,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 10 states. [2020-10-16 04:49:59,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 10 states. [2020-10-16 04:49:59,933 INFO L81 ComplementDD]: Finished complementDD. Result 10 states. [2020-10-16 04:49:59,933 INFO L185 Difference]: Start difference. First operand has 74 places, 65 transitions, 671 flow. Second operand 9 states and 1322 transitions. [2020-10-16 04:49:59,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 69 transitions, 749 flow [2020-10-16 04:49:59,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 69 transitions, 697 flow, removed 20 selfloop flow, removed 3 redundant places. [2020-10-16 04:49:59,945 INFO L241 Difference]: Finished difference. Result has 82 places, 52 transitions, 487 flow [2020-10-16 04:49:59,945 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=487, PETRI_PLACES=82, PETRI_TRANSITIONS=52} [2020-10-16 04:49:59,945 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 48 predicate places. [2020-10-16 04:49:59,946 INFO L481 AbstractCegarLoop]: Abstraction has has 82 places, 52 transitions, 487 flow [2020-10-16 04:49:59,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:49:59,946 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:49:59,946 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] [2020-10-16 04:49:59,946 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 04:49:59,947 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 04:49:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:49:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1058995249, now seen corresponding path program 1 times [2020-10-16 04:49:59,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:49:59,948 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540774398] [2020-10-16 04:49:59,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:49:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:00,068 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 04:50:00,069 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540774398] [2020-10-16 04:50:00,069 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:00,069 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 04:50:00,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198279546] [2020-10-16 04:50:00,070 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 04:50:00,070 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 04:50:00,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-16 04:50:00,071 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 179 [2020-10-16 04:50:00,072 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 52 transitions, 487 flow. Second operand 6 states. [2020-10-16 04:50:00,072 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:00,072 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 179 [2020-10-16 04:50:00,072 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:00,218 INFO L129 PetriNetUnfolder]: 100/360 cut-off events. [2020-10-16 04:50:00,218 INFO L130 PetriNetUnfolder]: For 2768/2922 co-relation queries the response was YES. [2020-10-16 04:50:00,221 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1684 conditions, 360 events. 100/360 cut-off events. For 2768/2922 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2482 event pairs, 16 based on Foata normal form. 60/393 useless extension candidates. Maximal degree in co-relation 1653. Up to 80 conditions per place. [2020-10-16 04:50:00,223 INFO L132 encePairwiseOnDemand]: 174/179 looper letters, 12 selfloop transitions, 2 changer transitions 29/71 dead transitions. [2020-10-16 04:50:00,223 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 71 transitions, 794 flow [2020-10-16 04:50:00,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 04:50:00,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-16 04:50:00,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 788 transitions. [2020-10-16 04:50:00,227 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7337057728119181 [2020-10-16 04:50:00,228 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 788 transitions. [2020-10-16 04:50:00,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 788 transitions. [2020-10-16 04:50:00,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:00,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 788 transitions. [2020-10-16 04:50:00,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 7 states. [2020-10-16 04:50:00,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 7 states. [2020-10-16 04:50:00,233 INFO L81 ComplementDD]: Finished complementDD. Result 7 states. [2020-10-16 04:50:00,233 INFO L185 Difference]: Start difference. First operand has 82 places, 52 transitions, 487 flow. Second operand 6 states and 788 transitions. [2020-10-16 04:50:00,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 71 transitions, 794 flow [2020-10-16 04:50:00,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 71 transitions, 690 flow, removed 32 selfloop flow, removed 11 redundant places. [2020-10-16 04:50:00,242 INFO L241 Difference]: Finished difference. Result has 75 places, 42 transitions, 304 flow [2020-10-16 04:50:00,242 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=304, PETRI_PLACES=75, PETRI_TRANSITIONS=42} [2020-10-16 04:50:00,242 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 41 predicate places. [2020-10-16 04:50:00,243 INFO L481 AbstractCegarLoop]: Abstraction has has 75 places, 42 transitions, 304 flow [2020-10-16 04:50:00,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 04:50:00,243 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:00,243 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] [2020-10-16 04:50:00,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 04:50:00,243 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 04:50:00,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:00,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1239632319, now seen corresponding path program 2 times [2020-10-16 04:50:00,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:00,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014291046] [2020-10-16 04:50:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50:00,728 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 04:50:00,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014291046] [2020-10-16 04:50:00,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:00,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 04:50:00,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130600142] [2020-10-16 04:50:00,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 04:50:00,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:00,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 04:50:00,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 04:50:00,731 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 179 [2020-10-16 04:50:00,732 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 42 transitions, 304 flow. Second operand 9 states. [2020-10-16 04:50:00,732 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:00,733 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 179 [2020-10-16 04:50:00,733 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:01,040 INFO L129 PetriNetUnfolder]: 59/222 cut-off events. [2020-10-16 04:50:01,040 INFO L130 PetriNetUnfolder]: For 1063/1195 co-relation queries the response was YES. [2020-10-16 04:50:01,042 INFO L80 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 222 events. 59/222 cut-off events. For 1063/1195 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 1347 event pairs, 1 based on Foata normal form. 32/235 useless extension candidates. Maximal degree in co-relation 840. Up to 70 conditions per place. [2020-10-16 04:50:01,043 INFO L132 encePairwiseOnDemand]: 173/179 looper letters, 10 selfloop transitions, 8 changer transitions 7/52 dead transitions. [2020-10-16 04:50:01,043 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 52 transitions, 452 flow [2020-10-16 04:50:01,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 04:50:01,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-16 04:50:01,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 890 transitions. [2020-10-16 04:50:01,047 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.7102952913008779 [2020-10-16 04:50:01,047 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 890 transitions. [2020-10-16 04:50:01,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 890 transitions. [2020-10-16 04:50:01,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:01,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 890 transitions. [2020-10-16 04:50:01,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 8 states. [2020-10-16 04:50:01,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 8 states. [2020-10-16 04:50:01,053 INFO L81 ComplementDD]: Finished complementDD. Result 8 states. [2020-10-16 04:50:01,053 INFO L185 Difference]: Start difference. First operand has 75 places, 42 transitions, 304 flow. Second operand 7 states and 890 transitions. [2020-10-16 04:50:01,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 52 transitions, 452 flow [2020-10-16 04:50:01,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 380 flow, removed 22 selfloop flow, removed 12 redundant places. [2020-10-16 04:50:01,060 INFO L241 Difference]: Finished difference. Result has 66 places, 42 transitions, 277 flow [2020-10-16 04:50:01,060 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=277, PETRI_PLACES=66, PETRI_TRANSITIONS=42} [2020-10-16 04:50:01,060 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 32 predicate places. [2020-10-16 04:50:01,060 INFO L481 AbstractCegarLoop]: Abstraction has has 66 places, 42 transitions, 277 flow [2020-10-16 04:50:01,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 04:50:01,060 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:01,061 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] [2020-10-16 04:50:01,061 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 04:50:01,061 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 04:50:01,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1952779813, now seen corresponding path program 3 times [2020-10-16 04:50:01,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:01,062 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043794188] [2020-10-16 04:50:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 04:50: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 04:50:01,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043794188] [2020-10-16 04:50:01,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 04:50:01,116 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 04:50:01,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962816667] [2020-10-16 04:50:01,116 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 04:50:01,116 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 04:50:01,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 04:50:01,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 04:50:01,118 INFO L507 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 179 [2020-10-16 04:50:01,118 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 42 transitions, 277 flow. Second operand 4 states. [2020-10-16 04:50:01,118 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2020-10-16 04:50:01,118 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 179 [2020-10-16 04:50:01,119 INFO L71 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2020-10-16 04:50:01,172 INFO L129 PetriNetUnfolder]: 61/282 cut-off events. [2020-10-16 04:50:01,172 INFO L130 PetriNetUnfolder]: For 688/728 co-relation queries the response was YES. [2020-10-16 04:50:01,174 INFO L80 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 282 events. 61/282 cut-off events. For 688/728 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 1982 event pairs, 3 based on Foata normal form. 23/296 useless extension candidates. Maximal degree in co-relation 974. Up to 74 conditions per place. [2020-10-16 04:50:01,175 INFO L132 encePairwiseOnDemand]: 176/179 looper letters, 3 selfloop transitions, 1 changer transitions 1/43 dead transitions. [2020-10-16 04:50:01,175 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 43 transitions, 289 flow [2020-10-16 04:50:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 04:50:01,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-16 04:50:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 610 transitions. [2020-10-16 04:50:01,178 INFO L552 CegarLoopForPetriNet]: DFA transition density 0.8519553072625698 [2020-10-16 04:50:01,178 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 610 transitions. [2020-10-16 04:50:01,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 610 transitions. [2020-10-16 04:50:01,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-16 04:50:01,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 610 transitions. [2020-10-16 04:50:01,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 5 states. [2020-10-16 04:50:01,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result 5 states. [2020-10-16 04:50:01,182 INFO L81 ComplementDD]: Finished complementDD. Result 5 states. [2020-10-16 04:50:01,182 INFO L185 Difference]: Start difference. First operand has 66 places, 42 transitions, 277 flow. Second operand 4 states and 610 transitions. [2020-10-16 04:50:01,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 43 transitions, 289 flow [2020-10-16 04:50:01,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 43 transitions, 271 flow, removed 2 selfloop flow, removed 5 redundant places. [2020-10-16 04:50:01,189 INFO L241 Difference]: Finished difference. Result has 65 places, 42 transitions, 266 flow [2020-10-16 04:50:01,189 INFO L326 CegarLoopForPetriNet]: {PETRI_ALPHABET=179, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2020-10-16 04:50:01,189 INFO L342 CegarLoopForPetriNet]: 34 programPoint places, 31 predicate places. [2020-10-16 04:50:01,189 INFO L481 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 266 flow [2020-10-16 04:50:01,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 04:50:01,189 INFO L247 CegarLoopForPetriNet]: Found error trace [2020-10-16 04:50:01,189 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] [2020-10-16 04:50:01,190 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 04:50:01,190 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 04:50:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 04:50:01,190 INFO L82 PathProgramCache]: Analyzing trace with hash -565449383, now seen corresponding path program 4 times [2020-10-16 04:50:01,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 04:50:01,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383762] [2020-10-16 04:50:01,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 04:50:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:50:01,226 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:50:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 04:50:01,271 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 04:50:01,309 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 04:50:01,309 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 04:50:01,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-10-16 04:50:01,311 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 04:50:01,323 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1015] [1015] L2-->L835: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In63826034 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In63826034 256) 0)) (.cse8 (= (mod ~x$w_buff1_used~0_In63826034 256) 0)) (.cse9 (= (mod ~x$r_buff1_thd0~0_In63826034 256) 0))) (let ((.cse2 (or .cse8 .cse9)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~x$r_buff1_thd0~0_Out63826034 ~x$r_buff1_thd0~0_In63826034) (or (and .cse0 .cse1 (= ~x$w_buff1_used~0_Out63826034 0)) (and .cse2 (= ~x$w_buff1_used~0_In63826034 ~x$w_buff1_used~0_Out63826034))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out63826034 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out63826034 |ULTIMATE.start_assume_abort_if_not_#in~cond_In63826034|) (or (and .cse3 (or (and (= ~x~0_Out63826034 ~x~0_In63826034) .cse2) (and .cse0 (= ~x~0_Out63826034 ~x$w_buff1~0_In63826034) .cse1))) (and .cse4 (= ~x~0_Out63826034 ~x$w_buff0~0_In63826034) .cse5)) (or (and .cse3 (= ~x$w_buff0_used~0_Out63826034 ~x$w_buff0_used~0_In63826034)) (and .cse4 .cse5 (= 0 ~x$w_buff0_used~0_Out63826034))) (= ~x$r_buff0_thd0~0_In63826034 ~x$r_buff0_thd0~0_Out63826034)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In63826034, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In63826034, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In63826034|, ~x$w_buff1~0=~x$w_buff1~0_In63826034, ~x$w_buff1_used~0=~x$w_buff1_used~0_In63826034, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In63826034, ~x~0=~x~0_In63826034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In63826034} OutVars{~x$w_buff0~0=~x$w_buff0~0_In63826034, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out63826034, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out63826034|, ~x$w_buff1~0=~x$w_buff1~0_In63826034, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out63826034|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out63826034, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out63826034|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out63826034|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out63826034|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out63826034, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out63826034, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out63826034|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In63826034|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out63826034, ~x~0=~x~0_Out63826034} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 04:50:01,329 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 04:50:01,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,331 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 04:50:01,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,331 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 04:50:01,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,332 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 04:50:01,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,332 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 04:50:01,332 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,332 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 04:50:01,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,333 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 04:50:01,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,333 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 04:50:01,333 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,334 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 04:50:01,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,334 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 04:50:01,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,334 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 04:50:01,334 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,335 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 04:50:01,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,335 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 04:50:01,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,335 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 04:50:01,335 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,336 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 04:50:01,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,336 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 04:50:01,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,336 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 04:50:01,336 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,337 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 04:50:01,337 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,338 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 04:50:01,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,338 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 04:50:01,338 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,339 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 04:50:01,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,339 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 04:50:01,339 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,339 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 04:50:01,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,340 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 04:50:01,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,340 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 04:50:01,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,340 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 04:50:01,340 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,341 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 04:50:01,341 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 04:50:01,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 04:50:01 BasicIcfg [2020-10-16 04:50:01,398 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 04:50:01,400 INFO L168 Benchmark]: Toolchain (without parser) took 20957.52 ms. Allocated memory was 252.2 MB in the beginning and 609.7 MB in the end (delta: 357.6 MB). Free memory was 208.2 MB in the beginning and 313.4 MB in the end (delta: -105.2 MB). Peak memory consumption was 252.4 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:01,400 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-16 04:50:01,401 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.94 ms. Allocated memory was 252.2 MB in the beginning and 318.8 MB in the end (delta: 66.6 MB). Free memory was 208.2 MB in the beginning and 270.8 MB in the end (delta: -62.6 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:01,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.54 ms. Allocated memory is still 318.8 MB. Free memory was 270.8 MB in the beginning and 268.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:01,402 INFO L168 Benchmark]: Boogie Preprocessor took 41.06 ms. Allocated memory is still 318.8 MB. Free memory was 268.3 MB in the beginning and 265.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:01,403 INFO L168 Benchmark]: RCFGBuilder took 2217.22 ms. Allocated memory was 318.8 MB in the beginning and 360.2 MB in the end (delta: 41.4 MB). Free memory was 265.8 MB in the beginning and 191.8 MB in the end (delta: 73.9 MB). Peak memory consumption was 115.3 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:01,404 INFO L168 Benchmark]: TraceAbstraction took 17859.52 ms. Allocated memory was 360.2 MB in the beginning and 609.7 MB in the end (delta: 249.6 MB). Free memory was 191.8 MB in the beginning and 313.4 MB in the end (delta: -121.5 MB). Peak memory consumption was 128.0 MB. Max. memory is 14.2 GB. [2020-10-16 04:50:01,407 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.44 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 760.94 ms. Allocated memory was 252.2 MB in the beginning and 318.8 MB in the end (delta: 66.6 MB). Free memory was 208.2 MB in the beginning and 270.8 MB in the end (delta: -62.6 MB). Peak memory consumption was 36.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 73.54 ms. Allocated memory is still 318.8 MB. Free memory was 270.8 MB in the beginning and 268.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 41.06 ms. Allocated memory is still 318.8 MB. Free memory was 268.3 MB in the beginning and 265.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2217.22 ms. Allocated memory was 318.8 MB in the beginning and 360.2 MB in the end (delta: 41.4 MB). Free memory was 265.8 MB in the beginning and 191.8 MB in the end (delta: 73.9 MB). Peak memory consumption was 115.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 17859.52 ms. Allocated memory was 360.2 MB in the beginning and 609.7 MB in the end (delta: 249.6 MB). Free memory was 191.8 MB in the beginning and 313.4 MB in the end (delta: -121.5 MB). Peak memory consumption was 128.0 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1232 VarBasedMoverChecksPositive, 111 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 71 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 162 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 11.0s, 102 PlacesBefore, 34 PlacesAfterwards, 94 TransitionsBefore, 25 TransitionsAfterwards, 1806 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 5648 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p1_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L704] 0 int __unbuffered_p2_EBX = 0; [L706] 0 int a = 0; [L707] 0 _Bool main$tmp_guard0; [L708] 0 _Bool main$tmp_guard1; [L710] 0 int x = 0; [L711] 0 _Bool x$flush_delayed; [L712] 0 int x$mem_tmp; [L713] 0 _Bool x$r_buff0_thd0; [L714] 0 _Bool x$r_buff0_thd1; [L715] 0 _Bool x$r_buff0_thd2; [L716] 0 _Bool x$r_buff0_thd3; [L717] 0 _Bool x$r_buff1_thd0; [L718] 0 _Bool x$r_buff1_thd1; [L719] 0 _Bool x$r_buff1_thd2; [L720] 0 _Bool x$r_buff1_thd3; [L721] 0 _Bool x$read_delayed; [L722] 0 int *x$read_delayed_var; [L723] 0 int x$w_buff0; [L724] 0 _Bool x$w_buff0_used; [L725] 0 int x$w_buff1; [L726] 0 _Bool x$w_buff1_used; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L819] 0 pthread_t t1019; [L820] FCALL, FORK 0 pthread_create(&t1019, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L821] 0 pthread_t t1020; [L822] FCALL, FORK 0 pthread_create(&t1020, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L765] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L823] 0 pthread_t t1021; [L824] FCALL, FORK 0 pthread_create(&t1021, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L785] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L788] 3 z = 1 [L791] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L794] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L736] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L775] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L797] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L798] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L799] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L800] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L801] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L801] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L804] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 3 return 0; [L826] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 x$flush_delayed = weak$$choice2 [L840] 0 x$mem_tmp = x [L841] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L842] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L843] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L844] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L845] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L845] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L847] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L848] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L849] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L849] 0 x = x$flush_delayed ? x$mem_tmp : x [L850] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 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: 17.6s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.1s, HoareTripleCheckerStatistics: 73 SDtfs, 38 SDslu, 27 SDs, 0 SdLazy, 483 SolverSat, 127 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=784occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 37991 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...