./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 678e0110 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-678e011 [2019-11-19 21:15:33,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:15:33,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:15:33,232 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:15:33,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:15:33,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:15:33,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:15:33,237 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:15:33,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:15:33,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:15:33,241 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:15:33,242 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:15:33,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:15:33,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:15:33,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:15:33,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:15:33,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:15:33,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:15:33,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:15:33,254 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:15:33,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:15:33,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:15:33,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:15:33,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:15:33,271 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:15:33,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:15:33,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:15:33,273 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:15:33,273 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:15:33,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:15:33,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:15:33,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:15:33,278 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:15:33,280 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:15:33,281 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:15:33,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:15:33,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:15:33,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:15:33,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:15:33,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:15:33,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:15:33,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:15:33,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:15:33,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:15:33,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:15:33,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:15:33,321 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:15:33,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:15:33,322 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:15:33,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:15:33,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:15:33,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:15:33,324 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:15:33,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:15:33,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:15:33,325 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:15:33,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:15:33,325 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:15:33,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:15:33,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:15:33,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:15:33,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:15:33,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:15:33,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:15:33,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:15:33,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:15:33,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:15:33,328 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:15:33,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:15:33,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:15:33,329 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-19 21:15:33,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:15:33,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:15:33,646 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:15:33,648 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:15:33,648 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:15:33,649 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-19 21:15:33,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d454d4200/05d201dd7c994090ba4ad4c0f44780bb/FLAGc72527444 [2019-11-19 21:15:34,260 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:15:34,264 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-11-19 21:15:34,285 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d454d4200/05d201dd7c994090ba4ad4c0f44780bb/FLAGc72527444 [2019-11-19 21:15:34,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d454d4200/05d201dd7c994090ba4ad4c0f44780bb [2019-11-19 21:15:34,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:15:34,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:15:34,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:15:34,553 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:15:34,557 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:15:34,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:34" (1/1) ... [2019-11-19 21:15:34,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@556014d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:34, skipping insertion in model container [2019-11-19 21:15:34,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:15:34" (1/1) ... [2019-11-19 21:15:34,569 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:15:34,622 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:15:35,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:15:35,037 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:15:35,105 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:15:35,158 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:15:35,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35 WrapperNode [2019-11-19 21:15:35,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:15:35,160 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:15:35,160 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:15:35,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:15:35,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,195 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,224 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:15:35,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:15:35,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:15:35,225 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:15:35,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,239 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,248 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (1/1) ... [2019-11-19 21:15:35,262 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:15:35,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:15:35,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:15:35,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:15:35,264 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (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-19 21:15:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 21:15:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:15:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 21:15:35,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 21:15:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:15:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-19 21:15:35,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:15:35,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:15:35,792 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:15:35,793 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-19 21:15:35,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:35 BoogieIcfgContainer [2019-11-19 21:15:35,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:15:35,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:15:35,795 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:15:35,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:15:35,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:15:34" (1/3) ... [2019-11-19 21:15:35,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eae812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:35, skipping insertion in model container [2019-11-19 21:15:35,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:15:35" (2/3) ... [2019-11-19 21:15:35,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eae812 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:15:35, skipping insertion in model container [2019-11-19 21:15:35,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:35" (3/3) ... [2019-11-19 21:15:35,802 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2019-11-19 21:15:35,812 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:15:35,818 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:15:35,826 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:15:35,847 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:15:35,847 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:15:35,847 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:15:35,847 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:15:35,847 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:15:35,848 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:15:35,848 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:15:35,848 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:15:35,862 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-19 21:15:35,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 21:15:35,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:35,870 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-19 21:15:35,870 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:35,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:35,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1240059524, now seen corresponding path program 1 times [2019-11-19 21:15:35,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:35,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124855366] [2019-11-19 21:15:35,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:36,001 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-19 21:15:36,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124855366] [2019-11-19 21:15:36,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:15:36,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:15:36,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833269469] [2019-11-19 21:15:36,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:15:36,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:36,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:15:36,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:15:36,028 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-19 21:15:36,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:36,054 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2019-11-19 21:15:36,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:15:36,056 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-19 21:15:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:36,066 INFO L225 Difference]: With dead ends: 89 [2019-11-19 21:15:36,067 INFO L226 Difference]: Without dead ends: 40 [2019-11-19 21:15:36,070 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-19 21:15:36,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-19 21:15:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-19 21:15:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-19 21:15:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-11-19 21:15:36,118 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-11-19 21:15:36,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:36,119 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-19 21:15:36,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:15:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-11-19 21:15:36,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 21:15:36,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:36,122 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-19 21:15:36,123 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:36,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:36,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1466688541, now seen corresponding path program 1 times [2019-11-19 21:15:36,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:36,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448628625] [2019-11-19 21:15:36,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:36,262 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-19 21:15:36,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448628625] [2019-11-19 21:15:36,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:15:36,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 21:15:36,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817300064] [2019-11-19 21:15:36,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:15:36,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:36,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:15:36,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:15:36,266 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-11-19 21:15:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:36,397 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2019-11-19 21:15:36,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:15:36,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-11-19 21:15:36,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:36,400 INFO L225 Difference]: With dead ends: 82 [2019-11-19 21:15:36,400 INFO L226 Difference]: Without dead ends: 53 [2019-11-19 21:15:36,401 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-19 21:15:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-19 21:15:36,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-11-19 21:15:36,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 21:15:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-19 21:15:36,410 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2019-11-19 21:15:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:36,410 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-19 21:15:36,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:15:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-19 21:15:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 21:15:36,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:36,415 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-19 21:15:36,415 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:36,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:36,416 INFO L82 PathProgramCache]: Analyzing trace with hash -395195180, now seen corresponding path program 1 times [2019-11-19 21:15:36,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:36,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684784330] [2019-11-19 21:15:36,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:36,575 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-19 21:15:36,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684784330] [2019-11-19 21:15:36,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228796490] [2019-11-19 21:15:36,576 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-19 21:15:36,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:36,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 21:15:36,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:36,725 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-19 21:15:36,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:15:36,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2019-11-19 21:15:36,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268616844] [2019-11-19 21:15:36,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:15:36,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:36,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:15:36,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:15:36,728 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-11-19 21:15:36,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:36,862 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-11-19 21:15:36,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:15:36,863 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-19 21:15:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:36,864 INFO L225 Difference]: With dead ends: 84 [2019-11-19 21:15:36,864 INFO L226 Difference]: Without dead ends: 55 [2019-11-19 21:15:36,865 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-19 21:15:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-19 21:15:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-11-19 21:15:36,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-19 21:15:36,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-11-19 21:15:36,872 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2019-11-19 21:15:36,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:36,876 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-11-19 21:15:36,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:15:36,876 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-11-19 21:15:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 21:15:36,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:36,877 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-19 21:15:37,083 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:37,083 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:37,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:37,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1510946244, now seen corresponding path program 1 times [2019-11-19 21:15:37,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:37,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773237985] [2019-11-19 21:15:37,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:37,264 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-19 21:15:37,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773237985] [2019-11-19 21:15:37,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:15:37,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 21:15:37,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642096777] [2019-11-19 21:15:37,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:15:37,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:37,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:15:37,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:15:37,266 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2019-11-19 21:15:37,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:37,421 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-11-19 21:15:37,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:15:37,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-19 21:15:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:37,422 INFO L225 Difference]: With dead ends: 70 [2019-11-19 21:15:37,422 INFO L226 Difference]: Without dead ends: 65 [2019-11-19 21:15:37,423 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-19 21:15:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-19 21:15:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-11-19 21:15:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 21:15:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-11-19 21:15:37,432 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2019-11-19 21:15:37,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:37,432 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-11-19 21:15:37,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:15:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-11-19 21:15:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 21:15:37,434 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:37,434 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-19 21:15:37,434 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:37,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash -353652332, now seen corresponding path program 1 times [2019-11-19 21:15:37,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:37,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686747304] [2019-11-19 21:15:37,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:37,527 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-19 21:15:37,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686747304] [2019-11-19 21:15:37,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639018095] [2019-11-19 21:15:37,528 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-19 21:15:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:37,607 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 21:15:37,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:37,638 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-19 21:15:37,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:37,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-11-19 21:15:37,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737210847] [2019-11-19 21:15:37,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 21:15:37,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 21:15:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 21:15:37,641 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-11-19 21:15:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:37,849 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2019-11-19 21:15:37,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 21:15:37,850 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-19 21:15:37,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:37,852 INFO L225 Difference]: With dead ends: 102 [2019-11-19 21:15:37,852 INFO L226 Difference]: Without dead ends: 68 [2019-11-19 21:15:37,853 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-19 21:15:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-19 21:15:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-11-19 21:15:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-19 21:15:37,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-11-19 21:15:37,871 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-11-19 21:15:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:37,872 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-19 21:15:37,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 21:15:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-11-19 21:15:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-19 21:15:37,876 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:37,877 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-19 21:15:38,080 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:38,081 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:38,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:38,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1806454861, now seen corresponding path program 2 times [2019-11-19 21:15:38,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:38,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515996370] [2019-11-19 21:15:38,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:38,223 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-19 21:15:38,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515996370] [2019-11-19 21:15:38,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492190835] [2019-11-19 21:15:38,224 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-19 21:15:38,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 21:15:38,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:15:38,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-19 21:15:38,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:38,362 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-19 21:15:38,363 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:38,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:38,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:15:38,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-11-19 21:15:38,385 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-19 21:15:38,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:38,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:38,393 INFO L496 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-19 21:15:38,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-11-19 21:15:38,435 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:38,435 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-19 21:15:38,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:38,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:38,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:15:38,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2019-11-19 21:15:38,445 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-19 21:15:38,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:38,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-11-19 21:15:38,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482569706] [2019-11-19 21:15:38,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:15:38,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:38,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:15:38,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:15:38,453 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2019-11-19 21:15:38,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:38,832 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-11-19 21:15:38,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:15:38,833 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-11-19 21:15:38,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:38,834 INFO L225 Difference]: With dead ends: 75 [2019-11-19 21:15:38,834 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 21:15:38,835 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-19 21:15:38,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 21:15:38,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-11-19 21:15:38,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-19 21:15:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-11-19 21:15:38,844 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-11-19 21:15:38,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:38,845 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-19 21:15:38,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:15:38,845 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-11-19 21:15:38,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 21:15:38,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:38,846 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-19 21:15:39,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:39,051 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:39,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:39,052 INFO L82 PathProgramCache]: Analyzing trace with hash 217180203, now seen corresponding path program 3 times [2019-11-19 21:15:39,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:39,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531081123] [2019-11-19 21:15:39,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:39,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:39,379 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-19 21:15:39,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531081123] [2019-11-19 21:15:39,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672529657] [2019-11-19 21:15:39,380 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-19 21:15:39,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-19 21:15:39,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:15:39,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-19 21:15:39,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:39,574 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-19 21:15:39,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:39,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-11-19 21:15:39,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217570950] [2019-11-19 21:15:39,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 21:15:39,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:39,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 21:15:39,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-19 21:15:39,577 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-11-19 21:15:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:40,159 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2019-11-19 21:15:40,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 21:15:40,160 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-11-19 21:15:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:40,161 INFO L225 Difference]: With dead ends: 213 [2019-11-19 21:15:40,161 INFO L226 Difference]: Without dead ends: 205 [2019-11-19 21:15:40,162 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-19 21:15:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-11-19 21:15:40,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-11-19 21:15:40,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-19 21:15:40,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-11-19 21:15:40,179 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2019-11-19 21:15:40,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:40,179 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-11-19 21:15:40,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 21:15:40,180 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-11-19 21:15:40,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-19 21:15:40,181 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:40,181 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-19 21:15:40,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:40,393 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:40,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:40,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1805693939, now seen corresponding path program 4 times [2019-11-19 21:15:40,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:40,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333302594] [2019-11-19 21:15:40,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:40,646 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-19 21:15:40,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333302594] [2019-11-19 21:15:40,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084614845] [2019-11-19 21:15:40,647 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-19 21:15:40,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-19 21:15:40,722 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 21:15:40,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-19 21:15:40,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:40,735 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-19 21:15:40,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,745 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:40,745 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-11-19 21:15:40,782 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-19 21:15:40,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:40,796 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-19 21:15:40,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:40,803 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,804 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-11-19 21:15:40,840 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:40,841 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-19 21:15:40,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:40,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-19 21:15:40,898 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-19 21:15:40,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:40,918 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-19 21:15:40,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:40,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:15:40,930 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-11-19 21:15:41,313 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 21:15:41,315 INFO L343 Elim1Store]: treesize reduction 8, result has 92.9 percent of original size [2019-11-19 21:15:41,316 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-19 21:15:41,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:41,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:41,921 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 21:15:41,982 INFO L567 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2019-11-19 21:15:42,016 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:15:42,016 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-19 21:15:42,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:15:42,047 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-11-19 21:15:42,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 21:15:42,050 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:15:42,050 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:7 [2019-11-19 21:15:42,059 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-19 21:15:42,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:42,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-11-19 21:15:42,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546519565] [2019-11-19 21:15:42,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 21:15:42,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:42,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 21:15:42,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-19 21:15:42,061 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2019-11-19 21:15:42,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:42,655 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-11-19 21:15:42,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 21:15:42,656 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-11-19 21:15:42,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:42,657 INFO L225 Difference]: With dead ends: 168 [2019-11-19 21:15:42,657 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 21:15:42,658 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-19 21:15:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 21:15:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2019-11-19 21:15:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-19 21:15:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2019-11-19 21:15:42,675 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2019-11-19 21:15:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:42,675 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2019-11-19 21:15:42,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 21:15:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2019-11-19 21:15:42,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:15:42,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:42,677 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-19 21:15:42,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:42,881 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:42,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:42,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1169066102, now seen corresponding path program 1 times [2019-11-19 21:15:42,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:42,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141607775] [2019-11-19 21:15:42,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:42,974 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-19 21:15:42,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141607775] [2019-11-19 21:15:42,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311361386] [2019-11-19 21:15:42,975 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-19 21:15:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:43,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 21:15:43,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:43,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:43,069 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-19 21:15:43,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 21:15:43,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-19 21:15:43,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949116545] [2019-11-19 21:15:43,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 21:15:43,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:43,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 21:15:43,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-19 21:15:43,071 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2019-11-19 21:15:43,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:43,433 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-11-19 21:15:43,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-19 21:15:43,436 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-11-19 21:15:43,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:43,440 INFO L225 Difference]: With dead ends: 375 [2019-11-19 21:15:43,440 INFO L226 Difference]: Without dead ends: 289 [2019-11-19 21:15:43,441 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-19 21:15:43,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-19 21:15:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2019-11-19 21:15:43,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-19 21:15:43,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2019-11-19 21:15:43,461 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2019-11-19 21:15:43,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:43,461 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2019-11-19 21:15:43,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 21:15:43,461 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2019-11-19 21:15:43,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:15:43,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:43,463 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-19 21:15:43,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:43,666 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:43,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:43,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1846037516, now seen corresponding path program 1 times [2019-11-19 21:15:43,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:43,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126353817] [2019-11-19 21:15:43,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:43,748 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-19 21:15:43,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126353817] [2019-11-19 21:15:43,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910765327] [2019-11-19 21:15:43,749 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-19 21:15:43,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:15:43,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 21:15:43,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:15:43,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:15:43,855 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-19 21:15:43,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 21:15:43,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-11-19 21:15:43,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664688240] [2019-11-19 21:15:43,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 21:15:43,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:15:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 21:15:43,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-19 21:15:43,858 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 7 states. [2019-11-19 21:15:44,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:15:44,075 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-11-19 21:15:44,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 21:15:44,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-11-19 21:15:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:15:44,078 INFO L225 Difference]: With dead ends: 273 [2019-11-19 21:15:44,078 INFO L226 Difference]: Without dead ends: 241 [2019-11-19 21:15:44,079 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-19 21:15:44,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-19 21:15:44,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-11-19 21:15:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-19 21:15:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2019-11-19 21:15:44,102 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2019-11-19 21:15:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:15:44,103 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2019-11-19 21:15:44,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 21:15:44,103 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2019-11-19 21:15:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-19 21:15:44,104 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:15:44,104 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-19 21:15:44,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 21:15:44,310 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:15:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:15:44,312 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902770, now seen corresponding path program 1 times [2019-11-19 21:15:44,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:15:44,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372080911] [2019-11-19 21:15:44,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:15:44,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:15:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:15:44,382 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:15:44,382 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:15:44,432 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:15:44 BoogieIcfgContainer [2019-11-19 21:15:44,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:15:44,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:15:44,433 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:15:44,433 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:15:44,434 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:15:35" (3/4) ... [2019-11-19 21:15:44,436 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:15:44,506 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:15:44,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:15:44,508 INFO L168 Benchmark]: Toolchain (without parser) took 9956.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 330.3 MB). Free memory was 956.3 MB in the beginning and 1.3 GB in the end (delta: -358.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:15:44,509 INFO L168 Benchmark]: CDTParser took 0.53 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-19 21:15:44,509 INFO L168 Benchmark]: CACSL2BoogieTranslator took 607.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-19 21:15:44,510 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.64 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:15:44,510 INFO L168 Benchmark]: Boogie Preprocessor took 37.64 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-19 21:15:44,511 INFO L168 Benchmark]: RCFGBuilder took 532.13 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.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:15:44,512 INFO L168 Benchmark]: TraceAbstraction took 8636.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:15:44,512 INFO L168 Benchmark]: Witness Printer took 74.04 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:15:44,515 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.53 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 607.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -176.4 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.64 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.64 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 532.13 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.7 MB). Peak memory consumption was 30.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8636.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 174.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -214.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 74.04 ms. Allocated memory is still 1.4 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: 8.5s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 504 SDtfs, 1527 SDslu, 2484 SDs, 0 SdLazy, 1177 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.2s 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 441 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s 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...