/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/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 10:58:19,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 10:58:19,482 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 10:58:19,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 10:58:19,529 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 10:58:19,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 10:58:19,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 10:58:19,536 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 10:58:19,538 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 10:58:19,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 10:58:19,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 10:58:19,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 10:58:19,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 10:58:19,545 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 10:58:19,546 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 10:58:19,561 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 10:58:19,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 10:58:19,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 10:58:19,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 10:58:19,569 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 10:58:19,571 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 10:58:19,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 10:58:19,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 10:58:19,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 10:58:19,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 10:58:19,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 10:58:19,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 10:58:19,583 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 10:58:19,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 10:58:19,585 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 10:58:19,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 10:58:19,587 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 10:58:19,588 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 10:58:19,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 10:58:19,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 10:58:19,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 10:58:19,592 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 10:58:19,593 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 10:58:19,593 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 10:58:19,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 10:58:19,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 10:58:19,597 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:58:19,632 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 10:58:19,633 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 10:58:19,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 10:58:19,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 10:58:19,638 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 10:58:19,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 10:58:19,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 10:58:19,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 10:58:19,639 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 10:58:19,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 10:58:19,640 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 10:58:19,640 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 10:58:19,641 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 10:58:19,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 10:58:19,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 10:58:19,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 10:58:19,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 10:58:19,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 10:58:19,644 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 10:58:19,644 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 10:58:19,644 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 10:58:19,644 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 10:58:19,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 10:58:19,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 10:58:19,645 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 10:58:19,645 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:58:20,101 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 10:58:20,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 10:58:20,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 10:58:20,152 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 10:58:20,153 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 10:58:20,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix046_power.opt.i [2020-12-22 10:58:20,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b63423a/40c11860dabb4798a2126f67ddd0027c/FLAG849549889 [2020-12-22 10:58:21,095 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 10:58:21,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046_power.opt.i [2020-12-22 10:58:21,118 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b63423a/40c11860dabb4798a2126f67ddd0027c/FLAG849549889 [2020-12-22 10:58:21,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3b63423a/40c11860dabb4798a2126f67ddd0027c [2020-12-22 10:58:21,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 10:58:21,142 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 10:58:21,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 10:58:21,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 10:58:21,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 10:58:21,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:58:21" (1/1) ... [2020-12-22 10:58:21,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e327388 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:21, skipping insertion in model container [2020-12-22 10:58:21,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 10:58:21" (1/1) ... [2020-12-22 10:58:21,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 10:58:21,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 10:58:21,399 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/mix046_power.opt.i[950,963] [2020-12-22 10:58:21,832 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:58:21,854 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 10:58:21,872 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/mix046_power.opt.i[950,963] [2020-12-22 10:58:21,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 10:58:22,109 INFO L208 MainTranslator]: Completed translation [2020-12-22 10:58:22,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22 WrapperNode [2020-12-22 10:58:22,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 10:58:22,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 10:58:22,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 10:58:22,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 10:58:22,128 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:58:22" (1/1) ... [2020-12-22 10:58:22,179 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:58:22" (1/1) ... [2020-12-22 10:58:22,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 10:58:22,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 10:58:22,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 10:58:22,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 10:58:22,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (1/1) ... [2020-12-22 10:58:22,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (1/1) ... [2020-12-22 10:58:22,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (1/1) ... [2020-12-22 10:58:22,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (1/1) ... [2020-12-22 10:58:22,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (1/1) ... [2020-12-22 10:58:22,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (1/1) ... [2020-12-22 10:58:22,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (1/1) ... [2020-12-22 10:58:22,277 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 10:58:22,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 10:58:22,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 10:58:22,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 10:58:22,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (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:58:22,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 10:58:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-22 10:58:22,449 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 10:58:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 10:58:22,450 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-22 10:58:22,451 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-22 10:58:22,451 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-22 10:58:22,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-22 10:58:22,453 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-22 10:58:22,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-22 10:58:22,454 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-22 10:58:22,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-22 10:58:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 10:58:22,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-22 10:58:22,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 10:58:22,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 10:58:22,461 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:58:25,001 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 10:58:25,001 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-22 10:58:25,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:58:25 BoogieIcfgContainer [2020-12-22 10:58:25,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 10:58:25,006 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 10:58:25,006 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 10:58:25,010 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 10:58:25,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 10:58:21" (1/3) ... [2020-12-22 10:58:25,011 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce4ab28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:58:25, skipping insertion in model container [2020-12-22 10:58:25,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 10:58:22" (2/3) ... [2020-12-22 10:58:25,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce4ab28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 10:58:25, skipping insertion in model container [2020-12-22 10:58:25,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:58:25" (3/3) ... [2020-12-22 10:58:25,014 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2020-12-22 10:58:25,022 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 10:58:25,022 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 10:58:25,028 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 10:58:25,029 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 10:58:25,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,070 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,070 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,071 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,071 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,071 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,071 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,072 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,073 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,074 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,074 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,075 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,076 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,082 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,082 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,082 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,083 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,083 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,084 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,084 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,084 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,085 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,085 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,085 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,086 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,087 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,087 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,087 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,087 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,089 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,090 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,093 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,093 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,095 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,095 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,098 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,098 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,103 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,104 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,106 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 10:58:25,108 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-22 10:58:25,129 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-22 10:58:25,154 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 10:58:25,154 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 10:58:25,154 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 10:58:25,154 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 10:58:25,155 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 10:58:25,155 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 10:58:25,155 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 10:58:25,155 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 10:58:25,170 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 10:58:25,173 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 117 transitions, 254 flow [2020-12-22 10:58:25,177 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 117 transitions, 254 flow [2020-12-22 10:58:25,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 128 places, 117 transitions, 254 flow [2020-12-22 10:58:25,236 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2020-12-22 10:58:25,236 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-22 10:58:25,242 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. [2020-12-22 10:58:25,247 INFO L116 LiptonReduction]: Number of co-enabled transitions 2598 [2020-12-22 10:58:25,529 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:25,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:25,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:25,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:25,589 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 10:58:25,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:25,592 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 10:58:25,592 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:25,594 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2020-12-22 10:58:25,595 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:25,667 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:25,668 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:25,673 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:25,675 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:26,906 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-12-22 10:58:27,926 WARN L197 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 188 DAG size of output: 187 [2020-12-22 10:58:30,377 WARN L197 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 314 DAG size of output: 269 [2020-12-22 10:58:31,437 WARN L197 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 266 [2020-12-22 10:58:31,508 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:58:31,509 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:31,510 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:58:31,511 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:31,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:31,559 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:31,560 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:31,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:31,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:31,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:31,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:31,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:31,916 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:31,917 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:31,918 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:31,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:32,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:32,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,050 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-22 10:58:32,050 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:32,051 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-22 10:58:32,051 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:32,246 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:32,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,247 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:32,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,290 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:32,291 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,291 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:32,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,540 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-12-22 10:58:32,727 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-22 10:58:32,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:32,729 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-22 10:58:32,729 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:32,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:32,769 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,770 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:32,771 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,917 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:32,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:32,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:32,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:32,977 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:32,978 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:33,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:33,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,067 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:33,068 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:33,069 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:33,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,230 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:33,231 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,265 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:33,265 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,267 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:33,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:33,335 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:33,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:33,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:33,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:33,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:58:33,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:33,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:58:33,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:33,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 10:58:33,353 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-22 10:58:33,354 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-22 10:58:33,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 5, 6, 5, 6, 5, 6, 5, 3, 2, 1] term [2020-12-22 10:58:33,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:33,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:33,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-22 10:58:33,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:58:33,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-22 10:58:33,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:33,580 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-12-22 10:58:33,580 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:33,980 WARN L197 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-22 10:58:34,093 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-12-22 10:58:34,637 WARN L197 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-22 10:58:34,853 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-22 10:58:34,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:34,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:34,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:34,960 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:34,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-22 10:58:34,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:34,987 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-22 10:58:34,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:35,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:35,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,078 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:35,078 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:35,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:35,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,247 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:35,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,253 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:35,253 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:35,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:35,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,342 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:35,343 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:35,345 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:35,345 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,346 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:35,346 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,349 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:35,350 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,351 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:35,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:35,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:35,357 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,358 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:35,359 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:35,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:35,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,434 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-22 10:58:35,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:58:35,437 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-22 10:58:35,438 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:35,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:35,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:35,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-22 10:58:35,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 10:58:35,986 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 6, 5, 6, 5, 1] term [2020-12-22 10:58:35,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:36,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,030 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,032 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,032 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,039 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 6, 5, 6, 5, 6, 5, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,043 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:36,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:36,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,315 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:36,316 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,317 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:36,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:36,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,352 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:36,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,386 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:36,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,388 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:36,388 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,413 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:36,414 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,414 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:36,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:36,419 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:58:36,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:36,441 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,442 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:36,442 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,443 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:36,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:36,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:36,447 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:58:36,448 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:36,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-12-22 10:58:36,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:36,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-12-22 10:58:36,578 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:36,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:36,605 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,606 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:36,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:36,760 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-22 10:58:36,881 WARN L197 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-12-22 10:58:37,103 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 10:58:37,334 WARN L197 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2020-12-22 10:58:37,401 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:37,401 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:37,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,466 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:37,467 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:37,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,500 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:37,501 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,502 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:37,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,532 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:37,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,533 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:37,533 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:58:37,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:58:37,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,614 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:37,614 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,615 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:37,616 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,691 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:37,692 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:37,693 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:37,693 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:37,695 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:37,695 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:37,697 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:58:37,698 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:37,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:37,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:37,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:37,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:37,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:37,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:37,724 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:58:37,725 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:37,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:37,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:37,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:37,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:38,027 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:38,029 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,312 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,312 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,313 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,313 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,314 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,315 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,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:58:38,317 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,335 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,336 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,337 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,337 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,339 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,339 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,341 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,341 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,367 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,372 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:58:38,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,395 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,399 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:58:38,399 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,676 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,676 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,680 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,681 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,683 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:58:38,683 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,863 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,889 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,892 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:58:38,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,919 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,922 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,922 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,924 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:58:38,924 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 10:58:38,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,943 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,943 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 10:58:38,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,945 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:38,946 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 10:58:38,946 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:39,234 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-12-22 10:58:39,457 WARN L197 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2020-12-22 10:58:40,128 WARN L197 SmtUtils]: Spent 558.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2020-12-22 10:58:40,707 WARN L197 SmtUtils]: Spent 551.00 ms on a formula simplification that was a NOOP. DAG size: 190 [2020-12-22 10:58:41,810 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 269 [2020-12-22 10:58:42,909 WARN L197 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 269 [2020-12-22 10:58:42,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:58:42,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:42,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:58:42,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:42,967 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:42,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:42,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:42,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:43,468 WARN L197 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-22 10:58:43,594 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-22 10:58:43,723 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-22 10:58:43,851 WARN L197 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2020-12-22 10:58:44,457 WARN L197 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-22 10:58:44,726 WARN L197 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-22 10:58:45,302 WARN L197 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-22 10:58:45,570 WARN L197 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-22 10:58:46,412 WARN L197 SmtUtils]: Spent 840.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2020-12-22 10:58:47,288 WARN L197 SmtUtils]: Spent 874.00 ms on a formula simplification that was a NOOP. DAG size: 206 [2020-12-22 10:58:48,482 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 285 [2020-12-22 10:58:49,724 WARN L197 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 285 [2020-12-22 10:58:49,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-12-22 10:58:49,785 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,786 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-12-22 10:58:49,786 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,817 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:49,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,818 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:49,819 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:49,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:49,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,896 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:49,897 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,898 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:49,898 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,952 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:49,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,953 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:49,953 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,978 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:49,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:49,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:49,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:50,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:50,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,069 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:50,070 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,070 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:50,071 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:50,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:50,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-12-22 10:58:50,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-12-22 10:58:50,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 10:58:50,187 INFO L131 LiptonReduction]: Checked pairs total: 7778 [2020-12-22 10:58:50,187 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-12-22 10:58:50,198 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-12-22 10:58:50,444 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3002 states. [2020-12-22 10:58:50,447 INFO L276 IsEmpty]: Start isEmpty. Operand 3002 states. [2020-12-22 10:58:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 10:58:50,457 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:50,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:50,459 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:50,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:50,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1566809842, now seen corresponding path program 1 times [2020-12-22 10:58:50,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:50,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769150123] [2020-12-22 10:58:50,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:50,885 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:58:50,885 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769150123] [2020-12-22 10:58:50,886 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:50,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:58:50,887 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744859722] [2020-12-22 10:58:50,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:58:50,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:50,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:58:50,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:58:50,912 INFO L87 Difference]: Start difference. First operand 3002 states. Second operand 3 states. [2020-12-22 10:58:51,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:51,048 INFO L93 Difference]: Finished difference Result 2602 states and 10064 transitions. [2020-12-22 10:58:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:58:51,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-22 10:58:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:51,095 INFO L225 Difference]: With dead ends: 2602 [2020-12-22 10:58:51,095 INFO L226 Difference]: Without dead ends: 2122 [2020-12-22 10:58:51,097 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:58:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2122 states. [2020-12-22 10:58:51,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2122 to 2122. [2020-12-22 10:58:51,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2122 states. [2020-12-22 10:58:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2122 states to 2122 states and 8080 transitions. [2020-12-22 10:58:51,278 INFO L78 Accepts]: Start accepts. Automaton has 2122 states and 8080 transitions. Word has length 9 [2020-12-22 10:58:51,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:51,279 INFO L481 AbstractCegarLoop]: Abstraction has 2122 states and 8080 transitions. [2020-12-22 10:58:51,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:58:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2122 states and 8080 transitions. [2020-12-22 10:58:51,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 10:58:51,282 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:51,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:51,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 10:58:51,283 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1829199143, now seen corresponding path program 1 times [2020-12-22 10:58:51,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:51,285 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257617256] [2020-12-22 10:58:51,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:51,565 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:58:51,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257617256] [2020-12-22 10:58:51,566 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:51,566 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:58:51,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122878164] [2020-12-22 10:58:51,568 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:58:51,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:51,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:58:51,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:58:51,569 INFO L87 Difference]: Start difference. First operand 2122 states and 8080 transitions. Second operand 3 states. [2020-12-22 10:58:51,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:51,626 INFO L93 Difference]: Finished difference Result 2090 states and 7936 transitions. [2020-12-22 10:58:51,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:58:51,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-22 10:58:51,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:51,650 INFO L225 Difference]: With dead ends: 2090 [2020-12-22 10:58:51,650 INFO L226 Difference]: Without dead ends: 2090 [2020-12-22 10:58:51,651 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:58:51,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-12-22 10:58:51,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-12-22 10:58:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-12-22 10:58:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7936 transitions. [2020-12-22 10:58:51,747 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7936 transitions. Word has length 11 [2020-12-22 10:58:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:51,747 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7936 transitions. [2020-12-22 10:58:51,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:58:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7936 transitions. [2020-12-22 10:58:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-22 10:58:51,750 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:51,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:51,751 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 10:58:51,751 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash -871630844, now seen corresponding path program 1 times [2020-12-22 10:58:51,752 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:51,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803872711] [2020-12-22 10:58:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:51,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:58:51,958 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803872711] [2020-12-22 10:58:51,958 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:51,958 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:58:51,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974257641] [2020-12-22 10:58:51,959 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:58:51,959 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:51,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:58:51,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:58:51,960 INFO L87 Difference]: Start difference. First operand 2090 states and 7936 transitions. Second operand 5 states. [2020-12-22 10:58:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:52,056 INFO L93 Difference]: Finished difference Result 2058 states and 7744 transitions. [2020-12-22 10:58:52,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 10:58:52,058 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-22 10:58:52,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:52,080 INFO L225 Difference]: With dead ends: 2058 [2020-12-22 10:58:52,080 INFO L226 Difference]: Without dead ends: 2058 [2020-12-22 10:58:52,081 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:58:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2020-12-22 10:58:52,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 1962. [2020-12-22 10:58:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1962 states. [2020-12-22 10:58:52,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 7392 transitions. [2020-12-22 10:58:52,176 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 7392 transitions. Word has length 12 [2020-12-22 10:58:52,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:52,176 INFO L481 AbstractCegarLoop]: Abstraction has 1962 states and 7392 transitions. [2020-12-22 10:58:52,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:58:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 7392 transitions. [2020-12-22 10:58:52,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 10:58:52,179 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:52,179 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:52,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 10:58:52,180 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:52,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:52,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1251307991, now seen corresponding path program 1 times [2020-12-22 10:58:52,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:52,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265618683] [2020-12-22 10:58:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:52,339 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:58:52,339 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265618683] [2020-12-22 10:58:52,339 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:52,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:58:52,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15909516] [2020-12-22 10:58:52,340 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:58:52,340 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:52,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:58:52,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:58:52,341 INFO L87 Difference]: Start difference. First operand 1962 states and 7392 transitions. Second operand 5 states. [2020-12-22 10:58:52,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:52,429 INFO L93 Difference]: Finished difference Result 2058 states and 7764 transitions. [2020-12-22 10:58:52,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:58:52,431 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-22 10:58:52,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:52,451 INFO L225 Difference]: With dead ends: 2058 [2020-12-22 10:58:52,452 INFO L226 Difference]: Without dead ends: 2058 [2020-12-22 10:58:52,452 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:58:52,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2020-12-22 10:58:52,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2010. [2020-12-22 10:58:52,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2020-12-22 10:58:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 7560 transitions. [2020-12-22 10:58:52,540 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 7560 transitions. Word has length 13 [2020-12-22 10:58:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:52,541 INFO L481 AbstractCegarLoop]: Abstraction has 2010 states and 7560 transitions. [2020-12-22 10:58:52,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:58:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 7560 transitions. [2020-12-22 10:58:52,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 10:58:52,543 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:52,543 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:52,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 10:58:52,544 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:52,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1218780311, now seen corresponding path program 2 times [2020-12-22 10:58:52,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:52,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288620672] [2020-12-22 10:58:52,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:52,724 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:58:52,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288620672] [2020-12-22 10:58:52,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:52,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:58:52,726 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846537458] [2020-12-22 10:58:52,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:58:52,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:52,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:58:52,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:58:52,727 INFO L87 Difference]: Start difference. First operand 2010 states and 7560 transitions. Second operand 5 states. [2020-12-22 10:58:52,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:52,829 INFO L93 Difference]: Finished difference Result 1946 states and 7272 transitions. [2020-12-22 10:58:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 10:58:52,831 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-12-22 10:58:52,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:52,850 INFO L225 Difference]: With dead ends: 1946 [2020-12-22 10:58:52,850 INFO L226 Difference]: Without dead ends: 1946 [2020-12-22 10:58:52,850 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:58:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1946 states. [2020-12-22 10:58:52,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1946 to 1898. [2020-12-22 10:58:52,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2020-12-22 10:58:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 7104 transitions. [2020-12-22 10:58:52,933 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 7104 transitions. Word has length 13 [2020-12-22 10:58:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:52,933 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 7104 transitions. [2020-12-22 10:58:52,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:58:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 7104 transitions. [2020-12-22 10:58:52,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 10:58:52,937 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:52,937 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:52,937 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 10:58:52,938 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:52,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:52,938 INFO L82 PathProgramCache]: Analyzing trace with hash 367122832, now seen corresponding path program 1 times [2020-12-22 10:58:52,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:52,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126581598] [2020-12-22 10:58:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:53,240 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:58:53,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126581598] [2020-12-22 10:58:53,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:53,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:58:53,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905484662] [2020-12-22 10:58:53,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:58:53,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:53,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:58:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:58:53,243 INFO L87 Difference]: Start difference. First operand 1898 states and 7104 transitions. Second operand 6 states. [2020-12-22 10:58:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:53,380 INFO L93 Difference]: Finished difference Result 2058 states and 7760 transitions. [2020-12-22 10:58:53,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:58:53,382 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-22 10:58:53,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:53,412 INFO L225 Difference]: With dead ends: 2058 [2020-12-22 10:58:53,413 INFO L226 Difference]: Without dead ends: 2058 [2020-12-22 10:58:53,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:58:53,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2058 states. [2020-12-22 10:58:53,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2058 to 2058. [2020-12-22 10:58:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2020-12-22 10:58:53,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 7760 transitions. [2020-12-22 10:58:53,498 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 7760 transitions. Word has length 15 [2020-12-22 10:58:53,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:53,499 INFO L481 AbstractCegarLoop]: Abstraction has 2058 states and 7760 transitions. [2020-12-22 10:58:53,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:58:53,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 7760 transitions. [2020-12-22 10:58:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 10:58:53,503 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:53,503 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:53,503 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 10:58:53,503 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash 399650512, now seen corresponding path program 2 times [2020-12-22 10:58:53,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:53,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595636313] [2020-12-22 10:58:53,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:53,692 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:58:53,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595636313] [2020-12-22 10:58:53,693 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:53,693 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:58:53,693 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033656985] [2020-12-22 10:58:53,693 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:58:53,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:53,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:58:53,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:58:53,694 INFO L87 Difference]: Start difference. First operand 2058 states and 7760 transitions. Second operand 6 states. [2020-12-22 10:58:53,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:53,846 INFO L93 Difference]: Finished difference Result 2314 states and 8672 transitions. [2020-12-22 10:58:53,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:58:53,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-12-22 10:58:53,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:53,863 INFO L225 Difference]: With dead ends: 2314 [2020-12-22 10:58:53,863 INFO L226 Difference]: Without dead ends: 2314 [2020-12-22 10:58:53,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:58:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2020-12-22 10:58:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 2154. [2020-12-22 10:58:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2020-12-22 10:58:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 8016 transitions. [2020-12-22 10:58:53,953 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 8016 transitions. Word has length 15 [2020-12-22 10:58:53,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:53,954 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 8016 transitions. [2020-12-22 10:58:53,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:58:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 8016 transitions. [2020-12-22 10:58:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-22 10:58:53,958 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:53,958 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:53,958 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 10:58:53,958 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:53,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:53,959 INFO L82 PathProgramCache]: Analyzing trace with hash 13681864, now seen corresponding path program 1 times [2020-12-22 10:58:53,959 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:53,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896542162] [2020-12-22 10:58:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:54,039 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:58:54,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896542162] [2020-12-22 10:58:54,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:54,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 10:58:54,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160091267] [2020-12-22 10:58:54,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:58:54,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:54,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:58:54,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:58:54,041 INFO L87 Difference]: Start difference. First operand 2154 states and 8016 transitions. Second operand 3 states. [2020-12-22 10:58:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:54,074 INFO L93 Difference]: Finished difference Result 2138 states and 7948 transitions. [2020-12-22 10:58:54,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:58:54,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-22 10:58:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:54,087 INFO L225 Difference]: With dead ends: 2138 [2020-12-22 10:58:54,087 INFO L226 Difference]: Without dead ends: 2138 [2020-12-22 10:58:54,088 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:58:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2020-12-22 10:58:54,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2138. [2020-12-22 10:58:54,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2138 states. [2020-12-22 10:58:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 7948 transitions. [2020-12-22 10:58:54,177 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 7948 transitions. Word has length 15 [2020-12-22 10:58:54,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:54,177 INFO L481 AbstractCegarLoop]: Abstraction has 2138 states and 7948 transitions. [2020-12-22 10:58:54,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:58:54,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 7948 transitions. [2020-12-22 10:58:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:58:54,185 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:54,185 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:58:54,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 10:58:54,185 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:54,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1563755043, now seen corresponding path program 1 times [2020-12-22 10:58:54,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:54,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121290112] [2020-12-22 10:58:54,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:54,374 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:58:54,375 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121290112] [2020-12-22 10:58:54,375 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:54,375 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:58:54,375 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660438308] [2020-12-22 10:58:54,376 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:58:54,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:54,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:58:54,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:58:54,377 INFO L87 Difference]: Start difference. First operand 2138 states and 7948 transitions. Second operand 6 states. [2020-12-22 10:58:54,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:54,504 INFO L93 Difference]: Finished difference Result 2586 states and 9660 transitions. [2020-12-22 10:58:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:58:54,505 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-22 10:58:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:54,519 INFO L225 Difference]: With dead ends: 2586 [2020-12-22 10:58:54,519 INFO L226 Difference]: Without dead ends: 2586 [2020-12-22 10:58:54,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:58:54,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2586 states. [2020-12-22 10:58:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2586 to 2298. [2020-12-22 10:58:54,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2298 states. [2020-12-22 10:58:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 8604 transitions. [2020-12-22 10:58:54,654 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 8604 transitions. Word has length 16 [2020-12-22 10:58:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:54,655 INFO L481 AbstractCegarLoop]: Abstraction has 2298 states and 8604 transitions. [2020-12-22 10:58:54,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:58:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 8604 transitions. [2020-12-22 10:58:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:58:54,660 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:54,661 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:58:54,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 10:58:54,661 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash -495797913, now seen corresponding path program 2 times [2020-12-22 10:58:54,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:54,662 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613670025] [2020-12-22 10:58:54,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:54,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:54,855 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:58:54,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613670025] [2020-12-22 10:58:54,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:54,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:58:54,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89324598] [2020-12-22 10:58:54,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:58:54,856 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:54,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:58:54,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:58:54,857 INFO L87 Difference]: Start difference. First operand 2298 states and 8604 transitions. Second operand 7 states. [2020-12-22 10:58:54,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:54,979 INFO L93 Difference]: Finished difference Result 2858 states and 10564 transitions. [2020-12-22 10:58:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:58:54,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-12-22 10:58:54,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:54,994 INFO L225 Difference]: With dead ends: 2858 [2020-12-22 10:58:54,994 INFO L226 Difference]: Without dead ends: 2858 [2020-12-22 10:58:54,995 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:58:55,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2020-12-22 10:58:55,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2378. [2020-12-22 10:58:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2020-12-22 10:58:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 8900 transitions. [2020-12-22 10:58:55,093 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 8900 transitions. Word has length 16 [2020-12-22 10:58:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:55,093 INFO L481 AbstractCegarLoop]: Abstraction has 2378 states and 8900 transitions. [2020-12-22 10:58:55,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:58:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 8900 transitions. [2020-12-22 10:58:55,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:58:55,099 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:55,099 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:58:55,099 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 10:58:55,099 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:55,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:55,100 INFO L82 PathProgramCache]: Analyzing trace with hash -600338635, now seen corresponding path program 3 times [2020-12-22 10:58:55,100 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:55,100 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809332981] [2020-12-22 10:58:55,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:55,268 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:58:55,269 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809332981] [2020-12-22 10:58:55,269 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:55,269 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:58:55,269 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413280311] [2020-12-22 10:58:55,270 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:58:55,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:55,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:58:55,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:58:55,278 INFO L87 Difference]: Start difference. First operand 2378 states and 8900 transitions. Second operand 6 states. [2020-12-22 10:58:55,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:55,418 INFO L93 Difference]: Finished difference Result 2602 states and 9508 transitions. [2020-12-22 10:58:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 10:58:55,420 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-12-22 10:58:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:55,430 INFO L225 Difference]: With dead ends: 2602 [2020-12-22 10:58:55,431 INFO L226 Difference]: Without dead ends: 2314 [2020-12-22 10:58:55,431 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:58:55,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2314 states. [2020-12-22 10:58:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2314 to 1786. [2020-12-22 10:58:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2020-12-22 10:58:55,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 6540 transitions. [2020-12-22 10:58:55,504 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 6540 transitions. Word has length 16 [2020-12-22 10:58:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:55,504 INFO L481 AbstractCegarLoop]: Abstraction has 1786 states and 6540 transitions. [2020-12-22 10:58:55,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:58:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 6540 transitions. [2020-12-22 10:58:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 10:58:55,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:55,508 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:58:55,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 10:58:55,509 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:55,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1267259155, now seen corresponding path program 1 times [2020-12-22 10:58:55,509 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:55,509 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128068639] [2020-12-22 10:58:55,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:55,597 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:58:55,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128068639] [2020-12-22 10:58:55,599 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:55,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:58:55,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939517399] [2020-12-22 10:58:55,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:58:55,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:55,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:58:55,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:58:55,600 INFO L87 Difference]: Start difference. First operand 1786 states and 6540 transitions. Second operand 4 states. [2020-12-22 10:58:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:55,662 INFO L93 Difference]: Finished difference Result 1876 states and 6260 transitions. [2020-12-22 10:58:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 10:58:55,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-22 10:58:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:55,669 INFO L225 Difference]: With dead ends: 1876 [2020-12-22 10:58:55,670 INFO L226 Difference]: Without dead ends: 1396 [2020-12-22 10:58:55,670 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:58:55,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-12-22 10:58:55,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1396. [2020-12-22 10:58:55,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2020-12-22 10:58:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 4608 transitions. [2020-12-22 10:58:55,721 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 4608 transitions. Word has length 16 [2020-12-22 10:58:55,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:55,722 INFO L481 AbstractCegarLoop]: Abstraction has 1396 states and 4608 transitions. [2020-12-22 10:58:55,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:58:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 4608 transitions. [2020-12-22 10:58:55,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-22 10:58:55,725 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:55,725 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 10:58:55,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 10:58:55,726 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:55,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:55,726 INFO L82 PathProgramCache]: Analyzing trace with hash 630278985, now seen corresponding path program 1 times [2020-12-22 10:58:55,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:55,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738865227] [2020-12-22 10:58:55,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:55,851 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:58:55,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738865227] [2020-12-22 10:58:55,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:55,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 10:58:55,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206853070] [2020-12-22 10:58:55,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 10:58:55,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:55,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 10:58:55,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 10:58:55,854 INFO L87 Difference]: Start difference. First operand 1396 states and 4608 transitions. Second operand 5 states. [2020-12-22 10:58:55,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:55,924 INFO L93 Difference]: Finished difference Result 1233 states and 3748 transitions. [2020-12-22 10:58:55,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 10:58:55,925 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-22 10:58:55,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:55,929 INFO L225 Difference]: With dead ends: 1233 [2020-12-22 10:58:55,929 INFO L226 Difference]: Without dead ends: 933 [2020-12-22 10:58:55,930 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:58:55,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2020-12-22 10:58:55,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2020-12-22 10:58:55,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 933 states. [2020-12-22 10:58:55,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 2786 transitions. [2020-12-22 10:58:55,961 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 2786 transitions. Word has length 17 [2020-12-22 10:58:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:55,961 INFO L481 AbstractCegarLoop]: Abstraction has 933 states and 2786 transitions. [2020-12-22 10:58:55,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 10:58:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 2786 transitions. [2020-12-22 10:58:55,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-22 10:58:55,964 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:55,965 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:58:55,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 10:58:55,965 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:55,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:55,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1382870722, now seen corresponding path program 1 times [2020-12-22 10:58:55,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:55,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777832033] [2020-12-22 10:58:55,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:56,070 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:58:56,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777832033] [2020-12-22 10:58:56,071 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:56,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 10:58:56,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372165702] [2020-12-22 10:58:56,072 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 10:58:56,072 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 10:58:56,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 10:58:56,074 INFO L87 Difference]: Start difference. First operand 933 states and 2786 transitions. Second operand 3 states. [2020-12-22 10:58:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:56,098 INFO L93 Difference]: Finished difference Result 1325 states and 3849 transitions. [2020-12-22 10:58:56,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 10:58:56,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-22 10:58:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:56,104 INFO L225 Difference]: With dead ends: 1325 [2020-12-22 10:58:56,104 INFO L226 Difference]: Without dead ends: 943 [2020-12-22 10:58:56,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:58:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2020-12-22 10:58:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 927. [2020-12-22 10:58:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2020-12-22 10:58:56,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2617 transitions. [2020-12-22 10:58:56,134 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2617 transitions. Word has length 19 [2020-12-22 10:58:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:56,134 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 2617 transitions. [2020-12-22 10:58:56,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 10:58:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2617 transitions. [2020-12-22 10:58:56,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:58:56,137 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:56,137 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] [2020-12-22 10:58:56,137 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 10:58:56,137 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:56,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:56,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1211352883, now seen corresponding path program 1 times [2020-12-22 10:58:56,138 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:56,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409081500] [2020-12-22 10:58:56,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:56,226 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:58:56,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409081500] [2020-12-22 10:58:56,229 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:56,230 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:58:56,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17565699] [2020-12-22 10:58:56,231 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:58:56,231 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:58:56,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:58:56,232 INFO L87 Difference]: Start difference. First operand 927 states and 2617 transitions. Second operand 4 states. [2020-12-22 10:58:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:56,268 INFO L93 Difference]: Finished difference Result 1219 states and 3356 transitions. [2020-12-22 10:58:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 10:58:56,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-22 10:58:56,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:56,272 INFO L225 Difference]: With dead ends: 1219 [2020-12-22 10:58:56,272 INFO L226 Difference]: Without dead ends: 537 [2020-12-22 10:58:56,275 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:58:56,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-12-22 10:58:56,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-12-22 10:58:56,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-12-22 10:58:56,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1360 transitions. [2020-12-22 10:58:56,291 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1360 transitions. Word has length 20 [2020-12-22 10:58:56,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:56,291 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1360 transitions. [2020-12-22 10:58:56,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:58:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1360 transitions. [2020-12-22 10:58:56,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 10:58:56,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:56,294 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] [2020-12-22 10:58:56,294 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 10:58:56,294 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:56,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:56,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1643099372, now seen corresponding path program 1 times [2020-12-22 10:58:56,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:56,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719447378] [2020-12-22 10:58:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:56,427 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:58:56,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719447378] [2020-12-22 10:58:56,430 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:56,430 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 10:58:56,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543426286] [2020-12-22 10:58:56,432 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 10:58:56,435 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:56,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 10:58:56,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 10:58:56,436 INFO L87 Difference]: Start difference. First operand 537 states and 1360 transitions. Second operand 6 states. [2020-12-22 10:58:56,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:56,515 INFO L93 Difference]: Finished difference Result 458 states and 1112 transitions. [2020-12-22 10:58:56,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 10:58:56,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-22 10:58:56,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:56,518 INFO L225 Difference]: With dead ends: 458 [2020-12-22 10:58:56,518 INFO L226 Difference]: Without dead ends: 373 [2020-12-22 10:58:56,518 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:58:56,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-12-22 10:58:56,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-12-22 10:58:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-12-22 10:58:56,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 900 transitions. [2020-12-22 10:58:56,528 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 900 transitions. Word has length 20 [2020-12-22 10:58:56,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:56,529 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 900 transitions. [2020-12-22 10:58:56,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 10:58:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 900 transitions. [2020-12-22 10:58:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 10:58:56,534 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:56,534 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:58:56,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-22 10:58:56,535 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:56,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:56,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1148150892, now seen corresponding path program 1 times [2020-12-22 10:58:56,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:56,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455192543] [2020-12-22 10:58:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:56,649 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:58:56,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455192543] [2020-12-22 10:58:56,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:56,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-22 10:58:56,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256147262] [2020-12-22 10:58:56,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 10:58:56,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:56,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 10:58:56,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-22 10:58:56,651 INFO L87 Difference]: Start difference. First operand 373 states and 900 transitions. Second operand 7 states. [2020-12-22 10:58:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:56,751 INFO L93 Difference]: Finished difference Result 352 states and 858 transitions. [2020-12-22 10:58:56,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 10:58:56,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-12-22 10:58:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:56,753 INFO L225 Difference]: With dead ends: 352 [2020-12-22 10:58:56,753 INFO L226 Difference]: Without dead ends: 171 [2020-12-22 10:58:56,754 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-22 10:58:56,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-12-22 10:58:56,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2020-12-22 10:58:56,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2020-12-22 10:58:56,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 392 transitions. [2020-12-22 10:58:56,759 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 392 transitions. Word has length 23 [2020-12-22 10:58:56,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:56,759 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 392 transitions. [2020-12-22 10:58:56,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 10:58:56,759 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 392 transitions. [2020-12-22 10:58:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 10:58:56,760 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:56,760 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, 1, 1, 1] [2020-12-22 10:58:56,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-22 10:58:56,761 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:56,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:56,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1406554058, now seen corresponding path program 1 times [2020-12-22 10:58:56,761 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:56,761 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865473855] [2020-12-22 10:58:56,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 10:58:56,861 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:58:56,861 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865473855] [2020-12-22 10:58:56,862 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 10:58:56,862 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 10:58:56,862 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333766641] [2020-12-22 10:58:56,862 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 10:58:56,862 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 10:58:56,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 10:58:56,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 10:58:56,863 INFO L87 Difference]: Start difference. First operand 171 states and 392 transitions. Second operand 4 states. [2020-12-22 10:58:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 10:58:56,885 INFO L93 Difference]: Finished difference Result 219 states and 497 transitions. [2020-12-22 10:58:56,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 10:58:56,886 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-12-22 10:58:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 10:58:56,886 INFO L225 Difference]: With dead ends: 219 [2020-12-22 10:58:56,886 INFO L226 Difference]: Without dead ends: 64 [2020-12-22 10:58:56,887 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:58:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-22 10:58:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2020-12-22 10:58:56,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-22 10:58:56,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 122 transitions. [2020-12-22 10:58:56,889 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 122 transitions. Word has length 26 [2020-12-22 10:58:56,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 10:58:56,889 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 122 transitions. [2020-12-22 10:58:56,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 10:58:56,890 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 122 transitions. [2020-12-22 10:58:56,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-12-22 10:58:56,890 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 10:58:56,890 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, 1, 1, 1] [2020-12-22 10:58:56,890 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-22 10:58:56,890 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 10:58:56,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 10:58:56,891 INFO L82 PathProgramCache]: Analyzing trace with hash -772400604, now seen corresponding path program 2 times [2020-12-22 10:58:56,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 10:58:56,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892519297] [2020-12-22 10:58:56,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 10:58:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:58:56,935 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:58:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 10:58:56,977 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 10:58:57,022 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 10:58:57,022 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 10:58:57,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-22 10:58:57,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 10:58:57 BasicIcfg [2020-12-22 10:58:57,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 10:58:57,152 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 10:58:57,152 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 10:58:57,153 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 10:58:57,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 10:58:25" (3/4) ... [2020-12-22 10:58:57,158 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 10:58:57,300 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/mix046_power.opt.i-witness.graphml [2020-12-22 10:58:57,300 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 10:58:57,302 INFO L168 Benchmark]: Toolchain (without parser) took 36159.90 ms. Allocated memory was 154.1 MB in the beginning and 451.9 MB in the end (delta: 297.8 MB). Free memory was 128.4 MB in the beginning and 210.4 MB in the end (delta: -82.0 MB). Peak memory consumption was 216.4 MB. Max. memory is 8.0 GB. [2020-12-22 10:58:57,302 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 154.1 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 10:58:57,302 INFO L168 Benchmark]: CACSL2BoogieTranslator took 967.24 ms. Allocated memory is still 154.1 MB. Free memory was 128.3 MB in the beginning and 124.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. [2020-12-22 10:58:57,303 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.98 ms. Allocated memory is still 154.1 MB. Free memory was 124.8 MB in the beginning and 122.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 10:58:57,303 INFO L168 Benchmark]: Boogie Preprocessor took 47.30 ms. Allocated memory is still 154.1 MB. Free memory was 122.2 MB in the beginning and 119.6 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:58:57,304 INFO L168 Benchmark]: RCFGBuilder took 2726.14 ms. Allocated memory was 154.1 MB in the beginning and 209.7 MB in the end (delta: 55.6 MB). Free memory was 119.6 MB in the beginning and 134.7 MB in the end (delta: -15.1 MB). Peak memory consumption was 77.7 MB. Max. memory is 8.0 GB. [2020-12-22 10:58:57,305 INFO L168 Benchmark]: TraceAbstraction took 32145.40 ms. Allocated memory was 209.7 MB in the beginning and 451.9 MB in the end (delta: 242.2 MB). Free memory was 134.2 MB in the beginning and 228.3 MB in the end (delta: -94.1 MB). Peak memory consumption was 147.6 MB. Max. memory is 8.0 GB. [2020-12-22 10:58:57,305 INFO L168 Benchmark]: Witness Printer took 148.18 ms. Allocated memory is still 451.9 MB. Free memory was 228.3 MB in the beginning and 210.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. [2020-12-22 10:58:57,307 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 154.1 MB. Free memory is still 126.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 967.24 ms. Allocated memory is still 154.1 MB. Free memory was 128.3 MB in the beginning and 124.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 116.98 ms. Allocated memory is still 154.1 MB. Free memory was 124.8 MB in the beginning and 122.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 47.30 ms. Allocated memory is still 154.1 MB. Free memory was 122.2 MB in the beginning and 119.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2726.14 ms. Allocated memory was 154.1 MB in the beginning and 209.7 MB in the end (delta: 55.6 MB). Free memory was 119.6 MB in the beginning and 134.7 MB in the end (delta: -15.1 MB). Peak memory consumption was 77.7 MB. Max. memory is 8.0 GB. * TraceAbstraction took 32145.40 ms. Allocated memory was 209.7 MB in the beginning and 451.9 MB in the end (delta: 242.2 MB). Free memory was 134.2 MB in the beginning and 228.3 MB in the end (delta: -94.1 MB). Peak memory consumption was 147.6 MB. Max. memory is 8.0 GB. * Witness Printer took 148.18 ms. Allocated memory is still 451.9 MB. Free memory was 228.3 MB in the beginning and 210.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 17.8 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1770 VarBasedMoverChecksPositive, 90 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 59 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.5s, 214 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 25.0s, 128 PlacesBefore, 45 PlacesAfterwards, 117 TransitionsBefore, 33 TransitionsAfterwards, 2598 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 7778 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L846] 0 pthread_t t1221; [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L767] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L785] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 3 return 0; [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 116 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.8s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.2s, HoareTripleCheckerStatistics: 612 SDtfs, 717 SDslu, 936 SDs, 0 SdLazy, 388 SolverSat, 124 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3002occurred 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: 1.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 1664 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 26265 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...