./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 27142e71f3089c5c3b5bf4f358882e993f701ffc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:58:22,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:58:22,194 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:58:22,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:58:22,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:58:22,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:58:22,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:58:22,214 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:58:22,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:58:22,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:58:22,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:58:22,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:58:22,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:58:22,222 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:58:22,223 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:58:22,225 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:58:22,226 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:58:22,227 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:58:22,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:58:22,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:58:22,236 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:58:22,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:58:22,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:58:22,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:58:22,244 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:58:22,244 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:58:22,245 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:58:22,246 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:58:22,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:58:22,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:58:22,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:58:22,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:58:22,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:58:22,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:58:22,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:58:22,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:58:22,255 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:58:22,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:58:22,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:58:22,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:58:22,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:58:22,259 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:58:22,276 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:58:22,276 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:58:22,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:58:22,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:58:22,278 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:58:22,279 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:58:22,279 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:58:22,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:58:22,280 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:58:22,280 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:58:22,280 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:58:22,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:58:22,281 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:58:22,281 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:58:22,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:58:22,282 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:58:22,282 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:58:22,282 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:58:22,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:58:22,283 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:58:22,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:58:22,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:58:22,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:58:22,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:58:22,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:58:22,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:58:22,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:58:22,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:58:22,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 27142e71f3089c5c3b5bf4f358882e993f701ffc [2019-11-27 23:58:22,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:58:22,659 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:58:22,662 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:58:22,664 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:58:22,665 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:58:22,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-27 23:58:22,749 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bfea261/14bbf0b31cd54f8f834b7f4f23d5c0f4/FLAG1cbd32bb9 [2019-11-27 23:58:23,308 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:58:23,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-27 23:58:23,324 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bfea261/14bbf0b31cd54f8f834b7f4f23d5c0f4/FLAG1cbd32bb9 [2019-11-27 23:58:23,592 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bfea261/14bbf0b31cd54f8f834b7f4f23d5c0f4 [2019-11-27 23:58:23,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:58:23,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:58:23,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:58:23,599 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:58:23,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:58:23,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:58:23" (1/1) ... [2019-11-27 23:58:23,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120696db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:23, skipping insertion in model container [2019-11-27 23:58:23,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:58:23" (1/1) ... [2019-11-27 23:58:23,614 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:58:23,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:58:24,086 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:58:24,100 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:58:24,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:58:24,202 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:58:24,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24 WrapperNode [2019-11-27 23:58:24,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:58:24,204 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:58:24,204 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:58:24,205 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:58:24,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,269 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:58:24,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:58:24,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:58:24,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:58:24,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (1/1) ... [2019-11-27 23:58:24,308 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:58:24,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:58:24,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:58:24,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:58:24,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (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 [2019-11-27 23:58:24,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 23:58:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:58:24,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 23:58:24,383 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 23:58:24,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:58:24,384 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-27 23:58:24,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:58:24,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:58:24,860 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:58:24,860 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-27 23:58:24,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:24 BoogieIcfgContainer [2019-11-27 23:58:24,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:58:24,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:58:24,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:58:24,866 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:58:24,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:58:23" (1/3) ... [2019-11-27 23:58:24,867 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7345a91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:58:24, skipping insertion in model container [2019-11-27 23:58:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:58:24" (2/3) ... [2019-11-27 23:58:24,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7345a91c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:58:24, skipping insertion in model container [2019-11-27 23:58:24,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:24" (3/3) ... [2019-11-27 23:58:24,872 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2019-11-27 23:58:24,883 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:58:24,891 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:58:24,900 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:58:24,922 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:58:24,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:58:24,923 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:58:24,923 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:58:24,923 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:58:24,924 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:58:24,924 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:58:24,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:58:24,939 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-27 23:58:24,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:58:24,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:24,946 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:24,947 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:24,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:24,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1240059524, now seen corresponding path program 1 times [2019-11-27 23:58:24,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:24,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662298533] [2019-11-27 23:58:24,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:25,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:25,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662298533] [2019-11-27 23:58:25,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:58:25,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:58:25,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491710363] [2019-11-27 23:58:25,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:58:25,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:25,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:58:25,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:58:25,117 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-27 23:58:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:25,143 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2019-11-27 23:58:25,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:58:25,145 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-27 23:58:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:25,155 INFO L225 Difference]: With dead ends: 89 [2019-11-27 23:58:25,156 INFO L226 Difference]: Without dead ends: 40 [2019-11-27 23:58:25,159 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:58:25,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-27 23:58:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-27 23:58:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-27 23:58:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-11-27 23:58:25,200 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-11-27 23:58:25,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:25,200 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-27 23:58:25,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:58:25,201 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-11-27 23:58:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:58:25,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:25,203 INFO L410 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] [2019-11-27 23:58:25,204 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1466688541, now seen corresponding path program 1 times [2019-11-27 23:58:25,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:25,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127347835] [2019-11-27 23:58:25,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:25,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:25,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127347835] [2019-11-27 23:58:25,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:58:25,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 23:58:25,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645634799] [2019-11-27 23:58:25,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:58:25,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:25,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:58:25,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:58:25,361 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-11-27 23:58:25,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:25,517 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2019-11-27 23:58:25,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:58:25,520 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-27 23:58:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:25,521 INFO L225 Difference]: With dead ends: 82 [2019-11-27 23:58:25,521 INFO L226 Difference]: Without dead ends: 53 [2019-11-27 23:58:25,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:58:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-27 23:58:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-27 23:58:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 23:58:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-27 23:58:25,531 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2019-11-27 23:58:25,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:25,532 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-27 23:58:25,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:58:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-27 23:58:25,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 23:58:25,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:25,537 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:25,537 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash -395195180, now seen corresponding path program 1 times [2019-11-27 23:58:25,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:25,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192316146] [2019-11-27 23:58:25,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:25,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192316146] [2019-11-27 23:58:25,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938387923] [2019-11-27 23:58:25,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:25,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 23:58:25,836 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:25,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:25,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:58:25,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2019-11-27 23:58:25,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741287702] [2019-11-27 23:58:25,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:58:25,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:25,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:58:25,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:58:25,878 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-11-27 23:58:26,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:26,035 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-11-27 23:58:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:58:26,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-27 23:58:26,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:26,037 INFO L225 Difference]: With dead ends: 84 [2019-11-27 23:58:26,037 INFO L226 Difference]: Without dead ends: 55 [2019-11-27 23:58:26,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:58:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-27 23:58:26,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-11-27 23:58:26,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-27 23:58:26,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-11-27 23:58:26,046 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2019-11-27 23:58:26,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:26,047 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-11-27 23:58:26,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:58:26,047 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-11-27 23:58:26,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-27 23:58:26,048 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:26,048 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1] [2019-11-27 23:58:26,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:26,254 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:26,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1510946244, now seen corresponding path program 1 times [2019-11-27 23:58:26,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:26,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247764960] [2019-11-27 23:58:26,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:26,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:26,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247764960] [2019-11-27 23:58:26,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:58:26,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 23:58:26,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295151901] [2019-11-27 23:58:26,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:58:26,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:26,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:58:26,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:58:26,420 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2019-11-27 23:58:26,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:26,603 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-27 23:58:26,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 23:58:26,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-27 23:58:26,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:26,605 INFO L225 Difference]: With dead ends: 70 [2019-11-27 23:58:26,605 INFO L226 Difference]: Without dead ends: 65 [2019-11-27 23:58:26,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:58:26,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-27 23:58:26,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-11-27 23:58:26,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 23:58:26,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-27 23:58:26,616 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2019-11-27 23:58:26,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:26,616 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-27 23:58:26,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:58:26,617 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-27 23:58:26,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-27 23:58:26,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:26,618 INFO L410 BasicCegarLoop]: trace histogram [2, 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, 1, 1] [2019-11-27 23:58:26,619 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:26,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:26,619 INFO L82 PathProgramCache]: Analyzing trace with hash -353652332, now seen corresponding path program 1 times [2019-11-27 23:58:26,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:26,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882447522] [2019-11-27 23:58:26,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:58:26,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882447522] [2019-11-27 23:58:26,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014672861] [2019-11-27 23:58:26,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:26,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 23:58:26,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-27 23:58:26,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:26,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-27 23:58:26,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420183265] [2019-11-27 23:58:26,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:58:26,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:26,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:58:26,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:58:26,889 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-11-27 23:58:27,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:27,111 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2019-11-27 23:58:27,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 23:58:27,113 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-27 23:58:27,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:27,114 INFO L225 Difference]: With dead ends: 102 [2019-11-27 23:58:27,114 INFO L226 Difference]: Without dead ends: 68 [2019-11-27 23:58:27,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:58:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-27 23:58:27,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-11-27 23:58:27,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-27 23:58:27,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-11-27 23:58:27,136 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-11-27 23:58:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:27,136 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-27 23:58:27,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:58:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-11-27 23:58:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-27 23:58:27,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:27,139 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2019-11-27 23:58:27,351 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:27,351 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:27,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:27,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1806454861, now seen corresponding path program 2 times [2019-11-27 23:58:27,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:27,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963644500] [2019-11-27 23:58:27,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:27,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:27,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963644500] [2019-11-27 23:58:27,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318340152] [2019-11-27 23:58:27,529 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:27,606 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-27 23:58:27,606 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:27,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-27 23:58:27,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:27,663 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:58:27,663 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,669 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,670 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-27 23:58:27,681 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2019-11-27 23:58:27,682 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,688 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,689 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:27,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-11-27 23:58:27,737 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-11-27 23:58:27,739 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,741 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:27,742 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:27,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2019-11-27 23:58:27,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:27,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:27,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-27 23:58:27,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179022766] [2019-11-27 23:58:27,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:58:27,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:27,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:58:27,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:58:27,751 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2019-11-27 23:58:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:28,180 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-27 23:58:28,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:58:28,181 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-11-27 23:58:28,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:28,182 INFO L225 Difference]: With dead ends: 75 [2019-11-27 23:58:28,182 INFO L226 Difference]: Without dead ends: 70 [2019-11-27 23:58:28,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:58:28,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-27 23:58:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-27 23:58:28,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-27 23:58:28,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-27 23:58:28,206 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-11-27 23:58:28,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:28,209 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-27 23:58:28,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:58:28,209 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-27 23:58:28,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 23:58:28,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:28,212 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:28,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:28,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:28,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:28,426 INFO L82 PathProgramCache]: Analyzing trace with hash 217180203, now seen corresponding path program 3 times [2019-11-27 23:58:28,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:28,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314828721] [2019-11-27 23:58:28,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:28,691 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-27 23:58:28,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314828721] [2019-11-27 23:58:28,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679894022] [2019-11-27 23:58:28,692 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:28,763 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-27 23:58:28,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:28,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-27 23:58:28,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:28,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-27 23:58:28,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:28,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-11-27 23:58:28,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74750059] [2019-11-27 23:58:28,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-27 23:58:28,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-27 23:58:28,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-27 23:58:28,889 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-11-27 23:58:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:29,544 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2019-11-27 23:58:29,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-27 23:58:29,544 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-27 23:58:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:29,546 INFO L225 Difference]: With dead ends: 213 [2019-11-27 23:58:29,546 INFO L226 Difference]: Without dead ends: 205 [2019-11-27 23:58:29,549 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-11-27 23:58:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-27 23:58:29,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-11-27 23:58:29,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-27 23:58:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-11-27 23:58:29,571 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2019-11-27 23:58:29,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:29,572 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-11-27 23:58:29,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-27 23:58:29,572 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-11-27 23:58:29,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 23:58:29,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:29,574 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:29,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:29,780 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:29,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:29,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1805693939, now seen corresponding path program 4 times [2019-11-27 23:58:29,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:29,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957657042] [2019-11-27 23:58:29,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:30,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957657042] [2019-11-27 23:58:30,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722195129] [2019-11-27 23:58:30,023 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:30,113 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-27 23:58:30,113 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-27 23:58:30,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-27 23:58:30,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:30,131 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-27 23:58:30,132 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,144 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:30,145 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-27 23:58:30,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:58:30,204 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,214 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:30,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-27 23:58:30,221 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,233 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:30,233 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,234 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-27 23:58:30,276 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:30,276 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-27 23:58:30,277 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,289 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:30,289 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,290 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-27 23:58:30,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-27 23:58:30,342 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,359 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:30,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-27 23:58:30,366 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,378 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:30,379 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:30,379 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-11-27 23:58:30,771 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-27 23:58:30,773 INFO L343 Elim1Store]: treesize reduction 8, result has 92.9 percent of original size [2019-11-27 23:58:30,774 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 163 [2019-11-27 23:58:30,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:30,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:30,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:31,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,499 INFO L508 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:58:31,564 INFO L588 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2019-11-27 23:58:31,603 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:58:31,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 104 [2019-11-27 23:58:31,605 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:58:31,639 INFO L588 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-27 23:58:31,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-27 23:58:31,642 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:58:31,642 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:7 [2019-11-27 23:58:31,651 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:58:31,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:31,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-27 23:58:31,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324322777] [2019-11-27 23:58:31,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-27 23:58:31,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:31,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-27 23:58:31,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-27 23:58:31,654 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2019-11-27 23:58:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:32,328 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-11-27 23:58:32,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-27 23:58:32,328 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-27 23:58:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:32,329 INFO L225 Difference]: With dead ends: 168 [2019-11-27 23:58:32,330 INFO L226 Difference]: Without dead ends: 158 [2019-11-27 23:58:32,331 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-11-27 23:58:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-27 23:58:32,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2019-11-27 23:58:32,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-27 23:58:32,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2019-11-27 23:58:32,367 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2019-11-27 23:58:32,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:32,368 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2019-11-27 23:58:32,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-27 23:58:32,368 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2019-11-27 23:58:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 23:58:32,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:32,373 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:58:32,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:32,579 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:32,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:32,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1169066102, now seen corresponding path program 1 times [2019-11-27 23:58:32,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:32,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430596517] [2019-11-27 23:58:32,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:32,695 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-27 23:58:32,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430596517] [2019-11-27 23:58:32,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136072789] [2019-11-27 23:58:32,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:32,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:32,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-27 23:58:32,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:32,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:32,814 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-27 23:58:32,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-27 23:58:32,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-27 23:58:32,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342317627] [2019-11-27 23:58:32,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:58:32,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:32,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:58:32,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:58:32,818 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2019-11-27 23:58:33,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:33,148 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-11-27 23:58:33,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-27 23:58:33,149 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-27 23:58:33,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:33,155 INFO L225 Difference]: With dead ends: 375 [2019-11-27 23:58:33,155 INFO L226 Difference]: Without dead ends: 289 [2019-11-27 23:58:33,158 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-11-27 23:58:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-27 23:58:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2019-11-27 23:58:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-27 23:58:33,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2019-11-27 23:58:33,190 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2019-11-27 23:58:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:33,190 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2019-11-27 23:58:33,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:58:33,190 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2019-11-27 23:58:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 23:58:33,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:33,198 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2019-11-27 23:58:33,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:33,411 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:33,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:33,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1846037516, now seen corresponding path program 1 times [2019-11-27 23:58:33,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:33,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397164237] [2019-11-27 23:58:33,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:33,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-27 23:58:33,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397164237] [2019-11-27 23:58:33,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033201160] [2019-11-27 23:58:33,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:58:33,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:58:33,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:58:33,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:58:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-27 23:58:33,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-27 23:58:33,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-11-27 23:58:33,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496764335] [2019-11-27 23:58:33,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 23:58:33,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:58:33,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 23:58:33,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:58:33,608 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 7 states. [2019-11-27 23:58:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:58:33,836 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-11-27 23:58:33,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:58:33,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-27 23:58:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:58:33,838 INFO L225 Difference]: With dead ends: 273 [2019-11-27 23:58:33,838 INFO L226 Difference]: Without dead ends: 241 [2019-11-27 23:58:33,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:58:33,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-27 23:58:33,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-11-27 23:58:33,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-27 23:58:33,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2019-11-27 23:58:33,861 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2019-11-27 23:58:33,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:58:33,862 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2019-11-27 23:58:33,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 23:58:33,862 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2019-11-27 23:58:33,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-27 23:58:33,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:58:33,863 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 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] [2019-11-27 23:58:34,079 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-27 23:58:34,080 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:58:34,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:58:34,081 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902770, now seen corresponding path program 1 times [2019-11-27 23:58:34,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:58:34,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767764745] [2019-11-27 23:58:34,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:58:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:58:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:58:34,167 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:58:34,167 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:58:34,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:58:34 BoogieIcfgContainer [2019-11-27 23:58:34,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:58:34,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:58:34,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:58:34,244 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:58:34,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:58:24" (3/4) ... [2019-11-27 23:58:34,246 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 23:58:34,311 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:58:34,311 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:58:34,316 INFO L168 Benchmark]: Toolchain (without parser) took 10716.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.5 MB). Free memory was 957.7 MB in the beginning and 1.3 GB in the end (delta: -338.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:34,317 INFO L168 Benchmark]: CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:34,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:34,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:34,320 INFO L168 Benchmark]: Boogie Preprocessor took 38.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:34,320 INFO L168 Benchmark]: RCFGBuilder took 553.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:58:34,321 INFO L168 Benchmark]: TraceAbstraction took 9379.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -218.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:34,321 INFO L168 Benchmark]: Witness Printer took 68.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:58:34,324 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.42 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 605.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.62 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 553.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.4 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9379.97 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -218.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 68.17 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); [L564] SLL head = ((void *)0); [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND FALSE !(len-- > 0) [L573] return head; [L617] SLL s = sll_create(len); [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) [L576] int len = 0; [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) [L581] return len; [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.2s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 504 SDtfs, 1527 SDslu, 2484 SDs, 0 SdLazy, 1177 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 441 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 588 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 533 ConstructedInterpolants, 3 QuantifiedInterpolants, 123694 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1122 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 87/138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...