/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-wmm/mix028_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 10:53:37,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 10:53:37,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 10:53:37,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 10:53:37,508 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 10:53:37,509 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 10:53:37,511 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 10:53:37,514 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 10:53:37,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 10:53:37,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 10:53:37,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 10:53:37,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 10:53:37,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 10:53:37,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 10:53:37,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 10:53:37,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 10:53:37,549 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 10:53:37,550 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 10:53:37,553 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 10:53:37,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 10:53:37,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 10:53:37,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 10:53:37,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 10:53:37,562 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 10:53:37,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 10:53:37,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 10:53:37,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 10:53:37,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 10:53:37,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 10:53:37,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 10:53:37,570 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 10:53:37,571 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 10:53:37,572 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 10:53:37,573 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 10:53:37,574 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 10:53:37,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 10:53:37,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 10:53:37,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 10:53:37,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 10:53:37,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 10:53:37,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 10:53:37,587 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 10:53:37,636 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 10:53:37,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 10:53:37,642 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 10:53:37,642 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 10:53:37,642 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 10:53:37,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 10:53:37,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 10:53:37,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 10:53:37,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 10:53:37,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 10:53:37,645 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 10:53:37,645 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 10:53:37,646 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 10:53:37,646 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 10:53:37,646 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 10:53:37,646 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 10:53:37,647 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 10:53:37,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 10:53:37,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 10:53:37,648 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 10:53:37,648 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 10:53:37,648 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 10:53:37,648 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 10:53:37,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 10:53:37,649 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 10:53:37,649 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-22 10:53:38,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 10:53:38,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 10:53:38,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 10:53:38,112 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 10:53:38,113 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 10:53:38,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix028_power.opt.i [2020-12-22 10:53:38,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5c46f8a/b759b91887254ca3acae960f016b4cc8/FLAGd8c819ddd [2020-12-22 10:53:39,119 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 10:53:39,120 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix028_power.opt.i [2020-12-22 10:53:39,143 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5c46f8a/b759b91887254ca3acae960f016b4cc8/FLAGd8c819ddd [2020-12-22 10:53:39,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d5c46f8a/b759b91887254ca3acae960f016b4cc8 [2020-12-22 10:53:39,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 10:53:39,329 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 10:53:39,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 10:53:39,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 10:53:39,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 10:53:39,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:53:39" (1/1) ... [2020-12-22 10:53:39,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f61394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:39, skipping insertion in model container [2020-12-22 10:53:39,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:53:39" (1/1) ... [2020-12-22 10:53:39,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 10:53:39,437 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 10:53:39,621 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix028_power.opt.i[950,963] [2020-12-22 10:53:40,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:53:40,081 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 10:53:40,115 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix028_power.opt.i[950,963] [2020-12-22 10:53:40,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:53:40,346 INFO L208 MainTranslator]: Completed translation [2020-12-22 10:53:40,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40 WrapperNode [2020-12-22 10:53:40,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 10:53:40,349 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 10:53:40,349 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 10:53:40,349 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 10:53:40,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,478 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 10:53:40,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 10:53:40,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 10:53:40,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 10:53:40,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,523 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,570 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (1/1) ... [2020-12-22 10:53:40,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 10:53:40,582 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 10:53:40,583 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 10:53:40,583 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 10:53:40,584 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (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-12-22 10:53:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 10:53:40,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-22 10:53:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 10:53:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 10:53:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-22 10:53:40,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-22 10:53:40,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-22 10:53:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-22 10:53:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-22 10:53:40,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-22 10:53:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 10:53:40,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-22 10:53:40,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 10:53:40,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 10:53:40,729 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 10:53:43,812 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 10:53:43,812 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-22 10:53:43,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:43 BoogieIcfgContainer [2020-12-22 10:53:43,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 10:53:43,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 10:53:43,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 10:53:43,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 10:53:43,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:53:39" (1/3) ... [2020-12-22 10:53:43,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e41885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:53:43, skipping insertion in model container [2020-12-22 10:53:43,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:53:40" (2/3) ... [2020-12-22 10:53:43,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e41885 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:53:43, skipping insertion in model container [2020-12-22 10:53:43,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:43" (3/3) ... [2020-12-22 10:53:43,825 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_power.opt.i [2020-12-22 10:53:43,833 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 10:53:43,834 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 10:53:43,839 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 10:53:43,840 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 10:53:43,881 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,882 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,882 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,882 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,883 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,883 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,883 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,884 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,885 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,888 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,888 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,889 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,889 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,889 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,890 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,895 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,895 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,896 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,896 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,896 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,897 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,898 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,899 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,900 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,902 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,903 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,904 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,904 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,907 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,907 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,907 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,908 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,908 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,909 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,912 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,913 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,914 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:53:43,917 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-22 10:53:43,938 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-22 10:53:43,963 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 10:53:43,963 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 10:53:43,963 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 10:53:43,964 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 10:53:43,964 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 10:53:43,964 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 10:53:43,964 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 10:53:43,964 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 10:53:43,978 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 10:53:43,984 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 99 transitions, 213 flow [2020-12-22 10:53:43,988 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 99 transitions, 213 flow [2020-12-22 10:53:43,990 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 107 places, 99 transitions, 213 flow [2020-12-22 10:53:44,040 INFO L129 PetriNetUnfolder]: 2/96 cut-off events. [2020-12-22 10:53:44,041 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-22 10:53:44,047 INFO L84 FinitePrefix]: Finished finitePrefix Result has 106 conditions, 96 events. 2/96 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-12-22 10:53:44,051 INFO L116 LiptonReduction]: Number of co-enabled transitions 1770 [2020-12-22 10:53:44,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-22 10:53:44,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:44,210 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-22 10:53:44,211 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:44,316 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:44,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:44,320 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:44,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:44,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:44,450 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:44,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:44,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:44,460 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:44,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:44,464 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:44,465 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:44,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:44,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,472 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:44,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:44,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:44,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:44,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:44,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:53:44,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:44,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,831 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-22 10:53:44,831 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:44,833 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-22 10:53:44,833 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:44,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:44,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:44,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:44,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:46,168 WARN L197 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-12-22 10:53:46,713 WARN L197 SmtUtils]: Spent 541.00 ms on a formula simplification that was a NOOP. DAG size: 186 [2020-12-22 10:53:49,046 WARN L197 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-12-22 10:53:50,113 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 265 [2020-12-22 10:53:50,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-22 10:53:50,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-22 10:53:50,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:50,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,332 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:50,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,382 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:50,383 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:50,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:50,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:50,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:50,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:50,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,582 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:50,582 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:53:50,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:50,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,660 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:50,661 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:50,663 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:50,664 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,665 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:50,665 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,669 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:50,669 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:50,672 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:50,673 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:50,675 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:50,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:50,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:50,679 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,682 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:50,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:50,684 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:50,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:51,140 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-22 10:53:51,264 WARN L197 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-22 10:53:51,875 WARN L197 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2020-12-22 10:53:52,139 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-12-22 10:53:52,195 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:52,196 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,197 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:52,198 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,201 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:52,201 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:53:52,205 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:52,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,266 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:52,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,279 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:52,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:52,283 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:52,287 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:52,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,289 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:52,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:52,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:52,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:52,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,458 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-22 10:53:52,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,459 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-22 10:53:52,460 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,461 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-22 10:53:52,461 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:52,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:52,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:52,510 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,511 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:52,512 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,551 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-22 10:53:52,552 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:52,553 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-22 10:53:52,553 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:52,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:52,677 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:52,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 2, 1] term [2020-12-22 10:53:52,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:52,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-12-22 10:53:52,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:52,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:52,849 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,852 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,856 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:52,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:52,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:52,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:52,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:52,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:52,868 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:52,872 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:52,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:52,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:52,954 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:52,954 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:53:52,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:52,958 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:53,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:53,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,045 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:53,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:53:53,048 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:53,049 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:53,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,111 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,112 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,116 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,116 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:53,118 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,118 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:53,119 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,120 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:53,123 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:53,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:53,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,127 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:53,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:53,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:53,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:53,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:53,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,782 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:53,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,787 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,787 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,790 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,791 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:53,793 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,793 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:53,795 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 5, 4, 5, 4, 3, 2, 3, 2, 1] term [2020-12-22 10:53:53,796 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:53:53,800 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:53,801 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,802 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:53,805 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 4, 5, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-12-22 10:53:53,808 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:53,876 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,878 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:53,879 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:53,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:53,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:53:53,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-12-22 10:53:53,885 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,059 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:54,060 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,061 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:54,061 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,090 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:54,091 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,092 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:54,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:54,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:54,136 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:54,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:54,175 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,327 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-12-22 10:53:54,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,328 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-12-22 10:53:54,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:54,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:54,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:54,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-22 10:53:54,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:55,111 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:55,112 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:55,112 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:55,113 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:55,137 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:55,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:55,138 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:55,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:55,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:55,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:55,286 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:55,286 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:55,288 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:55,288 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:55,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:55,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:55,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:55,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:55,313 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:55,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:55,315 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:55,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:55,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:55,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:55,483 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-22 10:53:55,609 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-22 10:53:55,870 WARN L197 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-22 10:53:56,169 WARN L197 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-22 10:53:56,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:56,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:56,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:56,230 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:56,262 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:53:56,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:56,264 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:53:56,264 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:53:56,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:56,299 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:56,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:56,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:56,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:56,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:56,305 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:56,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:56,332 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:56,332 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:56,333 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:56,333 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:53:56,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:56,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:56,338 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:53:56,338 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:53:56,569 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-22 10:53:56,746 WARN L197 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2020-12-22 10:53:58,281 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-22 10:53:58,428 WARN L197 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-22 10:53:58,565 WARN L197 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-22 10:53:58,709 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2020-12-22 10:53:59,244 WARN L197 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-22 10:53:59,505 WARN L197 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-22 10:54:00,012 WARN L197 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-22 10:54:00,261 WARN L197 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-22 10:54:00,268 INFO L131 LiptonReduction]: Checked pairs total: 5519 [2020-12-22 10:54:00,269 INFO L133 LiptonReduction]: Total number of compositions: 81 [2020-12-22 10:54:00,278 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-12-22 10:54:00,371 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1152 states. [2020-12-22 10:54:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states. [2020-12-22 10:54:00,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-22 10:54:00,381 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:00,383 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-22 10:54:00,383 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:00,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:00,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1021400768, now seen corresponding path program 1 times [2020-12-22 10:54:00,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:00,403 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468595652] [2020-12-22 10:54:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:00,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:00,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468595652] [2020-12-22 10:54:00,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:00,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:54:00,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380467503] [2020-12-22 10:54:00,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:54:00,761 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:00,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:54:00,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:54:00,782 INFO L87 Difference]: Start difference. First operand 1152 states. Second operand 3 states. [2020-12-22 10:54:00,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:00,909 INFO L93 Difference]: Finished difference Result 962 states and 3090 transitions. [2020-12-22 10:54:00,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:54:00,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-22 10:54:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:00,962 INFO L225 Difference]: With dead ends: 962 [2020-12-22 10:54:00,962 INFO L226 Difference]: Without dead ends: 812 [2020-12-22 10:54:00,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:54:01,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-12-22 10:54:01,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-12-22 10:54:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-12-22 10:54:01,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2020-12-22 10:54:01,111 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 5 [2020-12-22 10:54:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:01,111 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2020-12-22 10:54:01,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:54:01,112 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2020-12-22 10:54:01,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 10:54:01,114 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:01,114 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:01,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 10:54:01,115 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:01,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:01,116 INFO L82 PathProgramCache]: Analyzing trace with hash 95194119, now seen corresponding path program 1 times [2020-12-22 10:54:01,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:01,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10536836] [2020-12-22 10:54:01,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:01,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:01,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10536836] [2020-12-22 10:54:01,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:01,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 10:54:01,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466186371] [2020-12-22 10:54:01,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:54:01,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:54:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:54:01,499 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 4 states. [2020-12-22 10:54:01,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:01,560 INFO L93 Difference]: Finished difference Result 862 states and 2630 transitions. [2020-12-22 10:54:01,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:54:01,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-22 10:54:01,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:01,569 INFO L225 Difference]: With dead ends: 862 [2020-12-22 10:54:01,569 INFO L226 Difference]: Without dead ends: 712 [2020-12-22 10:54:01,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:54:01,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2020-12-22 10:54:01,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2020-12-22 10:54:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-12-22 10:54:01,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2215 transitions. [2020-12-22 10:54:01,631 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2215 transitions. Word has length 10 [2020-12-22 10:54:01,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:01,632 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 2215 transitions. [2020-12-22 10:54:01,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:54:01,632 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2215 transitions. [2020-12-22 10:54:01,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-22 10:54:01,645 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:01,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:01,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 10:54:01,645 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:01,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:01,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1249705605, now seen corresponding path program 1 times [2020-12-22 10:54:01,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:01,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332429487] [2020-12-22 10:54:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:01,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:01,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332429487] [2020-12-22 10:54:01,902 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:01,902 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:54:01,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921076256] [2020-12-22 10:54:01,903 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:54:01,903 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:01,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:54:01,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:54:01,904 INFO L87 Difference]: Start difference. First operand 712 states and 2215 transitions. Second operand 5 states. [2020-12-22 10:54:02,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:02,079 INFO L93 Difference]: Finished difference Result 804 states and 2422 transitions. [2020-12-22 10:54:02,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:54:02,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-22 10:54:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:02,088 INFO L225 Difference]: With dead ends: 804 [2020-12-22 10:54:02,088 INFO L226 Difference]: Without dead ends: 704 [2020-12-22 10:54:02,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:54:02,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2020-12-22 10:54:02,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 704. [2020-12-22 10:54:02,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2020-12-22 10:54:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 2183 transitions. [2020-12-22 10:54:02,164 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 2183 transitions. Word has length 12 [2020-12-22 10:54:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:02,164 INFO L481 AbstractCegarLoop]: Abstraction has 704 states and 2183 transitions. [2020-12-22 10:54:02,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:54:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 2183 transitions. [2020-12-22 10:54:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 10:54:02,167 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:02,167 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:02,167 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 10:54:02,168 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash -2108317782, now seen corresponding path program 1 times [2020-12-22 10:54:02,169 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:02,170 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741843441] [2020-12-22 10:54:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:02,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:02,399 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741843441] [2020-12-22 10:54:02,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:02,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:54:02,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332470049] [2020-12-22 10:54:02,400 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:54:02,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:02,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:54:02,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:54:02,401 INFO L87 Difference]: Start difference. First operand 704 states and 2183 transitions. Second operand 5 states. [2020-12-22 10:54:02,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:02,559 INFO L93 Difference]: Finished difference Result 768 states and 2311 transitions. [2020-12-22 10:54:02,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:54:02,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-22 10:54:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:02,567 INFO L225 Difference]: With dead ends: 768 [2020-12-22 10:54:02,568 INFO L226 Difference]: Without dead ends: 688 [2020-12-22 10:54:02,568 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:54:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2020-12-22 10:54:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 688. [2020-12-22 10:54:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2020-12-22 10:54:02,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 2119 transitions. [2020-12-22 10:54:02,599 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 2119 transitions. Word has length 13 [2020-12-22 10:54:02,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:02,599 INFO L481 AbstractCegarLoop]: Abstraction has 688 states and 2119 transitions. [2020-12-22 10:54:02,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:54:02,599 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 2119 transitions. [2020-12-22 10:54:02,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-22 10:54:02,601 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:02,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:02,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 10:54:02,602 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:02,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:02,603 INFO L82 PathProgramCache]: Analyzing trace with hash 507810598, now seen corresponding path program 1 times [2020-12-22 10:54:02,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:02,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834813687] [2020-12-22 10:54:02,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:02,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:02,838 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834813687] [2020-12-22 10:54:02,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:02,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:54:02,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834890851] [2020-12-22 10:54:02,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:54:02,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:54:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:54:02,841 INFO L87 Difference]: Start difference. First operand 688 states and 2119 transitions. Second operand 6 states. [2020-12-22 10:54:03,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:03,255 INFO L93 Difference]: Finished difference Result 750 states and 2250 transitions. [2020-12-22 10:54:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:54:03,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-12-22 10:54:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:03,262 INFO L225 Difference]: With dead ends: 750 [2020-12-22 10:54:03,262 INFO L226 Difference]: Without dead ends: 666 [2020-12-22 10:54:03,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:54:03,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2020-12-22 10:54:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 656. [2020-12-22 10:54:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2020-12-22 10:54:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 2009 transitions. [2020-12-22 10:54:03,291 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 2009 transitions. Word has length 14 [2020-12-22 10:54:03,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:03,291 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 2009 transitions. [2020-12-22 10:54:03,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:54:03,291 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 2009 transitions. [2020-12-22 10:54:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 10:54:03,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:03,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:03,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 10:54:03,294 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:03,294 INFO L82 PathProgramCache]: Analyzing trace with hash 662740777, now seen corresponding path program 1 times [2020-12-22 10:54:03,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:03,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004763072] [2020-12-22 10:54:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:03,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004763072] [2020-12-22 10:54:03,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:03,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:54:03,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231717988] [2020-12-22 10:54:03,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:54:03,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:03,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:54:03,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:54:03,500 INFO L87 Difference]: Start difference. First operand 656 states and 2009 transitions. Second operand 7 states. [2020-12-22 10:54:03,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:03,742 INFO L93 Difference]: Finished difference Result 758 states and 2300 transitions. [2020-12-22 10:54:03,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:54:03,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-22 10:54:03,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:03,749 INFO L225 Difference]: With dead ends: 758 [2020-12-22 10:54:03,749 INFO L226 Difference]: Without dead ends: 706 [2020-12-22 10:54:03,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:54:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2020-12-22 10:54:03,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 706. [2020-12-22 10:54:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-12-22 10:54:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2178 transitions. [2020-12-22 10:54:03,783 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2178 transitions. Word has length 15 [2020-12-22 10:54:03,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:03,784 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 2178 transitions. [2020-12-22 10:54:03,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:54:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2178 transitions. [2020-12-22 10:54:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 10:54:03,787 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:03,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:03,787 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 10:54:03,787 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:03,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:03,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1437724627, now seen corresponding path program 2 times [2020-12-22 10:54:03,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:03,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617042576] [2020-12-22 10:54:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:03,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:03,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:03,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617042576] [2020-12-22 10:54:03,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:03,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:54:03,959 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248604261] [2020-12-22 10:54:03,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:54:03,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:03,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:54:03,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:54:03,960 INFO L87 Difference]: Start difference. First operand 706 states and 2178 transitions. Second operand 7 states. [2020-12-22 10:54:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:04,175 INFO L93 Difference]: Finished difference Result 772 states and 2339 transitions. [2020-12-22 10:54:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:54:04,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-22 10:54:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:04,183 INFO L225 Difference]: With dead ends: 772 [2020-12-22 10:54:04,183 INFO L226 Difference]: Without dead ends: 720 [2020-12-22 10:54:04,184 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:54:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2020-12-22 10:54:04,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 702. [2020-12-22 10:54:04,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2020-12-22 10:54:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 2166 transitions. [2020-12-22 10:54:04,214 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 2166 transitions. Word has length 15 [2020-12-22 10:54:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:04,214 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 2166 transitions. [2020-12-22 10:54:04,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:54:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 2166 transitions. [2020-12-22 10:54:04,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 10:54:04,217 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:04,217 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:04,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 10:54:04,218 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:04,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:04,218 INFO L82 PathProgramCache]: Analyzing trace with hash 143265631, now seen corresponding path program 3 times [2020-12-22 10:54:04,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:04,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841195205] [2020-12-22 10:54:04,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:04,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841195205] [2020-12-22 10:54:04,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:04,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:54:04,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372578411] [2020-12-22 10:54:04,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:54:04,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:04,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:54:04,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:54:04,449 INFO L87 Difference]: Start difference. First operand 702 states and 2166 transitions. Second operand 7 states. [2020-12-22 10:54:04,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:04,717 INFO L93 Difference]: Finished difference Result 830 states and 2506 transitions. [2020-12-22 10:54:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:54:04,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-12-22 10:54:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:04,725 INFO L225 Difference]: With dead ends: 830 [2020-12-22 10:54:04,726 INFO L226 Difference]: Without dead ends: 770 [2020-12-22 10:54:04,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:54:04,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2020-12-22 10:54:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 706. [2020-12-22 10:54:04,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2020-12-22 10:54:04,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 2152 transitions. [2020-12-22 10:54:04,757 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 2152 transitions. Word has length 15 [2020-12-22 10:54:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:04,757 INFO L481 AbstractCegarLoop]: Abstraction has 706 states and 2152 transitions. [2020-12-22 10:54:04,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:54:04,758 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 2152 transitions. [2020-12-22 10:54:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 10:54:04,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:04,760 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:04,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 10:54:04,761 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:04,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:04,761 INFO L82 PathProgramCache]: Analyzing trace with hash 2098862187, now seen corresponding path program 1 times [2020-12-22 10:54:04,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:04,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415912814] [2020-12-22 10:54:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:04,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:04,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415912814] [2020-12-22 10:54:04,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:04,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:54:04,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183706787] [2020-12-22 10:54:04,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:54:04,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:04,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:54:04,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:54:04,844 INFO L87 Difference]: Start difference. First operand 706 states and 2152 transitions. Second operand 4 states. [2020-12-22 10:54:04,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:04,885 INFO L93 Difference]: Finished difference Result 650 states and 1752 transitions. [2020-12-22 10:54:04,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:54:04,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-22 10:54:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:04,890 INFO L225 Difference]: With dead ends: 650 [2020-12-22 10:54:04,890 INFO L226 Difference]: Without dead ends: 482 [2020-12-22 10:54:04,890 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:54:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-12-22 10:54:04,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-12-22 10:54:04,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-12-22 10:54:04,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1256 transitions. [2020-12-22 10:54:04,909 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1256 transitions. Word has length 15 [2020-12-22 10:54:04,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:04,909 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1256 transitions. [2020-12-22 10:54:04,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:54:04,909 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1256 transitions. [2020-12-22 10:54:04,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:54:04,911 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:04,911 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:04,911 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 10:54:04,911 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:04,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:04,912 INFO L82 PathProgramCache]: Analyzing trace with hash -408767852, now seen corresponding path program 1 times [2020-12-22 10:54:04,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:04,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643782069] [2020-12-22 10:54:04,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:04,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:04,994 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643782069] [2020-12-22 10:54:04,995 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:04,995 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:54:04,995 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109870946] [2020-12-22 10:54:04,995 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:54:04,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:04,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:54:04,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:54:04,996 INFO L87 Difference]: Start difference. First operand 482 states and 1256 transitions. Second operand 5 states. [2020-12-22 10:54:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:05,051 INFO L93 Difference]: Finished difference Result 366 states and 877 transitions. [2020-12-22 10:54:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 10:54:05,051 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-22 10:54:05,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:05,054 INFO L225 Difference]: With dead ends: 366 [2020-12-22 10:54:05,054 INFO L226 Difference]: Without dead ends: 286 [2020-12-22 10:54:05,055 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:54:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2020-12-22 10:54:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 268. [2020-12-22 10:54:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-12-22 10:54:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 623 transitions. [2020-12-22 10:54:05,066 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 623 transitions. Word has length 16 [2020-12-22 10:54:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:05,067 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 623 transitions. [2020-12-22 10:54:05,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:54:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 623 transitions. [2020-12-22 10:54:05,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:54:05,068 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:05,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:05,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 10:54:05,069 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:05,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:05,069 INFO L82 PathProgramCache]: Analyzing trace with hash 236318483, now seen corresponding path program 1 times [2020-12-22 10:54:05,070 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:05,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983715864] [2020-12-22 10:54:05,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:05,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:05,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:05,184 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983715864] [2020-12-22 10:54:05,184 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:05,184 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:54:05,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997131440] [2020-12-22 10:54:05,185 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:54:05,185 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:54:05,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:54:05,186 INFO L87 Difference]: Start difference. First operand 268 states and 623 transitions. Second operand 6 states. [2020-12-22 10:54:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:05,255 INFO L93 Difference]: Finished difference Result 235 states and 555 transitions. [2020-12-22 10:54:05,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:54:05,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-22 10:54:05,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:05,258 INFO L225 Difference]: With dead ends: 235 [2020-12-22 10:54:05,258 INFO L226 Difference]: Without dead ends: 220 [2020-12-22 10:54:05,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:54:05,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-12-22 10:54:05,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 216. [2020-12-22 10:54:05,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2020-12-22 10:54:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 519 transitions. [2020-12-22 10:54:05,267 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 519 transitions. Word has length 19 [2020-12-22 10:54:05,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:05,268 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 519 transitions. [2020-12-22 10:54:05,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:54:05,268 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 519 transitions. [2020-12-22 10:54:05,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:54:05,269 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:05,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:05,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 10:54:05,270 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:05,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:05,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1087782343, now seen corresponding path program 1 times [2020-12-22 10:54:05,271 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:05,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963151540] [2020-12-22 10:54:05,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:05,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:05,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963151540] [2020-12-22 10:54:05,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:05,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 10:54:05,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450835648] [2020-12-22 10:54:05,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:54:05,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:05,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:54:05,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:54:05,499 INFO L87 Difference]: Start difference. First operand 216 states and 519 transitions. Second operand 8 states. [2020-12-22 10:54:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:05,814 INFO L93 Difference]: Finished difference Result 291 states and 681 transitions. [2020-12-22 10:54:05,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-22 10:54:05,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-22 10:54:05,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:05,816 INFO L225 Difference]: With dead ends: 291 [2020-12-22 10:54:05,817 INFO L226 Difference]: Without dead ends: 114 [2020-12-22 10:54:05,817 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2020-12-22 10:54:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2020-12-22 10:54:05,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2020-12-22 10:54:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-12-22 10:54:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 223 transitions. [2020-12-22 10:54:05,823 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 223 transitions. Word has length 23 [2020-12-22 10:54:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:05,823 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 223 transitions. [2020-12-22 10:54:05,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:54:05,823 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 223 transitions. [2020-12-22 10:54:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:54:05,824 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:05,824 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:05,825 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 10:54:05,825 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:05,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:05,826 INFO L82 PathProgramCache]: Analyzing trace with hash 153825375, now seen corresponding path program 2 times [2020-12-22 10:54:05,826 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:05,826 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899642779] [2020-12-22 10:54:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:54:06,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 10:54:06,097 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899642779] [2020-12-22 10:54:06,097 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:54:06,098 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 10:54:06,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603937145] [2020-12-22 10:54:06,098 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 10:54:06,098 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:54:06,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 10:54:06,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:54:06,099 INFO L87 Difference]: Start difference. First operand 108 states and 223 transitions. Second operand 8 states. [2020-12-22 10:54:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:54:06,332 INFO L93 Difference]: Finished difference Result 129 states and 259 transitions. [2020-12-22 10:54:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:54:06,333 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-12-22 10:54:06,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:54:06,334 INFO L225 Difference]: With dead ends: 129 [2020-12-22 10:54:06,334 INFO L226 Difference]: Without dead ends: 86 [2020-12-22 10:54:06,335 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-22 10:54:06,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2020-12-22 10:54:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2020-12-22 10:54:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-12-22 10:54:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 171 transitions. [2020-12-22 10:54:06,340 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 171 transitions. Word has length 23 [2020-12-22 10:54:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:54:06,341 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 171 transitions. [2020-12-22 10:54:06,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 10:54:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 171 transitions. [2020-12-22 10:54:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:54:06,342 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:54:06,342 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:54:06,342 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 10:54:06,343 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:54:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:54:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1530465991, now seen corresponding path program 3 times [2020-12-22 10:54:06,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:54:06,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457484134] [2020-12-22 10:54:06,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:54:06,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:54:06,417 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:54:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:54:06,526 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:54:06,612 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 10:54:06,613 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 10:54:06,613 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 10:54:06,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 10:54:06 BasicIcfg [2020-12-22 10:54:06,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 10:54:06,803 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 10:54:06,803 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 10:54:06,804 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 10:54:06,805 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:53:43" (3/4) ... [2020-12-22 10:54:06,810 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 10:54:06,980 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix028_power.opt.i-witness.graphml [2020-12-22 10:54:06,980 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 10:54:06,982 INFO L168 Benchmark]: Toolchain (without parser) took 27652.24 ms. Allocated memory was 153.1 MB in the beginning and 458.2 MB in the end (delta: 305.1 MB). Free memory was 127.8 MB in the beginning and 366.0 MB in the end (delta: -238.2 MB). Peak memory consumption was 67.2 MB. Max. memory is 8.0 GB. [2020-12-22 10:54:06,982 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 153.1 MB. Free memory is still 125.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 10:54:06,983 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1014.51 ms. Allocated memory is still 153.1 MB. Free memory was 127.7 MB in the beginning and 125.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 27.5 MB. Max. memory is 8.0 GB. [2020-12-22 10:54:06,983 INFO L168 Benchmark]: Boogie Procedure Inliner took 130.32 ms. Allocated memory is still 153.1 MB. Free memory was 124.6 MB in the beginning and 122.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:54:06,983 INFO L168 Benchmark]: Boogie Preprocessor took 102.00 ms. Allocated memory is still 153.1 MB. Free memory was 122.0 MB in the beginning and 119.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:54:06,984 INFO L168 Benchmark]: RCFGBuilder took 3233.02 ms. Allocated memory was 153.1 MB in the beginning and 215.0 MB in the end (delta: 61.9 MB). Free memory was 119.4 MB in the beginning and 121.7 MB in the end (delta: -2.4 MB). Peak memory consumption was 77.9 MB. Max. memory is 8.0 GB. [2020-12-22 10:54:06,984 INFO L168 Benchmark]: TraceAbstraction took 22985.14 ms. Allocated memory was 215.0 MB in the beginning and 458.2 MB in the end (delta: 243.3 MB). Free memory was 121.2 MB in the beginning and 380.1 MB in the end (delta: -258.9 MB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 10:54:06,985 INFO L168 Benchmark]: Witness Printer took 176.85 ms. Allocated memory is still 458.2 MB. Free memory was 380.1 MB in the beginning and 366.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-12-22 10:54:06,989 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 153.1 MB. Free memory is still 125.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1014.51 ms. Allocated memory is still 153.1 MB. Free memory was 127.7 MB in the beginning and 125.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 27.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 130.32 ms. Allocated memory is still 153.1 MB. Free memory was 124.6 MB in the beginning and 122.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 102.00 ms. Allocated memory is still 153.1 MB. Free memory was 122.0 MB in the beginning and 119.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3233.02 ms. Allocated memory was 153.1 MB in the beginning and 215.0 MB in the end (delta: 61.9 MB). Free memory was 119.4 MB in the beginning and 121.7 MB in the end (delta: -2.4 MB). Peak memory consumption was 77.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 22985.14 ms. Allocated memory was 215.0 MB in the beginning and 458.2 MB in the end (delta: 243.3 MB). Free memory was 121.2 MB in the beginning and 380.1 MB in the end (delta: -258.9 MB). There was no memory consumed. Max. memory is 8.0 GB. * Witness Printer took 176.85 ms. Allocated memory is still 458.2 MB. Free memory was 380.1 MB in the beginning and 366.0 MB in the end (delta: 14.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1253 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 47 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.1s, 160 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 16.2s, 107 PlacesBefore, 38 PlacesAfterwards, 99 TransitionsBefore, 29 TransitionsAfterwards, 1770 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 5519 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L823] 0 pthread_t t748; [L824] FCALL, FORK 0 pthread_create(&t748, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L825] 0 pthread_t t749; [L826] FCALL, FORK 0 pthread_create(&t749, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L827] 0 pthread_t t750; [L828] FCALL, FORK 0 pthread_create(&t750, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L792] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z=0] [L795] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z=0] [L798] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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=2, z=1] [L778] 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) [L778] 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) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L780] 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 [L781] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L782] 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 [L749] 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) [L749] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L749] 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) [L749] 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) [L750] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L751] 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 [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L753] 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 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L801] 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) [L801] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L801] 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) [L801] 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) [L802] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L802] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L803] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L803] 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 [L804] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L804] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L805] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L805] 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 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L834] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L834] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L835] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L836] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L837] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L838] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L841] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L842] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L843] 0 x$flush_delayed = weak$$choice2 [L844] 0 x$mem_tmp = x [L845] 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) [L845] 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) [L846] 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)) [L846] 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)) [L847] 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)) [L847] 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)) [L848] 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)) [L848] 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)) [L849] 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)) [L849] 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)) [L850] 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)) [L850] 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)) [L851] 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)) [L851] 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)) [L852] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L853] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L853] 0 x = x$flush_delayed ? x$mem_tmp : x [L854] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, 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=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 22.6s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 16.4s, HoareTripleCheckerStatistics: 419 SDtfs, 464 SDslu, 977 SDs, 0 SdLazy, 542 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1152occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 120 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 182 ConstructedInterpolants, 0 QuantifiedInterpolants, 24612 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...